2026· International Conference on Interactive Theorem Proving· pp. 9:1-9:19· 1 citation· 17 references
Computer Science
TL;DR
The notes provided in the original description by Pornin are expanded into a complete formal proof, which eventually relies on the collaboration of deductive program verification and interactive theorem proving through the use of the tools Rocq and Why3.
A new multiplication algorithm for tristate numbers improving upon the state-of-the-art implementation from the Linux kernel in terms of precision and formal proofs is given, and the soundness and optimality of the newly added tnum union operation and the existing tnum addition algorithm are provided.
Nandakumar Edamana, Piyush P. Kurur, Unnikrishnan Cheramangalath· 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
A QuickCheck testing method based on generating and shrinking random execution traces based on checking if the first and last terms of a generated trace share the same deterministic normal form that efficiently finds counterexamples and enables fast, robust shrinking.
Koen Claessen· Proc. ACM Program. Lang.· 0 citations
A userspace version of the kernel verifier is developed and appended to the BPF backend to increase the class of programs accepted by the Linux eBPF verifier without increasing its complexity.
Ya-Lu Cai, Santosh Nagarakatte· Proceedings of the 4th Works...· 0 citations
We give the simplest known algebraic proof of the PCP theorem, involving only ingredients like code concatenation, polynomial interpolation, and polynomial multiplication. Specifically, we prove that graph 3-coloring has a polynomial-sized proof that can be verified by a verifier tossing logarithmically many coins and...
Prashanth Amireddy, Amik Raj Behera, Srikanth Srinivasan et al.· 0 citations
The refutation gap is closed with a pipeline that synthesizes minimal linear straight-line programs over GF(2), where every decisive UNSAT answer emits a DRAT proof checked by an independent third-party checker.
Rohan Pandey· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
