PySMT: a Solver-Agnostic Library for Fast Prototy** of SMT-Based Algorithms Page 1 PySMT:
a Solver-Agnostic Library for Fast Prototy** of SMT-Based Algorithms Marco Gario and …

Satisfiability Modulo Theories (SMT) solvers serve as the core engine of many techniques,
such as symbolic execution. Therefore, ensuring the robustness and correctness of SMT …

Ensuring the equality of SMT solvers is critical due to its broad spectrum of applications in
academia and industry, such as symbolic execution and program verification. Existing …

We investigate the use of coverage-guided fuzzing as a means of proving satisfiability of
SMT formulas over finite variable domains, with specific application to floating-point …

We consider the problem of deciding the theory of finite sets with cardinality constraints
using a satisfiability modulo theories solver. Sets are a common high-level data structure …

We present a method and an associated system, called MathCheck, that embeds the
functionality of a computer algebra system (CAS) within the inner loop of a conflict-driven …

SMT solving is often a major source of cost in a broad range of techniques such as symbolic
program analysis. Thus, speeding up SMT solving is still an urgent requirement. A dominant …

We describe the LoopInvGen tool for generating loop invariants that can provably guarantee
correctness of a program with respect to a given specification. LoopInvGen is an efficient …

We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory
of finite sets with cardinality constraints. Sets are a common high-level data structure used in …

Model checking is an automatic technique for the verification of temporal properties of a
system. In this technique, a system is represented as a labelled graph and the specification …