Structure-aware computation of predicate abstraction

9th International Conference Formal Methods in Computer Aided Design, FMCAD 2009

Volumn , Issue , 2009, Pages 9-16

  Cimatti, Alessandro ^a   Dubrovin, Jori ^b   Junttila, Tommi ^b   Roveri, Marco ^a  

^a ITC IRST   (Italy)

^b AALTO UNIVERSITY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION ALGORITHMS; LEVEL STEPS; PREDICATE ABSTRACTIONS; REWRITING RULES; SPEED-UPS; STRUCTURAL INFORMATION;

COMPUTER AIDED DESIGN; FORMAL METHODS;

ABSTRACTING;

EID: 76549103075     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FMCAD.2009.5351149     Document Type: Conference Paper

References (31)

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. 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.
3. M. K. Ganai and A. Gupta, "Completeness in SMT-based BMC for software programs," in DATE. IEEE, 2008, pp. 831-836.
4. S. Graf and H. Säidi, "Construction of abstract state graphs with PVS," in CAV, ser. LNCS, vol. 1254. Springer, 1997, pp. 72-83.
5. C. Barrett, R. Sebastiani, S. Seshia, and C. Tinelli, "Satisfiability modulo theories," in The Handbook of Satisfiability. IOS Press, 2009.
6. 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.
7. 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 C. S., 2007, pp. 69-76.
8. 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.
9. R. Alur, T. Dang, and F. Ivančić, "Predicate abstraction for reachability analysis of hybrid systems," ACM Transactions on Embedded Computing Systems, vol. 5, no. 1, pp. 152-199, 2006.
10. -, "Counterexample-guided predicate abstraction of hybrid systems," Theoretical Computer Science, vol. 354, pp. 250-271, 2006.
11. R. Alur, C. Courcoubetis, N. Halbwachs, T. A. Henzinger, P.-H. Ho, X. Nicollin, A. Olivero, J. Sifakis, and S. Yovine, "The algorithmic analysis of hybrid systems," Theor. Comp. Sci., vol. 138, pp. 3-34, 1995.
12. R. Alur, T. A. Henzinger, and P.-H. Ho, "Automatic symbolic verification of embedded systems," IEEE Trans. on Sw. Eng., vol. 22, no. 3, pp. 181-201, 1996.
13. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi, "HyTech: a model checker for hybrid systems," STTT, vol. 1, pp. 110-122, 1997.
14. "HyTech: The HYbrid TECHnology tool," May 2009, http://embedded.eecs.berkeley.edu/research/hytech/.
15. J. R. Burch, E. M. Clarke, and D. E. Long, "Symbolic model checking with partitioned transition relations," in VLSI 91, ser. IFIP Transactions. North-Holland, 1991, pp. 49-58.
16. R. K. Ranjan, A. Aziz, B. Plessier, C. Pixley, and R. K. Brayton, "Efficient BDD algorithms for FSM synthesis and verification," in IEEE/ACM Proc. International Workshop on Logic Synthesis, May 1995.
17. D. Geist and I. Beer, "Efficient model checking by automated ordering of transition relation partitions," in CAV, ser. LNCS, no. 818. Springer, 1994, pp. 299-310.
18. K. L. McMillan, "Applying SAT methods in unbounded symbolic model checking," in CAV, ser. LNCS, vol. 2404. Springer, 2002, pp. 250-264.
19. M. K. Ganai, A. Gupta, and P. Ashar, "Efficient SAT-based Unbounded Symbolic Model Checking Using Circuit Cofactoring," in ICCAD. IEEE Computer Society / ACM, 2004, pp. 510-517.
20. O. Grumberg, A. Schuster, and A. Yagdar, "Hybrid BDD and All-SAT Method for Model Checking," in Symposium on Satisfiability Solvers and Program Verification (SSPV), Seattle, USA, Aug. 2006.
21. E. M. Clarke, O. Grumberg, and D. E. Long, "Model checking and abstraction," ACM Trans. Program. Lang. Syst., vol. 16, no. 5, pp. 1512-1542, 1994.
22. 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.
23. S. K. Lahiri, T. Ball, and B. Cook, "Predicate abstraction via symbolic decision procedures," in CAV, ser. LNCS, vol. 3576. Springer, 2005, pp. 24-38.
24. D. Kroening and N. Sharygina, "Image computation and predicate refinement for RTL Verilog using word level proofs," in DATE. ACM, 2007, pp. 1325-1330.
25. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre, "Lazy abstraction," in POPL. ACM, 2002, pp. 58-70.
26. E. M. Clarke, D. Kroening, N. Sharygina, and K. Yorav, "SATABS: SAT-based predicate abstraction for ANSI-C," in TACAS, ser. LNCS, vol. 3440. Springer, 2005, pp. 570-574.
27. M. Segelken, "Abstraction and counterexample-guided construction of ω-automata for model checking of step-discrete linear hybrid models," in CAV 2007, ser. LNCS, vol. 4590. Springer, 2007, pp. 433-448.
28. S. Kemper and A. Platzer, "Sat-based abstraction refinement for realtime systems," ENTCS, vol. 182, pp. 107-122, 2007.
29. A. Tiwari, "Abstractions for hybrid systems," Formal Methods in System Design, vol. 32, no. 1, pp. 57-83, 2008.
30. M. Fränzle, "Verification of hybrid systems," in CAV, ser. LNCS, vol. 4590. Springer, 2007, p. 38.
31. R. Bruttomesso, A. Cimatti, A. Franzén, A. Griggio, and R. Sebastiani, "The MathSAT 4SMT Solver," in CAV, ser. LNCS, A. Gupta and S. Malik, Eds., vol. 5123. Springer, 2008, pp. 299-303.