Context-bounded analysis for concurrent programs with dynamic creation of threads

Logical Methods in Computer Science

Volumn 7, Issue 4, 2011, Pages 1-48

  Atig, Mohamed Faouzi ^a   Bouajjani, Ahmed ^b   Qadeer, Shaz ^c  

^a UPPSALA UNIVERSITY   (Sweden)

^b UNIVERSITÉ PARIS DIDEROT   (France)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Program verification; Pushdown systems; Reachability analysis

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

COMPLEXITY RESULTS; CONCURRENT PROGRAM; CONTEXT SWITCH; NUMBER OF SWITCHES; NUMBER OF THREADS; PROGRAM VERIFICATION; PUSHDOWN SYSTEMS; REACHABILITY ANALYSIS;

PROGRAM DEBUGGING;

EID: 84856637515     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-7(4:04)2011     Document Type: Article

References (29)

1. A. Bouajjani, J. Esparza, S. Schwoon, and J. Strejcek. Reachability analysis of multithreaded software with asynchronous communication. In FSTTCS'05, LNCS 3821, pages 348-359. Springer, 2005.
2. Ahmed Bouajjani, Markus Müller-Olm, and Tayssir Touili. Regular symbolic analysis of dynamic networks of pushdown systems. In CONCUR'05, LNCS, 2005.
3. Ahmed Bouajjani and Tayssir Touili. Reachability Analysis of Process Rewrite Systems. In FSTTCS'03. LNCS 2914, 2003.
4. Ahmed Bouajjani and Tayssir Touili. On Computing Reachability Sets of Process Rewrite Systems. In RTA'05. LNCS, 2005.
5. Byron Cook, Daniel Kroening, and Natasha Sharygina. Over-approximating boolean programs with unbounded thread creation. Formal Methods in Computer Aided Design, 0:53-59, 2006.
6. Byron Cook, Daniel Kroening, and Natasha Sharygina. Verification of boolean programs with unbounded thread creation. Theoretical Computer Science, 388(1-3):227-242, 2007.
7. Bruno Courcelle. On construction obstruction sets of words. EATCS'91, 44:178-185, June 1991.
8. J. Esparza and A. Podelski. Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. In POPL'00. ACM, 2000.
9. P. Ganty, J. F. Raskin, and L. Van Begin. A complete abstract interpretation framework for coverability properties of WSTS. In VMCAI'06, LNCS 3855, pages 49-64. Springer, 2006.
10. G. Geeraerts, J. F. Raskin, and L. Van Begin. Expand, enlarge and check: New algorithms for the coverability problem of WSTS. J. Comput. Syst. Sci., 72(1):180-203, 2006.
11. John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
12. R. Lipton. The reachability problem requires exponential time. Technical Report TR 66, 1976.
13. Salvatore La Torre, P. Madhusudan, and Gennaro Parlato. Reducing context-bounded concurrent reachability to sequential reachability. In CAV, volume 5643 of Lecture Notes in Computer Science, pages 477-492. Springer, 2009.
14. Salvatore La Torre, P. Madhusudan, and Gennaro Parlato. Model-checking parameterized concurrent programs using linear interfaces. In CAV, volume 6174 of Lecture Notes in Computer Science, pages 629-644. Springer, 2010.
15. A. Lal and T. W. Reps. Reducing concurrent analysis under a context bound to sequential analysis. In CAV'08, LNCS 5123, pages 37-51. Springer, 2008.
16. D. Lugiez and Ph. Schnoebelen. The regular viewpoint on PA-processes. In Proc. 9th Int. Conf. Concurrency Theory (CONCUR'98), Nice, France, Sep. 1998, volume 1466, pages 50-66. Springer, 1998.
17. A. Lal, T. Touili, N. Kidd, and T. W. Reps. Interprocedural analysis of concurrent programs under a context bound. In TACAS'08, LNCS 4963, pages 282-298. Springer, 2008.
18. M. Muller-olm. Variations on constants. Habilitation thesis, Dortmund University, 2002.
19. M. Musuvathi and S. Qadeer. Iterative context bounding for systematic testing of multithreaded programs. In PLDI'07, pages 446-455. ACM, 2007.
20. S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In TACAS'05, LNCS 3440, pages 93-107. Springer, 2005.
21. S. Qadeer and D. Wu. KISS: keep it simple and sequential. In PLDI'04, pages 14-24. ACM, 2004.
22. Charles Rackoff. The covering and boundedness problems for vector addition systems. Theor. Comput. Sci., 6:223-231, 1978.
23. G. Ramalingam. Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst., 22(2):416-430, 2000.
24. D. Suwimonteerabuth, J. Esparza, and S. Schwoon. Symbolic context-bounded analysis of multithreaded java programs. In SPIN'08, LNCS 5156, pages 270-287. Springer, 2008.
25. Helmut Seidl and Bernhard Steffen. Constraint-based inter-procedural analysis of parallel programs. In 9th European Symposium on Programming (ESOP), 2000.
26. H. Seidl, T. Schwentick, A. Muscholl, and P. Habermehl. Counting in trees for free. In ICALP'04, LNCS 3142, pages 1136-1149. Springer, 2004.
27. Iain A. Stewart. Reachability in some classes of acyclic petrinets. Fundam. Inform., 23(1):91-100, 1995.
28. Kumar Neeraj Verma, Helmut Seidl, and Thomas Schwentick. On the complexity of equational Horn clauses. In CADE'05, LNCS 3632, pages 337-352. Springer, 2005.
29. A. Zaks and R. Joshi. Verifying multi-threaded C programs with SPIN. In SPIN'08, LNCS 5156, pages 325-342. Springer, 2008.