Global model checking of ordered multi-pushdown systems

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 8, Issue , 2010, Pages 216-227

  Atig, Mohamed Faouzi ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

Concurrent programs; Global model checking; Pushdown systems

Indexed keywords

CONCURRENT PROGRAM; LINEAR TIME TEMPORAL LOGIC; LINEAR-TIME; LOWER BOUNDS; MODEL CHECKING PROBLEM; PUSHDOWN SYSTEMS; UPPER BOUND; VERIFICATION PROBLEMS;

SOFTWARE ENGINEERING;

MODEL CHECKING;

EID: 80052112315     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2010.216     Document Type: Conference Paper

References (28)

1. M. F. Atig, B. Bollig, and P. Habermehl. Emptiness of multi-pushdown automata is 2ETIME-complete. In Proceedings of DLT'08, volume 5257 of LNCS, pages 121-133. Springer, 2008.
2. M. F. Atig, A. Bouajjani, and T. Touili. On the reachability analysis of acyclic networks of pushdown systems. In CONCUR, volume 5201 of LNCS, pages 356-371. Springer, 2008.
3. M. F. Atig and T. Touili. Verifying parallel programs with dynamic communication structures. In CIAA, volume 5642 of LNCS, pages 145-154. Springer, 2009.
4. Mohamed Faouzi Atig. From multi to single stack automata. In CONCUR, volume 6269 of Lecture Notes in Computer Science, pages 117-131. Springer, 2010.
5. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In CONCUR, volume 1243 of LNCS, pages 135-150. Springer, 1997.
6. A. Bouajjani and O. Maler. Reachability analysis of pushdown automata. In Proc. Intern. Workshop on Verification of Infinite-State Systems (Infinity'96), 1996.
7. A. Bouajjani, M. Müller-Olm, and T. Touili. Regular symbolic analysis of dynamic networks of pushdown systems. In CONCUR'05, LNCS, 2005.
8. A. Bouajjani and T. Touili. Reachability Analysis of Process Rewrite Systems. In FSTTCS'03. LNCS 2914, 2003.
9. L. Breveglieri, A. Cherubini, C. Citrini, and S. Crespi Reghizzi. Multi-push-down languages and grammars. International Journal of Foundations of Computer Science, 7(3):253-292, 1996.
10. J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural data-flow analysis. In FoSSaCS, volume 1578 of LNCS, pages 14-30. Springer, 1999.
11. * on interprocedural parallel flow graphs. In POPL'00. ACM, 2000.
12. Alain Finkel, Bernard Willems, and Pierre Wolper. A direct symbolic approach to model checking pushdown systems (extended abstract). In Faron Moller, editor, Proceedings of the 2nd International Workshop on Verification of Infinite State Systems (INFINITY'97), volume 9 of Electronic Notes in Theoretical Computer Science, pages 27-39, Bologna, Italy, July 1997. Elsevier Science Publishers.
13. Alexander Heußner, Jérôme Leroux, Anca Muscholl, and Grégoire Sutre. Reachability analysis of communicating pushdown systems. In FOSSACS, volume 6014 of Lecture Notes in Computer Science, pages 267-281. Springer, 2010.
14. Ranjit Jhala and Rupak Majumdar. Interprocedural analysis of asynchronous programs. In POPL. IEEE, 2007.
15. V. Kahlon. Boundedness vs. unboundedness of lock chains: Characterizing decidability of pairwise cfl-reachability for threads communicating via locks. In LICS, pages 27-36. IEEE Computer Society, 2009.
16. A. Lal and T.W. Reps. Reducing concurrent analysis under a context bound to sequential analysis. In CAV, volume 5123 of LNCS, pages 37-51. Springer, 2008.
17. D. Lugiez and Ph. Schnoebelen. The regular viewpoint on pa-processes. In CONCUR, volume 1466 of LNCS, pages 50-66. Springer, 1998.
18. Amir Pnueli. The temporal logic of programs. In FOCS, pages 46-57. IEEE, 1977.
19. S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In TACAS, volume 3440 of LNCS, pages 93-107. Springer, 2005.
20. G. Ramalingam. Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst., 22(2):416-430, 2000.
21. T.W. Reps, S. Schwoon, and S. Jha. Weighted pushdown systems and their application to interprocedural dataflow analysis. In SAS, volume 2694 of LNCS, pages 189-213. Springer, 2003.
22. K. Sen and M. Viswanathan. Model checking multithreaded programs with asynchronous atomic methods. In CAV, pages 300-314. LNCS 4144, 2006.
23. Anil Seth. Global reachability in bounded phase multi-stack pushdown systems. In CAV, volume 6174 of Lecture Notes in Computer Science, pages 615-628. Springer, 2010.
24. S. La Torre, P. Madhusudan, and G. Parlato. A robust class of context-sensitive languages. In Proceedings of LICS, pages 161-170. IEEE, 2007.
25. S. La Torre, P. Madhusudan, and G. Parlato. Context-bounded analysis of concurrent queue systems. In Proceedings of TACAS'08, LNCS, pages 299-314. Springer, 2008.
26. Moshe Y. Vardi. A temporal fixpoint calculus. In POPL, pages 250-259, 1988.
27. Moshe Y. Vardi. Alternating automata and program verification. In Computer Science Today, volume 1000 of Lecture Notes in Computer Science, pages 471-485. Springer, 1995.
28. Moshe Y. Vardi and Pierre Wolper. An automata-theoretic approach to automatic program verification (preliminary report). In LICS, pages 332-344. IEEE Computer Society, 1986.