FOCS Proof Reproducibility & Checkability

•
1.1k
•

Hardens theoretical computer science papers for FOCS by auditing hypotheses, preventing theorem drift across versions, and verifying imported proofs.

FOCS Reproducibility helps theoretical computer science researchers engineer rigorous checkability into papers submitted to the IEEE Symposium on Foundations of Computer Science (FOCS). It provides systematic workflows for tracking hypotheses in formal ledgers, mechanically verifying theorem statement consistency across submission and arXiv versions via hashing, auditing imported external theorems against parameter regimes, and generating verifiable certificates for computer-assisted proof steps. It is essential for authors preparing FOCS, STOC, or SODA submissions who want to eliminate silent assumptions, prevent referee disputes, and maintain long-term archival integrity.

Key Features

01Hypothesis ledger tracking to ensure all assumptions are visible in formal theorem statements
02Imported theorem auditing to verify parameter regimes and exact source citations
03Certificate and verification script packaging for computer-assisted proof steps
04Automated theorem statement freezing and hash-diffing between submission and arXiv preprints
051,079 GitHub stars
06Changelog and errata guidelines to manage post-submission revisions responsibly

Use Cases

01Ensuring bit-identical formal statements across HotCRP, ECCC, arXiv, and camera-ready versions
02Conducting pre-submission audits to eliminate silent standing assumptions in theoretical papers
03Packaging machine-generated certificates and lightweight verification scripts for peer reviewers