ICALP Proof Reproducibility
Ensures theoretical computer science proof verifiability and rigor for ICALP submissions through complete appendices, computational certificates, and formalization guidance.
Ensures theoretical computer science proof verifiability and rigor for ICALP submissions through complete appendices, computational certificates, and formalization guidance.
The ICALP Proof Reproducibility skill is designed for theoretical computer science researchers submitting to ICALP (EATCS) and related pure-theory venues where traditional runnable artifacts do not apply. Since ICALP lacks an artifact evaluation track, reproducibility is achieved through fully self-contained proofs in the appendix and public full versions (such as arXiv, ECCC, or HAL). This skill helps authors eliminate unverified leaps, verify lemma dependency graphs, structure reproducible computational certificates (e.g., UNSAT witnesses or LP certificates), and integrate optional machine-checked proofs in Lean, Coq, or Isabelle while preserving double-blind anonymity.