5 citations · 5 across the 6 of their papers we have counts for
6 papers · 1 filter
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…
Generalizing CDCL with Graph Backtracking
Robin Coutelier, Thomas Hader, Laura Kovács
We present graph backtracking, a novel, fine-grained backtracking scheme for CDCL-based SAT solving, parametrized by a user-defined weight function. For conflict repair, we challen…
Boosting MCSat Modulo Nonlinear Integer Arithmetic via Local Search
Enrico Lipparini, Thomas Hader, Ahmed Irfan +1
The Model Constructing Satisfiability (MCSat) approach to the SMT problem extends the ideas of CDCL from the SAT level to the theory level. Like SAT, its search is driven by increm…
An SMT-LIB Theory of Finite Fields
Thomas Hader, Alex Ozdemir
In the last few years there have been rapid developments in SMT solving for finite fields. These include new decision procedures, new implementations of SMT theory solvers, and new…
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…
SMT Solving over Finite Field Arithmetic
Thomas Hader, Daniela Kaufmann, Laura Kovács
Non-linear polynomial systems over finite fields are used to model functional behavior of cryptosystems, with applications in system security, computer cryptography, and post-quant…