The localization reduction and counterexample-guided abstraction refinement

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6200 LNCS, Issue , 2010, Pages 61-71

  Clarke, Edmund M ^a   Kurshan, Robert P ^b   Veith, Helmut ^c  

^a Carnegie Mellon University   (United States)

^b CADENCE DESIGN SYSTEMS   (United States)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION REFINEMENT; COUNTEREXAMPLE-GUIDED ABSTRACTION REFINEMENT; HARDWARE AND SOFTWARE;

ABSTRACTING; COMPUTER AIDED ANALYSIS; COMPUTER HARDWARE;

VERIFICATION;

EID: 77955039130     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13754-9_4     Document Type: Conference Paper

References (35)

1. Alur, R., Itai, A., Kurshan, R.P., Yannakakis, M.: Timing Verification by Successive Approximation. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol.663, pp. 137-150. Springer, Heidelberg (1993
2. Also Inf. Comput. 118(1), 142-157 (1995)
3. Amla, N., McMillan, K.L.: A Hybrid of Counterexample-Based and Proof- Based Abstraction. In: Hu, A.J., Martin, A.K. (eds.) FMCAD 2004. LNCS, vol.3312, pp. 260-274. Springer, Heidelberg (2004)
4. Amla, N., McMillan, K.L.: Combining Abstraction Refinement and SATBased Model Checking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.4424, pp. 405-419. Springer, Heidelberg (2007)
5. Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without bdds. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.1579, pp. 193-207. Springer, Heidelberg (1999)
6. Ball, T., Rajamani, S.K.: The slam project: debugging system software via static analysis. In: POPL, pp. 1-3 (2002)
7. Chaki, S., Clarke, E.M., Groce, A., Jha, S., Veith, H.: Modular verification of software components in c. In: ICSE, pp. 385-395. IEEE Computer Society, Los Alamitos (2003)
8. Chauhan, P., Clarke, E.M., Kukula, J.H., Sapra, S., Veith, H., Wang, D.: Automated abstraction refinement for model checking large state spaces using sat based conflict analysis. In: Aagaard, M.D., O'Leary, J.W. (eds.) FMCAD 2002. LNCS, vol.2517, pp. 33-51. Springer, Heidelberg (2002)
9. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexampleguided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.1855, pp. 154-169. Springer, Heidelberg (2000)
10. Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexampleguided abstraction refinement for symbolic model checking. J. ACM 50(5), 752-794 (2003)
11. Clarke, E.M., Gupta, A., Kukula, J.H., Strichman, O.: Sat based abstraction-refinement using ilp and machine learning techniques. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.2404, pp. 265-279. Springer, Heidelberg (2002)
12. Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Trans. Program. Lang. Syst. 16(5), 1512-1542 (1994)
13. Chaki, S.: A Counterexample Guided Abstraction Refinement Framework for Verifying Concurrent C Programs. PhD Thesis, Carnegie Mellon University (2005)
14. Clarke, E.M., Jha, S., Lu, Y., Veith, H.: Tree-like counterexamples in model checking. In: LICS, pp. 19-29. IEEE Computer Society Press, Los Alamitos (2002)
15. Clarke, E.M., Kroening, D., Sharygina, N., Yorav, K.: Satabs: Sat-based predicate abstraction for ansi-c. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.3440, pp. 570-574. Springer, Heidelberg (2005)
16. Cook, B., Podelski, A., Rybalchenko, A.: Abstraction refinement for termination. In: Hankin, C., Siveroni, I. (eds.) SAS 2005. LNCS, vol.3672, pp. 87-101. Springer, Heidelberg (2005)
17. Clarke, E.M., Veith, H.: Counterexamples revisited: Principles, algorithms, applications. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol.2772, pp. 208-224. Springer, Heidelberg (2004)
18. Das, S., Dill, D.L.: Successive Approximation of Abstract Transition Relations. In: LICS 2001, pp. 51-58. IEEE Computer Society Press, Los Alamitos (2001)
19. Lucent's Bell Introduces FormalCheck. Electronic News (April 1997)
20. Giacobazzi, R., Quintarelli, E.: Incompleteness, counterexamples, and refinements in abstract model-checking. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.2126, p. 356. Springer, Heidelberg (2001)
21. Graf, S., Saidi, H.: Construction of abstract state graphs with pvs. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol.1254, pp. 72-83. Springer, Heidelberg (1997)
22. Hardin, R.H., Har'El, Z., Kurshan, R.P.: COSPAN. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol.1102, pp. 423-427. Springer, Heidelberg (1996)
23. Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: POPL. ACM, New York (2004)
24. Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: POPL, pp. 58-70 (2002)
25. Jhala, R., McMillan, K.L.: Interpolant-based transition relation approximation. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.3576, pp. 39-51. Springer, Heidelberg (2005)
26. Jhala, R., Majumdar, R.: Software model checking. ACM Comput. Surv. 41(4) (2009)
27. Kurshan, R.P.: Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach. Princeton University Press, Princeton (1994)
28. Kurshan, R.P.: Program Verification. Notices of the AMS 47(5), 534-545 (2000)
29. Lu, Y.: Automated Abstraction in Model Checking. PhD Thesis, Carnegie Mellon University (2000)
30. McMillan, K.L., Amla, N.: Automatic abstraction without counterexamples. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.2619, pp. 2-17. Springer, Heidelberg (2003)
31. McMillan, K.L.: Interpolation and sat-based model checking. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.2725, pp. 1-13. Springer, Heidelberg (2003)
32. Pnueli, A.: Keynote address: Abstraction, composition, symmetry, and a little deduction: The remedies to state explosion. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.1855, p. 1. Springer, Heidelberg (2000)
33. Pnueli, A., Podelski, A., Rybalchenko, A.: Separating fairness and wellfoundedness for the analysis of fair discrete systems. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.3440, pp. 124-139. Springer, Heidelberg (2005)
34. Podelski, A., Rybalchenko, A.: Transition invariants. In: LICS, pp. 32-41. IEEE Computer Society, Los Alamitos (2004)
35. Wagner, H.M.: Principles of Operations Research, pp. 953-958. Prentice Hall, Englewood Cliffs (1975); see Appendix I: Advanced Topics in Network Algorithms