This is an artifact created for CAV 2023 submission: "Certified Verification for Algebraic Abstraction". We present a certified algebraic abstraction technique for verifying bit-accurate non-linear integer computations. Our certified algebraic abstraction is implemented in the verified model checker CoqCryptoLine. The CoqCryptoLine tool is built on the OCaml programs extracted from verified formalizations. We evaluate our algebraic abstraction on real-world cryptographic programs. This artifact contains CoqCryptoLine, CryptoLine, and benchmarks used to replicate the experimental results (Table 1) in the paper. The extracted OCaml code of CoqCryptoLine in this artifact is instrumented to report the running time of CoqQFBV
Cryptography and computational algebra designs are complex systems based on modular arithmetic and b...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyon...
We present a program verification framework based on coinduction, which makes it feasible to verif...
This is an artifact created for CAV 2023 submission: "Certified Verification for Algebraic Abstracti...
This is an artifact created for CAV 2023 submission: "CoqCryptoLine: A Verified Model Checker with C...
AbstractThe FOC project, started at the fall 1997, is aimed to build a programming environment for t...
I report on an experience using the Coq proof assistant to develop a program verification tool with ...
See also http://www-verimag.imag.fr/~boulme/hdr.htmlThis document presents a lightweight approach – ...
International audienceIn cryptology, verifiable computing aims at verifying the remote execution of ...
This preprint has been largely rewritten and integrated into Sylvain Boulm{\'e}'s Habilitation in 20...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyo...
This paper reports on the first steps towards the formal verification of correctness proofs of real-...
Abstract. Convex polyhedra provide a relational abstraction of numer-ical properties for static anal...
International audienceThe insertion of expressions mixing arithmetic operators and bitwise boolean o...
This paper deals with program verification and more precisely with the question of how to provide ve...
Cryptography and computational algebra designs are complex systems based on modular arithmetic and b...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyon...
We present a program verification framework based on coinduction, which makes it feasible to verif...
This is an artifact created for CAV 2023 submission: "Certified Verification for Algebraic Abstracti...
This is an artifact created for CAV 2023 submission: "CoqCryptoLine: A Verified Model Checker with C...
AbstractThe FOC project, started at the fall 1997, is aimed to build a programming environment for t...
I report on an experience using the Coq proof assistant to develop a program verification tool with ...
See also http://www-verimag.imag.fr/~boulme/hdr.htmlThis document presents a lightweight approach – ...
International audienceIn cryptology, verifiable computing aims at verifying the remote execution of ...
This preprint has been largely rewritten and integrated into Sylvain Boulm{\'e}'s Habilitation in 20...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyo...
This paper reports on the first steps towards the formal verification of correctness proofs of real-...
Abstract. Convex polyhedra provide a relational abstraction of numer-ical properties for static anal...
International audienceThe insertion of expressions mixing arithmetic operators and bitwise boolean o...
This paper deals with program verification and more precisely with the question of how to provide ve...
Cryptography and computational algebra designs are complex systems based on modular arithmetic and b...
Formal verification of complex algorithms is challenging. Verifying their implementations goes beyon...
We present a program verification framework based on coinduction, which makes it feasible to verif...