6 papers
A Modern View on MCSat
Thomas Hader, Theo Jauschneg, Daniela Kaufmann +1
The Model Constructing Satisfiability (MCSat) approach has shown strong performance in solving complex SMT problems, in particular in algebraic SMT theories such as non-linear inte…
Saturating Sorting without Sorts
Pamina Georgiou, Márton Hajdu, Laura Kovács
We present a first-order theorem proving framework for establishing the correctness of functional programs implementing sorting algorithms with recursive data structures. We formal…
Rewriting and Inductive Reasoning
Márton Hajdu, Laura Kovács, Michael Rawson
Rewriting techniques based on reduction orderings generate "just enough" consequences to retain first-order completeness. This is ideal for superposition-based first-order theorem…
Spanning Matrices via Satisfiability Solving
Clemens Eisenhofer, Michael Rawson, Laura Kovács
We propose a new encoding of the first-order connection method as a Boolean satisfiability problem. The encoding eschews tree-like presentations of the connection method in favour…
MCSat-based Finite Field Reasoning in the Yices2 SMT Solver
Thomas Hader, Daniela Kaufmann, Ahmed Irfan +2
This system description introduces an enhancement to the Yices2 SMT solver, enabling it to reason over non-linear polynomial systems over finite fields. Our reasoning approach fits…
Linear Loop Synthesis for Quadratic Invariants
S. Hitarth, George Kenison, Laura Kovács +1
Invariants are key to formal loop verification as they capture loop properties that are valid before and after each loop iteration. Yet, generating invariants is a notorious task a…