Deciding Bit-Vector Arithmetic with Abstraction
- 4 July 2007
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- EXEPublished by Association for Computing Machinery (ACM) ,2006
- Scalable error detection using boolean satisfiabilityPublished by Association for Computing Machinery (ACM) ,2005
- Cogent: Accurate Theorem Proving for Program VerificationPublished by Springer Nature ,2005
- An efficient finite-domain constraint solver for circuitsPublished by Association for Computing Machinery (ACM) ,2004
- Iterative abstraction using SAT-based BMC with proof analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Abstraction-Based Satisfiability Solving of Presburger ArithmeticPublished by Springer Nature ,2004
- RTL-datapath verification using integer linear programmingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Automatic Abstraction without CounterexamplesPublished by Springer Nature ,2003
- Assertion checking by combined word-level ATPG and modular arithmetic constraint-solving techniquesPublished by Association for Computing Machinery (ACM) ,2000
- An efficient decision procedure for the theory of fixed-sized bit-vectorsPublished by Springer Nature ,1997