Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)

DOI10.1007/s10817-006-9026-1zbMath1104.68719OpenAlexW2128543030MaRDI QIDQ861691

Leonardo de Moura, Aaron Stump, Clark Barrett

Publication date: 30 January 2007

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10817-006-9026-1

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Satisfiability Modulo Theories, Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006), A framework for satisfiability modulo theories

Uses Software

• MiniSat
• SMT-LIB
• SATO
• ESC/Java
• CVC Lite
• MathSAT
• CVC
• Velev SAT Benchmarks
• ICS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A rewriting approach to satisfiability procedures.
• Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
• Solvable cases of the decision problem
• Tools and Algorithms for the Construction and Analysis of Systems
• Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
• Computer Aided Verification
• Computer Aided Verification
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems
• Tools and Algorithms for the Construction and Analysis of Systems
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Computer Aided Verification
• Bounded model checking using satisfiability solving