Automated compositional abstraction refinement for concurrent C programs: A two-level approach

Electronic Notes in Theoretical Computer Science

Volumn 89, Issue 3, 2003, Pages 417-432

  Chaki, Sagar ^a   Ouaknine, Joël ^a   Yorav, Karen ^a   Clarke, Edmund ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTER HARDWARE; COMPUTER SCIENCE; COMPUTER SIMULATION; ERROR ANALYSIS; MATHEMATICAL MODELS; PERSONAL COMPUTERS;

AUTOMATED COMPOSITIONAL ABSTRACTION; COUNTEREXAMPLE-GUIDED ABSTRACTION REFINEMENT (CEGAR); MODEL CHECKING; TWO-LEVEL APPROACH;

C (PROGRAMMING LANGUAGE);

EID: 3042642057     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80004-0     Document Type: Article

References (38)

1. BLAST website. http://www-cad.eecs.berkeley.edu/~rupak/blast.
2. MAGIC website. http://www.cs.cmu.edu/~chaki/magic.
3. SLAM website. http://research.microsoft.com/slam.
4. Anantharaman T.S., Clarke E.M., Foster M.J., Mishra B. Compiling path expressions into VLSI circuits. Proceedings of POPL. 1985;191-204
5. Ball T., Majumdar R., Millstein T.D., Rajamani S.K. Automatic predicate abstraction of C programs. SIGPLAN Conference on Programming Language Design and Implementation. 2001;203-213
6. Ball T., Rajamani S.K. Automatically validating temporal safety properties of interfaces. Proceedings of SPIN. volume 2057:2001;103-122 Springer LNCS
7. Bensalem S., Lakhnech Y., Owre S. Computing abstractions of infinite state systems compositionally and automatically. Proceedings of CAV. volume 1427:1998;319-331 Springer LNCS
8. Burch J. Trace algebra for automatic verification of real-time concurrent systems, PhD thesis. 1992;Carnegie Mellon University. Technical report no. CMU-CS-92-179
9. Chaki S., Clarke E.M., Groce A., Jha S., Veith H. Modular verification of software components in C. Proceedings of ICSE. 2003;IEEE Computer Society
10. 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. Proceedings of FMCAD. 2002;33-51
11. Clarke E., Grumberg O., Peled D. Model Checking. December 1999;MIT Press
12. Clarke E.M., Emerson E.A. Synthesis of synchronization skeletons from branching time temporal logic. Proceedings of the Workshop on Logics of Programs. volume 131:1982;52-71 Springer LNCS
13. Clarke E.M., Grumberg O., Jha S., Lu Y., Veith H. Counterexample-guided abstraction refinement. Proceedings of CAV. volume 1855:2000;154-169 Springer LNCS
14. Clarke E.M., Grumberg O., Long D.E. Model checking and abstraction. Proceedings of TOPLAS. September 1994;1512-1542
15. Clarke E.M., Gupta A., Kukula J.H., Shrichman O. SAT based abstraction-refinement using ILP and machine learning techniques. Proceedings of CAV. 2002;265-279
16. Cobleigh J.M., Giannakopoulou D., Pǎsǎreanu C.S. Learning assumptions for compositional verification. Proceedings of TACAS. volume 2619:2003;331-346 Springer LNCS
17. Colón M., Uribe T.E. Generating finite-state abstractions of reactive systems using decision procedures. Proceedings of CAV. 1998;293-304
18. Corbett J.C., Dwyer M.B., Hatcliff J., Laubach S., Pǎsǎreanu C.S., Robby, Zheng H. Bandera: extracting finite-state models from Java source code. Proceedings of ICSE. 2000;439-448 IEEE Computer Society
19. Cousot P., Cousot R. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. Proceedings of the SIGPLAN Conference on Programming Languages. 1977;238-252
20. Dams D., Namjoshi K.S. Shape analysis through predicate abstraction and model checking. Proceedings of VMCAI. volume 2575:2003;Springer LNCS
21. Das S., Dill D.L., Park S. Experience with predicate abstraction. Proceedings of CAV. volume 1633:1999;160-171 Springer LNCS
22. Grumberg O., Long D.E. Model checking and modular verification. ACM Trans., on. Programming Languages and Systems. 16:(3):1994;843-871
23. T. A. Henzinger, R. Jhala, R. Majumdar, and S. Qadeer. Thread-modular abstraction refinement. In Proceedings of CAV (to appear). Springer LNCS, 2003.
24. Henzinger T.A., Jhala R., Majumdar R., Sutre G. Lazy abstraction. Proceedings of POPL. 2002;58-70
25. Henzinger T.A., Qadeer S., Rajamani S.K. Decomposing refinement proofs using assume-guarantee reasoning. Proceedings of ICCAD. 2000;245-252 IEEE Computer Society Press
26. Hoare C.A.R. Communicating Sequential Processes. 1985;Prentice Hall
27. Kurshan R.P. Analysis of discrete event coordination. Proceedings REX Workshop 89. volume 430:1989;414-453 Springer LNCS
28. Kurshan R.P. Computer-aided verification of coordinating processes: the automata-theoretic approach. 1994;Princeton University Press
29. Lakhnech Y., Bensalem S., Berezin S., Owre S. Incremental verification by abstraction. Proceedings of TACAS. volume 2031:2001;98-112 Springer LNCS
30. McMillan K.L. A compositional rule for hardware design refinement. Proceedings of CAV. volume 1254:1997;24-35 Springer LNCS
31. Milner R. Communication and Concurrency. 1989;Prentice-Hall International, London
32. Namjoshi K.S., Kurshan R.P. Syntactic program transformations for automatic abstraction. Proceedings of CAV. volume 1855:2000;435-449 Springer LNCS
33. Naumovich G., Clarke L.A., Osterweil L.J., Dwyer M.B. Verification of concurrent software with FLAVERS. Proceedings of ICSE. 1997;594-595 ACM Press
34. Paige R., Tarjan R.E. Three partition refinement algorithms. SIAM Journal of Computing. 16:(6):1987;973-989
35. Pǎsǎreanu, M. B. Dwyer C.S., Visser W. Finding feasible counterexamples when model checking abstracted Java programs. Proceedings of TACAS. volume 2031:2001;284-298 Springer LNCS
36. Roscoe A.W. The Theory and Practice of Concurrency. 1997;Prentice-Hall International, London
37. Graf S., Saïdi H. Construction of abstract state graphs with PVS. Proceedings of CAV. volume 1254:1997;72-83 Springer LNCS
38. Stoller S.D. Model-checking multi-threaded distributed Java programs. International Journal on Software Tools for Technology Transfer. 4:(1):2002;71-91