2026· International Conference on Interactive Theorem Proving· pp. 6:1-6:18· 0 citations· 28 references
Computer Science
TL;DR
The key idea is to implement an entailment checker as a combination of an efficient but unverified prover, suitable for fast-paced interactive proofs, and a proof reconstruction procedure that takes the prover’s trace and produces a certificate of entailment validity that can be checked a posteriori.
FLEX is presented, a foundational Constrained Horn Clause (CHC) solver implemented in LEAN, that reduces the trusted base to the kernel alone, and allows using LEAN's entire proof ecosystem to verify low-level systems code, via three contributions.
J. Khan, Petros Markopoulos, Nicolás Lehmann et al.· arXiv.org· 0 citations
This work presents a deductive verification framework based on a weighted assertion language and an intermediate verification language, whose weight domains are ordered structures with implication and coimplication, which let verification conditions express lower- and upper-bound obligations internally.
Emma Ahrens, Samuel Rode, Philipp Schröer et al.· 0 citations
This pearl shows how a clean separation can be achieved within the two-layer method by combining two simple ideas: expressing implementation correctness as a relational Hoare quadruple, and introducing assertion annotations into the abstract program to capture key invariants.
Shu-Shu Wu, Cheng-Xi Yang, Xi-Wei Wu et al.· Proc. ACM Program. Lang.· 0 citations
This paper presents the formal semantics for unfolding expressions and pure functions for a static verifier using symbolic execution, extend it for a gradual verifier, and provides a proof of soundness.
Hazel Torek, Long Nguyen, Priyam Gupta et al.· arXiv.org· 0 citations
It is concluded that foundational mechanized proofs can now be bought at the price of tokens, and that this shift can reshape how verification frameworks are architected.
By integrating the proof rules into the Prolog-based validation tool ProB, this work obtains an interactive proof system with proof tree visualisation, giving students direct control over the selection of proof rules.
Katharina Engels, Jan Gruteser, Michael Leuschel· Electronic Proceedings in Th...· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
