Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
From MaRDI portal
Publication:861691
DOI10.1007/S10817-006-9026-1zbMATH Open1104.68719OpenAlexW2128543030MaRDI QIDQ861691FDOQ861691
Authors: Clark Barrett, Leonardo de Moura, Aaron Stump
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
Recommendations
Cites Work
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Title not available (Why is that?)
- A rewriting approach to satisfiability procedures.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computer Aided Verification
- Theory and Applications of Satisfiability Testing
- Computer Aided Verification
- Bounded model checking using satisfiability solving
- Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
- Solvable cases of the decision problem
- Computer Aided Verification
- Tools and Algorithms for the Construction and Analysis of Systems
- Theory and Applications of Satisfiability Testing
- Title not available (Why is that?)
- A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Theory and Applications of Satisfiability Testing
Cited In (9)
- Controlling a solver execution with the runsolver Tool
- The 2013 evaluation of SMT-COMP and SMT-LIB
- Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)
- Theory and Applications of Satisfiability Testing
- A framework for satisfiability modulo theories
- Promoting robust black-box solvers through competitions
- Satisfiability modulo theories
- Computer Aided Verification
- SAT competition 2020
Uses Software
This page was built for publication: Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q861691)