ICALP Proof Strategy & Computation
Aligns theoretical proof strategies with claim types and integrates reproducible computer-assisted verification for ICALP computer science papers.
The ICALP Experiments skill provides specialized guidance for theoretical computer science researchers preparing submissions for ICALP (EATCS). It guides authors in matching rigorous proof arguments—such as upper bounds, approximation analyses, fine-grained conditional reductions, and complexity dichotomies—to their precise claim shapes while preventing common referee objections. Additionally, it governs the legitimate use of supporting computation, such as SAT/SMT-certified lemmas, computer-assisted case analyses, and exhaustive base-case verifications, ensuring these computational steps provide independently checkable certificates and remain reproducible without diluting theoretical manuscripts with unnecessary empirical benchmark framing.