Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
type: Item
instance of: scholarly article
title: Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
zbMATH Open document ID: 1104.68719
author: Clark Barrett
author: Leonardo de Moura
author: Aaron Stump
published in: Journal of Automated Reasoning
publication date: 2007-01-30T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 5119730
describes a project that uses: MathSAT
describes a project that uses: ESC/Java
describes a project that uses: Velev SAT Benchmarks
describes a project that uses: ICS
describes a project that uses: MiniSat
describes a project that uses: SATO
describes a project that uses: SMT-LIB
describes a project that uses: CVC Lite
describes a project that uses: CVC
MaRDI profile type: MaRDI publication profile
full work available at URL: s10817-006-9026-1
OpenAlex ID: W2128543030
cites work: Solvable cases of the decision problem
cites work: Theory and Applications of Satisfiability Testing
cites work: A rewriting approach to satisfiability procedures.
cites work: Q2723410
cites work: Q4804899
cites work: Computer Aided Verification
cites work: Q4553262
cites work: Bounded model checking using satisfiability solving
cites work: Q4427892
cites work: Q4553256
cites work: Tools and Algorithms for the Construction and Analysis of Systems
cites work: Q3150299
cites work: Q4474229
cites work: Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
cites work: Q4808819
cites work: A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems
cites work: Q4804919
cites work: Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
DOI: 10.1007/S10817-006-9026-1
description: scientific article; zbMATH DE number 5119730