Satisfiability checking: theory and applications
From MaRDI portal
Publication:4571125
DOI10.1007/978-3-319-41591-8_2zbMATH Open1390.68569OpenAlexW2505717744MaRDI QIDQ4571125FDOQ4571125
Authors: Erika Ábrahám, Gereon Kremer 
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
Recommendations
Cites Work
- \texttt{SMT-RAT}: an open source \texttt{C++} toolbox for strategic and parallel SMT solving
- The MathSAT5 SMT solver
- Nagoya termination tool
- A Decision Procedure for Bit-Vectors and Arrays
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simplification by Cooperating Decision Procedures
- GRASP: a search algorithm for propositional satisfiability
- A Computing Procedure for Quantification Theory
- A machine program for theorem-proving
- Decision procedures. An algorithmic point of view. With foreword by Randal E. Bryant
- Solving non-linear arithmetic
- SAT-Based Model Checking without Unrolling
- Title not available (Why is that?)
- Computer Aided Verification
- Title not available (Why is that?)
- Quantifier elimination for real algebra -- the quadratic case and beyond
- Title not available (Why is that?)
- Symbolic optimization with SMT solvers
- Building bridges between symbolic computation and satisfiability checking
- raSAT: An SMT Solver for Polynomial Constraints
- Proving termination of programs automatically with AProVE
- Interval-based relaxation for general numeric planning
- Program synthesis using dual interpretation
- The strategy challenge in SMT solving
- SMT-based analysis of virtually synchronous distributed hybrid systems
Cited In (19)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Building bridges between symbolic computation and satisfiability checking
- MathCheck2: A SAT+CAS Verifier for Combinatorial Conjectures
- Taking satisfiability to the next level with Z3 (abstract)
- Satisfiability Checking of Non-clausal Formulas Using General Matings
- Satisfiability checking and symbolic computation
- A Tutorial on Satisfiability Modulo Theories
- Satisfiability: where Theory meets Practice (Invited Talk).
- Satisfiability modulo theories: an appetizer
- Satisfiability modulo bounded checking
- Title not available (Why is that?)
- Simplification in a satisfiability checker for VLSI applications
- Testing satisfiability
- Automating Boolean set operations in Mizar proof checking with the aid of an external SAT solver
- The problem of checking the satisfiability of formulae of decidable theories (survey)
- Computer Aided Verification
- Beyond satisfiability: extensions and applications
- \textsf{SC}\(^2\): satisfiability checking meets symbolic computation. (Project paper)
Uses Software
This page was built for publication: Satisfiability checking: theory and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571125)
