A rewriting approach to satisfiability procedures
Information and Computation - RTA 2001
Model-based Theory Combination
Electronic Notes in Theoretical Computer Science (ENTCS)
System Description: Spass Version 3.0
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
New results on rewrite-based satisfiability procedures
ACM Transactions on Computational Logic (TOCL)
CRefine: Support for the Circus Refinement Calculus
SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
Tool Building Requirements for an API to First-Order Solvers
Electronic Notes in Theoretical Computer Science (ENTCS)
SMT-COMP: satisfiability modulo theories competition
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
DPLL(T) with exhaustive theory propagation and its application to difference logic
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Exploiting symmetry in SMT problems
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Compression of propositional resolution proofs via partial regularization
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Automatic verification for a class of proof obligations with SMT-solvers
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Integrating SMT-solvers in z and b tools
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Combining decision procedures by (model-)equality propagation
Science of Computer Programming
Verifying safety properties with the TLA+ proof system
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Modular SMT proofs for fast reflexive checking inside coq
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
versat: a verified modern SAT solver
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
ABZ'12 Proceedings of the Third international conference on Abstract State Machines, Alloy, B, VDM, and Z
Implementing tactics of refinement in CRefine
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
Integration of SMT-solvers in B and Event-B development environments
Science of Computer Programming
SMT proof checking using a logical framework
Formal Methods in System Design
| Hi-index | 0.00 |
This article describes the first public version of the satisfiability modulo theory (SMT) solver veriT. It is open-source, proof-producing, and complete for quantifier-free formulas with uninterpreted functions and difference logic on real numbers and integers.