Published April 25, 2023
| Version 0.1
Software
Open
Satisfiability Modulo Finite Fields
Authors/Creators
- 1. Stanford University
- 2. Stanford University, Certora
- 3. University of Iowa
Description
This is the artifact for "Satisfiability Modulo Finite Fields", which appeared at CAV'23.
Paper Abstract: We study satisfiability modulo the theory of finite fields and give a decision procedure for this theory. We implement our procedure for prime fields inside the cvc5 SMT solver. Using this theory, we construct SMT queries that encode translation validation for various zero knowledge proof compilers applied to Boolean computations. We evaluate our procedure on these benchmarks. Our experiments show that our implementation is superior to previous approaches (which encode field arithmetic using integers or bit-vectors).