Satisfiability Checking: Theory and Applications
From MaRDI portal
Publication:4571125
DOI10.1007/978-3-319-41591-8_2zbMath1390.68569OpenAlexW2505717744MaRDI QIDQ4571125
Publication date: 6 July 2018
Published in: Software Engineering and Formal Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-41591-8_2
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- raSAT: An SMT Solver for Polynomial Constraints
- Building Bridges between Symbolic Computation and Satisfiability Checking
- Solving Non-linear Arithmetic
- SMT-Based Analysis of Virtually Synchronous Distributed Hybrid Systems
- SAT-Based Model Checking without Unrolling
- Proving Termination of Programs Automatically with AProVE
- SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
- Program Synthesis Using Dual Interpretation
- Simplification by Cooperating Decision Procedures
- GRASP: a search algorithm for propositional satisfiability
- Interval-Based Relaxation for General Numeric Planning.
- The Strategy Challenge in SMT Solving
- Nagoya Termination Tool
- The MathSAT5 SMT Solver
- Symbolic optimization with SMT solvers
- A Decision Procedure for Bit-Vectors and Arrays
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Computer Aided Verification
This page was built for publication: Satisfiability Checking: Theory and Applications