Predicate abstraction and refinement for verifying multi-threaded programs

ACM SIGPLAN Notices

Volumn 46, Issue 1, 2011, Pages 331-344

  Gupta, Ashutosh ^a   Popeea, Corneliu ^a   Rybalchenko, Andrey ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

(Transition) predicate abstraction; Abstraction refinement; Environment transitions; Horn clauses; Modular reasoning; Multi threaded programs; Proof rule; Safety

Indexed keywords

ABSTRACTION REFINEMENT; ENVIRONMENT TRANSITIONS; HORN CLAUSE; MODULAR REASONING; MULTI-THREADED PROGRAMS; PREDICATE ABSTRACTIONS; PROOF RULE; SAFETY;

AUTOMATA THEORY; LOGIC PROGRAMMING; MODEL CHECKING;

ABSTRACTING;

EID: 79251580390     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1925844.1926424     Document Type: Conference Paper

References (34)

1. Y. Bar-David and G. Taubenfeld. Automatic discovery of mutual exclusion algorithms. In DISC, pages 136-150, 2003.
2. G. Basler, M. Mazzucchi, T.Wahl, and D. Kroening. Symbolic counter abstraction for concurrent software. In CAV, pages 64-78, 2009.
3. G. Basler, M. Hague, D. Kroening, C.-H. L. Ong, T. Wahl, and H. Zhao. Boom: Taking boolean program model checking one step further. In TACAS, pages 145-149, 2010.
4. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV, pages 154- 169, 2000.
5. A. Cohen and K. S. Namjoshi. Local proofs for global safety properties. FMSD, 34(2):104-125, 2009.
6. J. Corbet, A. Rubini, and G. Kroah-Hartman. Linux Device Drivers, 3rd Edition. O'Reilly Media, Inc., 2005.
7. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, pages 238-252, 1977.
8. C. Flanagan and P. Godefroid. Dynamic partial-order reduction for model checking software. In POPL, pages 110-121, 2005.
9. C. Flanagan and S. Qadeer. Thread-modular model checking. In SPIN, pages 213-224, 2003.
10. C. Flanagan, S. N. Freund, and S. Qadeer. Thread-modular verification for shared-memory programs. In ESOP, pages 262-277, 2002.
11. P. Godefroid. Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem. PhD thesis, University of Liege, Computer Science Department, 1994.
12. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV, pages 72-83, 1997.
13. A. Gupta, C. Popeea, and A. Rybalchenko. Non-monotonic refinement of control abstraction for concurrent programs. In ATVA, pages 188- 202, 2010.
14. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL, pages 58-70, 2002.
15. T. A. Henzinger, R. Jhala, and R. Majumdar. Race checking by context inference. In PLDI, pages 1-13, 2004.
16. C. B. Jones. Tentative steps toward a development method for interfering programs. ACM Trans. Program. Lang. Syst., 5(4):596-619, 1983.
17. C. B. Jones. Specification and design of (parallel) programs. In IFIP Congress, pages 321-332, 1983.
18. L. Lamport. A new solution of Dijkstra's concurrent programming problem. Commun. ACM, 17(8):453-455, 1974.
19. L. Lamport. A fast mutual exclusion algorithm. ACM Trans. Comput. Syst., 5(1):1-11, 1987.
20. S. Lu, S. Park, E. Seo, and Y. Zhou. Learning from mistakes: A comprehensive study on real world concurrency bug characteristics. In ASPLOS, pages 329-339, 2008.
21. A. Malkis, A. Podelski, and A. Rybalchenko. Thread-modular verification is cartesian abstract interpretation. In ICTAC, pages 183-197, 2006.
22. Z. Manna and A. Pnueli. Temporal verification of reactive systems: Safety. Springer-Verlag, 1995.
23. P. McKenney. Using Promela and Spin to verify parallel algorithms. LWN.net weekly edition, 2007.
24. M. Musuvathi, S. Qadeer, T. Ball, G. Basler, P. A. Nainar, and I. Neamtiu. Finding and reproducing Heisenbugs in concurrent programs. In OSDI, pages 267-280, 2008.
25. G. C. Necula, S. McPeak, S. P. Rahul, andW.Weimer. CIL: Intermediate language and tools for analysis and transformation of C programs. In CC, pages 213-228, 2002.
26. S. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Inf., 6:319-340, 1976.
27. A. Pnueli, J. Xu, and L. D. Zuck. Liveness with (0, 1, infty)-counter abstraction. In CAV, pages 107-122, 2002.
28. A. Podelski and A. Rybalchenko. Transition predicate abstraction and fair termination. In POPL, pages 132-144, 2005.
29. A. Podelski and A. Rybalchenko. ARMC: The logical choice for software model checking with abstraction refinement. In PADL, pages 245-259, 2007.
30. S. Qadeer and D. Wu. KISS: Keep it simple and sequential. In PLDI, pages 14-24, 2004.
31. A. Rybalchenko. The ARMC tool. Available from http://www7.in.tum.de/ rybal/armc/.
32. B. K. Szymanski. A simple solution to Lamport's concurrent programming problem with linear wait. In ICS, pages 621-626, 1988.
33. The Intelligent Systems Laboratory. SICStus Prolog User's Manual. Swedish Institute of Computer Science, 2001. Release 3.8.7.
34. C. Wang, Z. Yang, V. Kahlon, and A. Gupta. Peephole partial order reduction. In TACAS, pages 382-396, 2008.