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.
This work proposes a proof calculus that captures the decision procedure for finite field reasoning employed by the SMT solver CVC 5 and instrumenting the solver to generate proofs within this calculus, and introduces an extension of the Practical Algebraic Calculus that mirrors the proposed system.
Pedro Saccomani, Abdalrhman Mohamed, Elizaveta Pertseva et al.· 0 citations
This paper introduces a proof term calculus with dedicated features for bounds, for which an elaborator can automatically infer bound-related manipulations, improving usability and reducing user inputs, and theoretically argues for its usability through an erasability theorem.
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.
Ruben Götz, Michael Dörr, Dominik Schreiber· International Conference on...· 0 citations
Security protocols are concurrent processes that communicate using cryptography to achieve various security properties. Their formal verification has been the subject of much research, which has led to a number of successful tools. Several of these tools use variants of the applied pi-calculus as an input language to m...
David Baelde, Stéphanie Delaune, Julia Gabet et al.· IEEE Computer Security Found...· 0 citations
ZEBRA is a fully automated verification and bug-detection framework that reduces zkVM verification to a solution-set cardinality problem over a canonical trace space, where redundancies such as null-row padding and non-deterministic permutations are eliminated prior to counting.
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. Mahboubi, Guillaume Melquiond, Pierre-Yves Strub et al.· International Conference on...· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.