Computer Aided Verification
From MaRDI portal
Publication:5312909
DOI10.1007/B98490zbMATH Open1103.68626OpenAlexW4298302743MaRDI QIDQ5312909FDOQ5312909
Sanjit A. Seshia, Joël Ouaknine, Ofer Strichman, Daniel Kroening
Publication date: 25 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98490
Recommendations
- scientific article; zbMATH DE number 1979549
- scientific article; zbMATH DE number 1979550
- Interpolating quantifier-free Presburger arithmetic
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
- Interpolant based decision procedure for quantifier-free Presburger arithmetic
Specification and verification (program logics, model checking, etc.) (68Q60) Mechanization of proofs and logical operations (03B35)
Cited In (11)
- Efficient theory combination via Boolean search
- Title not available (Why is that?)
- Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
- TaPAS: The Talence Presburger Arithmetic Suite
- Incremental SAT-Based Method with Native Boolean Cardinality Handling for the Hamiltonian Cycle Problem
- Deciding Quantifier-Free Presburger Formulas Using Parameterized Solution Bounds
- An approach for extracting a small unsatisfiable core
- SAT-Based Model Checking
- M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
- Interpolant based decision procedure for quantifier-free Presburger arithmetic
- A sound and complete abstraction for reasoning about parallel prefix sums
Uses Software
This page was built for publication: Computer Aided Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5312909)
