2026· International Conference on Theory and Applications of Satisfiability Testing· pp. 17:1-17:19· 0 citations· 36 references
Computer Science
TL;DR
PalRUP is introduced – an LRUP -based proof format and a bottleneck-free, decentralized parallel checking procedure that only uses the (parallel) file system and is composed of a set of small, sequential trusted components.
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 formal definition of DRCP, a proof system for CP over integer domains that captures core solver operations, including conflict analysis and heterogeneous propagation, by modular inference rules with precise semantics and develops FznDrcpCheck, a formally verified proof checker in Rocq that validate...
Maarten Flippo, K. Sidorov, Tip ten Brink et al.· International Conference on...· 1 citation
This work introduces a framework that addresses both verification levels in the Lean theorem prover, and can be used to prove formulation-level properties, such as equivalence, equisatisfiability, and the correctness of symmetry-breaking constraints, parametrically for entire problem families.
Pablo Manrique, Stefan Szeider· arXiv.org· 0 citations
The starting insight of Spain is that since numerical computations inherently have approximation error, the constraint formalism should likewise allow for approximate satisfiability, and this paper introduces a new proof protocol and new ways to translate computations to constraints.
Zachary DeStefano, N. Golub, Zile Huang et al.· IACR Cryptology ePrint Archi...· 0 citations
This work presents a proof trimmer for Boolean satisfiability solving, and shows how this technique can be used to reduce proof size and proof checking time for richer combinatorial paradigms.
Berhan Oumer Adame, Bart Bogaerts, Benjamin Bogø et al.· 0 citations
This system description reports on how Kissat’s award-winning techniques were adapted to the full-featured incremental SAT solver CaDiCaL, including clausal congruence closure, clausal equivalence sweeping, and bounded variable addition, to support efficient linear proof production with hints.
Florian Pollitt, Mathias Fleury, Katalin Fazekas et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
