A scalable decision procedure for fixed-width bit-vectors

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn , Issue , 2009, Pages 13-20

  Bruttomesso, Roberto ^a   Sharygina, Natasha ^a  

^a UNIVERSITY OF LUGANO   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; EQUIVALENCE CLASSES; INFORMATION MANAGEMENT; VECTORS;

BIT VECTOR; CONGRUENCE CLOSURE; DECISION PROCEDURE; FIXED WIDTH; THEORY SOLVERS; VERIFICATION FRAMEWORK;

DECISION THEORY;

EID: 76349086185     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1687399.1687403     Document Type: Conference Paper

References (23)

1. C. Barrett and C. Tinelli. CVC3. In CAV'07, 2007.
2. C. W. Barrett, D. L. Dill, and J. R. Levitt. A Decision Procedure for Bit-Vector Arithmetic. In DAC, pages 522-527, 1998.
3. A. Biere and R. Brummayer. The Boolector SMT Solver. In TACAS, 2009.
4. N. Bjørner and M. C. Pichora. Deciding Fixed and Non-fixed Size Bit-vectors. In TACAS, pages 376-392, 1998.
5. R. Bruttomesso, A. Cimatti, A. Franzen, A. Griggio, Z. Hanna, A. Nadel, A. Palti, and R. Sebastiani. A Lazy and Layered SMT(BV) Solver for Hard Industrial Verification Problems. In CAV, pages 247-260, 2007.
6. Roberto Bruttomesso. RTL Verification: from SAT to SMT(BV). PhD thesis, University of Trento, 2008. Available at http://www.inf.unisi.ch/ postdoc/bruttomesso/files/phdthesis.pdf.
7. R. E. Bryant, S. K. Lahiri, and S. A. Seshia. Modeling and Verifying Systems using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted Functions. In CAV, 2002.
8. D. Cyrluk, M. O. Möller, and H. Rueß. An Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors. In CAV, pages 60-71, 1997.
9. L. de Moura and N. Bjørner. Z3: An Efficient SMT Solver. In TACAS'08, pages 337-340, 2008.
10. D. Detlefs, G. Nelson, and J. B. Saxe. Simplify: a theorem prover for program checking. Journal of ACM, 52(3):365-473, 2005.
11. B. Dutertre and L. de Moura. The Yices SMT Solver. Tool paper available at http://yices.csl.sri.com/tool-paper.pdf.
12. V. Ganesh, S. Berezin, and D. L. Dill. A Decision Procedure for Fixed-Width Bit-Vectors. Technical report, University of Stanford, 2005. Available at http://theory.stanford.edu/~vganesh/ bitvector-tech-report.ps.
13. V. Ganesh and D. L. Dill. A Decision Procedure for Bit-Vectors and Arrays. In CAV, pages 519-531, 2007.
14. S. Jha, R. Limaye, and S. A. Seshia. Beaver: Engineering an Efficient SMT Solver for Bit-Vector Arithmetic. In CAV, 2009.
15. D. E. Knuth and A. Schönhage. The expected linearity of a simple equivalence algorithm. Theoretical Computer Science, 3(6):281-315, June 1978.
16. P. Manolios, S. K. Srinivasan, and D. Vroon. BAT: The Bit-Level Analysis Tool. In CAV, pages 303-306, 2007.
17. R. Nieuwenhuis and A. Oliveras. Proof-Producing Congruence Closure. In RTA'05, pages 453-468, 2005.
18. Peter M. Nyasulu. Introduction to Verilog. Available at http://www.doe.carleton.ca/~shams/ 97350/PetervrlK.pdf.
19. OpenSMT. http://verify.inf.unisi.ch/opensmt.
20. R. Sebastiani. Lazy Satisfiability Modulo Theories. JSAT, 3:144-224, 2007.
21. Spear. http://www.cs.ubc.ca/~babic/.
22. R. E. Tarjan. Efficiency of a good but not linear set union algorithm. J. ACM, 22(2):215-225, 1975.
23. R. Wille, G. Fey, D. Große, S. Eggersglüß, and R. Drechsler. SWORD: A SAT like prover using word level information. In VLSI-SoC, pages 88-93, 2007.