Efficiently solving quantified bit-vector formulas

Formal Methods in Computer Aided Design, FMCAD 2010

Volumn , Issue , 2010, Pages 239-246

  Wintersteiger, Christoph M ^a   Hamadi, Youssef ^b,c   De Moura, Leonardo ^d  

^a ETH ZURICH   (Switzerland)

^b MICROSOFT RESEARCH   (United Kingdom)

^c ÉCOLE POLYTECHNIQUE   (France)

^d MICROSOFT RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED THEOREM PROVING; BLOW-UP; DURING CONSTRUCTION; HARDWARE AND SOFTWARE; HARDWARE CIRCUITS; LOOP INVARIANTS; MODEL FINDING; MULTIPLE ORDERS; PROGRAM FRAGMENTS; QUANTIFIED BOOLEAN FORMULAS; RANKING FUNCTIONS; RUNTIMES; SAT SOLVERS; SYMBOLIC REASONING;

BOOLEAN FUNCTIONS; COMPUTER AIDED DESIGN; COMPUTER HARDWARE; HEURISTIC METHODS; THEOREM PROVING; VERIFICATION;

FORMAL METHODS;

EID: 79958746832     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. C. Barrett, A. Stump, and C. Tinelli, "The Satisfiability Modulo Theories Library (SMT-LIB)," www.SMT-LIB.org, 2010.
2. C. Barrett and C. Tinelli, "CVC3," in Proc. of CAV, ser. LNCS, no. 4590. Springer, 2007.
3. M. Benedetti, "Evaluating QBFs via Symbolic Skolemization," in Proc. of LPAR, ser. LNCS, no. 3452. Springer, 2005.
4. A. Biere, "Resolve and expand," in Proc. of SAT'04 (Revised Selected Papers), ser. LNCS, no. 3542. Springer, 2005.
5. R. Brummayer and A. Biere, "Boolector: An efficient SMT solver for bit-vectors and arrays," in Proc. of TACAS, ser. LNCS, no. 5505. Springer, 2009.
6. R. Bruttomesso, A. Cimatti, A. Franzén, A. Griggio, and R. Sebastiani, "The MathSAT 4 SMT solver," in CAV, ser. LNCS, no. 5123. Springer, 2008.
7. M. Colón, "Schema-guided synthesis of imperative programs by constraint solving," in Proc. of Intl. Symp. on Logic Based Program Synthesis and Transformation, ser. LNCS, no. 3573. Springer, 2005.
8. B. Cook, D. Kroening, P. Rümmer, and C. M. Wintersteiger, "Ranking function synthesis for bit-vector relations," in Proc. of TACAS, ser. LNCS, no. 6015. Springer, 2010.
9. L. de Moura and N. Bjørner, "Efficient e-matching for SMT solvers," in Proc. of CADE, ser. LNCS, no. 4603. Springer, 2007.
10. -, "Z3: An efficient SMT solver," in Proc. of TACAS, ser. LNCS, no. 4963. Springer, 2008.
11. U. Egly, M. Seidl, and S. Woltran, "A solver for QBFs in negation normal form," Constraints, vol. 14, no. 1, 2009.
12. V. Ganesh and D. L. Dill, "A decision procedure for bit-vectors and arrays," in Proc. of CAV, ser. LNCS, no. 4590. Springer, 2007.
13. Y. Ge and L. de Moura, "Complete instantiation for quantified formulas in satisfiabiliby modulo theories," in CAV, ser. LNCS, no. 5643. Springer, 2009.
14. E. Giunchiglia, M. Narizzano, and A. Tacchella, "QuBE++: An efficient QBF solver," in Proc. of FMCAD, ser. LNCS, no. 3312. Springer, 2004.
15. A. Goultiaeva, V. Iverson, and F. Bacchus, "Beyond CNF: A circuit-based QBF solver," in Proc. of SAT, ser. LNCS, no. 5584. Springer, 2009.
16. S. Gulwani, S. Srivastava, and R. Venkatesan, "Constraint-based invariant inference over predicate abstraction," in Proc. of VMCAI, ser. LNCS, no. 5403. Springer, 2009.
17. J. Harrison, Handbook of Practical Logic and Automated Reasoning. Cambridge University Press, 2009.
18. H. Jain, D. Kroening, N. Sharygina, and E. M. Clarke, "Word-level predicate-abstraction and refinement techniques for verifying RTL ver-ilog," IEEE Trans. on CAD of Int. Circuits and Systems, vol. 27, no. 2, 2008.
19. S. Jha, S. Gulwani, S. Seshia, and A. Tiwari, "Oracle-guided component-based program synthesis," in Proc. of ICSE. ACM, 2010.
20. B. Jobstmann and R. Bloem, "Optimizations for LTL synthesis," in Proc. of FMCAD. IEEE, 2006.
21. D. E. Knuth and P. B. Bendix, "Simple word problems in universal algebra." in Proc. Conf. on Computational Problems in Abstract Algebra. Pergamon Press, 1970.
22. P. Manolios, S. K. Srinivasan, and D. Vroon, "BAT: The bit-level analysis tool," in Proc. of CAV, ser. LNCS, no. 4590. Springer, 2007.
23. A. Pnueli and R. Rosner, "On the synthesis of a reactive module," in Proc. of POPL. ACM, 1989.
24. A. Podelski and A. Rybalchenko, "A complete method for the synthesis of linear ranking functions," in Proc. of VMCAI, ser. LNCS, no. 2937. Springer, 2004.
25. S. Srivastava and S. Gulwani, "Program verification using templates over predicate abstraction," in Proc. of PLDI. ACM, 2009.
26. S. Srivastava, S. Gulwani, and J. S. Foster, "From program verification to program synthesis," in Proc. of POPL. ACM, 2010.
27. S. Staber and R. Bloem, "Fault localization and correction with QBF," in Proc. of SAT, ser. LNCS, no. 4501. Springer, 2007.
28. A. Turing, "Checking a large routine," in Report of a Conference on High Speed Automatic Calculating Machines, 1949.
29. R. Wille, G. Fey, D. Große, S. Eggersglüß, and R. Drechsler, "SWORD: A SAT like prover using word level information," in Proc. Intl. Conf. on Very Large Scale Integration of System-on-Chip. IEEE, 2007.