Coinductive Proofs for Temporal Hyperliveness
summary
Framework shows that every forall∃ψ hyperproperty with ψ a safety relation admits a coinductive approximation, enabling incremental witness construction via parameterized coinduction. The authors build HyCo, mechanized in Coq, prove its soundness (proof uses the axiom of choice), and apply it to verify reactive imperative programs with nondeterminism and I/O. Implementation and evaluated artifacts are available (Zenodo); the logic is sound but not complete, and probabilistic or prophecy extensions remain future work.
AI-written summary · about
chapters (11)
- 0:00Introduction
- 0:23Coinductive proofs for hyperproperties
- 1:05Hyperproperties for reactive systems
- 3:34Formalizing non-interference
- 4:37Verifying hyperproperties challenges
- 7:03HIO proof framework
- 9:59Proof rules for relational invariance
- 12:28Local and incremental proofs
- 13:53Limitations and future work
- 15:18Resources and conclusion
- 15:40Q&A
