Effective Bit-Width and Under-Approximation
Robert Brummayer, Armin Biere · Lecture notes in computer science · 2009
Cited by 17 works. doi:10.1007/978-3-642-04772-5_40
Authors
References
- Lecture Notes in Computer Science 1205
- Counterexample-guided abstraction refinement for symbolic model checking
- Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
- Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
- Decision Procedures: An Algorithmic Point of View
- Theorem Proving Using Lazy Proof Explication
- Lazy Satisfiability Modulo Theories
- Deciding Bit-Vector Arithmetic with Abstraction
- The Calculus of Computation: Decision Procedures with Applications to Verification
- New Techniques that Improve MACE-style Finite Model Finding