Analyzing asynchronous programs with preemption

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 2, Issue , 2008, Pages 37-48

  Atig, Mohamed Faouzi ^a   Bouajjani, Ahmed ^a   Touili, Tayssir ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Multiset Pushdown Systems; Multithreaded Asynchronous Programs; Program verification; Verification algorithms

Indexed keywords

ADEQUATE MODELS; COVERABILITY PROBLEM; MULTITHREADED; PETRI NETS WITH INHIBITOR ARCS; PROGRAM VERIFICATION; PUSHDOWN SYSTEMS; REACHABILITY PROBLEM; VERIFICATION ALGORITHMS;

SOFTWARE ENGINEERING;

PETRI NETS;

EID: 79251541129     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. M. F. Atig, A. Bouajjani, and T. Touili. On the reachability analysis of acyclic networks of pushdown systems. In CONCUR'08, LNCS, 2008.
2. A. Bouajjani and J. Esparza. Rewriting models of boolean programs. In RTA, Volume 4098 of LNCS, pages 136-150. Springer, 2006.
3. A. Bouajjani, M. Müller-Olm, and T. Touili. Regular symbolic analysis of dynamic networks of pushdown systems. In CONCUR'05, LNCS, 2005.
4. A. Bouajjani and T. Touili. On Computing Reachability Sets of Process Rewrite Systems. In RTA'05. LNCS, 2005.
5. J. Esparza. Decidability and complexity of Petri net problems - an introduction. In G. Rozenberg and W. Reisig, editors, Lectures on Petri Nets I: Basic Models. Advances in Petri Nets, number 1491 in Lecture Notes in Computer Science, pages 374-428, 1998.
6. J. Esparza, S. Kiefer, and M. Luttenberger. On fixed point equations over commutative semirings. In STACS, Volume 4393 of LNCS, pages 296-307. Springer, 2007.
7. * on interprocedural parallel flow graphs. In POPL'00. ACM, 2000.
8. G. Geeraerts, J.-F. Raskin, and L. V. Begin. Expand, enlarge, and check: New algorithms for the coverability problem of wsts. In FSTTCS, Volume 3328 of LNCS, 2004.
9. G. Geeraerts, J.-F. Raskin, and L. V. Begin. Expand, enlarge and check... made efficient. In CAV, Volume 3576 of LNCS, pages 394-407. Springer, 2005.
10. M. Hack. Decision problems for petri nets and vector addition systems. Technical Report TR 161, 1976.
11. J. E. Hopcroft and J. J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci., 8: 135-159, 1979.
12. R. Jhala and R. Majumdar. Interprocedural analysis of asynchronous programs. In POPL, pages 339-350, 2007.
13. V. Kahlon, F. Ivancic, and A. Gupta. Reasoning about threads communicating via locks. In CAV, Volume 3576 of LNCS. Springer, 2005.
14. R. Lipton. The reachability problem requires exponential time. Technical Report TR 66, 1976.
15. D. Lugiez and P. Schnoebelen. The regular viewpoint on pa-processes. Theor. Comput. Sci., 274(1-2): 89-115, 2002.
16. E. W. Mayr. An algorithm for the general petri net reachability problem. In STOC '81, pages 238-246, New York, NY, USA, 1981. ACM Press.
17. R. Mayr. Decidability and Complexity of Model Checking Problems for Infinite-State Systems. Phd. thesis, Technical University Munich, 1998.
18. R. Parikh. On context-free languages. J. ACM, 13(4): 570-581, 1966.
19. S. Qadeer, S. Rajamani, and J. Rehof. Procedure Summaries for Model Checking Multithreaded Software. In POPL'04. ACM, 2004.
20. C. Rackoff. The covering and boundedness problem for vector addition systems. In TCS, 1978.
21. K. Reinhardt. Reachability in petri nets with inhibitor arcs. Revised manuscript, 2006.
22. K. Sen and M. Viswanathan. Model checking multithreaded programs with asynchronous atomic methods. In CAV, pages 300-314, 2006.
23. S. L. Torre, P. Madhusudan, and G. Parlato. A robust class of context-sensitive languages. In LICS, pages 161-170. IEEE, 2007.