Tighter integration of BDDs and SMT for predicate abstraction

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2010, Pages 1707-1712

  Cimatti, A ^a   Franzen, A ^a   Griggio, A ^b   Kalyanasundaram, K ^a   Roveri, M ^a  

^a ITC IRST   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS;

ABSTRACTION REFINEMENT; BASED REASONINGS; COMPUTATION STEPS; CONSTRAINT SOLVING; COUNTER EXAMPLES; PREDICATE ABSTRACTIONS;

ABSTRACTING;

EID: 77953102192     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/date.2010.5457090     Document Type: Conference Paper

References (17)

1. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith, "Counterexample-guided abstraction refinement for symbolic model checking," J. ACM, vol. 50, no. 5, pp. 752-794, 2003.
2. S. K. Lahiri, R. E. Bryant, and B. Cook, "A Symbolic Approach to Predicate Abstraction," in CAV, ser. LNCS, vol. 2725. Springer, 2003, pp. 141-153.
3. T. Ball, B. Cook, S. K. Lahiri, and L. Zhang, "Zapato: Automatic Theorem Proving for Predicate Abstraction Refinement," in CAV, ser. LNCS, vol. 3114. Springer, 2004.
4. S. K. Lahiri, T. Ball, and B. Cook, "Predicate abstraction via symbolic decision procedures." in CAV, ser. LNCS, vol. 3576, 2005, pp. 24-38.
5. S. K. Lahiri, R. Nieuwenhuis, and A. Oliveras, "SMT Techniques for Fast Predicate Abstraction," in CAV, ser. LNCS, vol. 4144. Springer, 2006, pp. 424-437.
6. H. Jain, D. Kroening, N. Sharygina, and E. Clarke, "Word Level Predicate Abstraction and Refinement for Verifying RTL Verilog," in Design Automation Conference (DAC), June 2005.
7. D. Kroening and N. Sharygina, "Image Computation and Predicate Refinement for RTL Verilog using Word Level Proofs," in DATE 2007, 2007, pp. 1325-1330.
8. R. Cavada, A. Cimatti, A. Franzén, K. Kalyanasundaram, M. Roveri, and R. K. Shyamasundar, "Computing Predicate Abstractions by Integrating BDDs and SMT Solvers," in FMCAD. IEEE CS, 2007, pp. 69-76.
9. A. Cimatti and R. Sebastiani, "Building Efficient Decision Procedures on top of SAT Solvers," in Formal Methods for Hardware Verification, ser. LNCS. Springer, 2006, no. 3965.
10. S. Graf and H. Saidi, "Construction of Abstract State Graphs with PVS," in CAV, ser. LNCS, vol. 1254. Springer, 1997, pp. 72-83.
11. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang, "Symbolic model checking: 1020 states and beyond," Inf. Comput., vol. 98, no. 2, pp. 142-170, 1992.
12. R. E. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," IEEE Trans. on Comp., vol. 35, no. 8, pp. 677-691, 1986.
13. Y. Hong, P. A. Beerel, J. R. Burch, and K. L. McMillan, "Safe BDD Minimization Using Don't Cares," in DAC, 1997, pp. 208-213.
14. D. Déharbe and S. Ranise, "Light-Weight Theorem Proving for Debugging and Verifying Units of Code," in SEFM. IEEE, 2003, pp. 220-228.
15. M. P. Schuijers, "Integrating a BDD Prover and a DPLL SAT Solver for Abstract Data Types," Tech. Univ. Eindhoven, Tech. Rep., Jan. 2006.
16. R. Bruttomesso, A. Cimatti, A. Franzén, A. Griggio, and R. Sebastiani, "The MathSAT 4SMT Solver," in CAV, ser. LNCS, vol. 5123. Springer, 2008, pp. 299-303.
17. A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri, "NuSMV: A New Symbolic Model Checker," STTT, vol. 2, no. 4, pp. 410-425, 2000.