Satisfiability modulo theories
Abstract Satisfiability Modulo Theories (SMT) refers to the problem of determining whether a
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …
first-order formula is satisfiable with respect to some logical theory. Solvers based on SMT …
[PDF][PDF] Hammering towards QED
The main ingredients underlying this approach are efficient automatic theorem provers that
can cope with hundreds of axioms, suitable translations of the proof assistant's logic to the …
can cope with hundreds of axioms, suitable translations of the proof assistant's logic to the …
Extending Sledgehammer with SMT solvers
Sledgehammer is a component of Isabelle/HOL that employs resolution-based first-order
automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It …
automatic theorem provers (ATPs) to discharge goals arising in interactive proofs. It …
veriT: an open, trustable and efficient SMT-solver
veriT: An Open, Trustable and Efficient SMT-Solver Page 1 veriT: An Open, Trustable and
Efficient SMT-Solver Thomas Bouton2, Diego Caminha B. de Oliveira2, David Déharbe1 …
Efficient SMT-Solver Thomas Bouton2, Diego Caminha B. de Oliveira2, David Déharbe1 …
A modular integration of SAT/SMT solvers to Coq through proof witnesses
M Armand, G Faure, B Grégoire, C Keller… - … Conference on Certified …, 2011 - Springer
We present a way to enjoy the power of SAT and SMT provers in Coq without compromising
soundness. This requires these provers to return not only a yes/no answer, but also a proof …
soundness. This requires these provers to return not only a yes/no answer, but also a proof …
Challenging SMT solvers to verify neural networks
In recent years, Satisfiability Modulo Theory (SMT) solvers are becoming increasingly
popular in the Computer Aided Verification and Reasoning community. Used natively or as …
popular in the Computer Aided Verification and Reasoning community. Used natively or as …
Fast LCF-style proof reconstruction for Z3
S Böhme, T Weber - … Theorem Proving: First International Conference, ITP …, 2010 - Springer
Abstract The Satisfiability Modulo Theories (SMT) solver Z3 can generate proofs of
unsatisfiability. We present independent reconstruction of these proofs in the theorem …
unsatisfiability. We present independent reconstruction of these proofs in the theorem …
Satisfiability modulo theories
Applications in artificial intelligence, formal verification, and other areas have greatly
benefited from the recent advances in SAT. It is often the case, however, that applications in …
benefited from the recent advances in SAT. It is often the case, however, that applications in …
[PDF][PDF] Flexible proof production in an industrial-strength SMT solver
Proof production for SMT solvers is paramount to ensure their correctness independently
from implementations, which are often prohibitively difficult to verify. Historically, however …
from implementations, which are often prohibitively difficult to verify. Historically, however …
Fast reflexive arithmetic tactics the linear case and beyond
F Besson - Types for Proofs and Programs: International Workshop …, 2007 - Springer
When goals fall in decidable logic fragments, users of proof-assistants expect automation.
However, despite the availability of decision procedures, automation does not come for free …
However, despite the availability of decision procedures, automation does not come for free …