Model-checking of ordered multi-pushdown automata

Logical Methods in Computer Science

Volumn 8, Issue 3, 2012, Pages

  Atig, Mohamed Faouzi ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

LTL model checking; Multi pushdown automata; Program verification

Indexed keywords

AUTOMATA THEORY; CALCULATIONS; COMPUTATION THEORY; DISTRIBUTED COMPUTER SYSTEMS; FORMAL LOGIC; TEMPORAL LOGIC;

EMPTINESS PROBLEM; LINEAR TIME TEMPORAL LOGIC; LTL MODEL-CHECKING; MODEL CHECKING PROBLEM; PROGRAM VERIFICATION; PUSH-DOWN AUTOMATA; REGULAR PROPERTIES; VERIFICATION PROBLEMS;

MODEL CHECKING;

EID: 84921518206     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-8(3:20)2012     Document Type: Article

References (43)

1. M. F. Atig, B. Bollig, and P. Habermehl. Emptiness ofmulti-pushdown automata is 2ETIMEcomplete. In Proceedings of DLT’08, volume 5257 of LNCS, pages 121-133. Springer, 2008.
2. M. Faouzi Atig, A. Bouajjani, and S. Qadeer. Context-bounded analysis for concurrent programs with dynamic creation of threads. In TACAS, volume 5505 of LNCS, pages 107-123. Springer, 2009.
3. M. F. Atig, A. Bouajjani, and T. Touili. On thereachability analysis of acyclic networks of pushdown systems. In CONCUR, volume 5201 of LNCS, pages 356-371. Springer, 2008.
4. M. F. Atig and T. Touili. Verifying parallel programs with dynamic communication structures. In CIAA, volume 5642 of LNCS, pages 145-154. Springer, 2009.
5. M. F. Atig. From multito single stack automata. In Proceedings of the 21th International Con-ference on Concurrency Theory (CONCUR’10), LNCS. Springer, 2010.
6. Mohamed Faouzi Atig. Global modelchecking of ordered multi-pushdown systems. In FSTTCS, volume 8 of LIPIcs, pages 216-227. Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, 2010.
7. 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.
8. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysisof pushdown automata: Application to model-checking. In CONCUR, volume 1243 of LNCS, pages 135-150. Springer, 1997.
9. Ahmed Bouajjani, Michael Emmi, and Gennaro Parlato. On sequentializingconcurrent programs. In SAS '11: Proc. 18th Intl. Symp. on Static Analysis, pages 129-145. Springer, 2011.
10. Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, and Jan Strejcek. Reachability analysisof multithreaded software with asynchronous communication. In FSTTCS, volume 3821 of LNCS, pages 348-359. Springer, 2005.
11. Ahmed Bouajjani, Séverine Fratani, and Shaz Qadeer. Context-bounded analysis of multithreaded programs with dynamic linked structures. In CAV, volume 4590 of Lecture Notes in Computer Science, pages 207-220, 2007.
12. A. Bouajjani and O. Maler. Reachability analysis of pushdown automata. In Proc. Intern. Work-shop on Verification of Infinite-State Systems (Infinity’96), 1996.
13. A. Bouajjani, M. Müller-Olm, and T. Touili. Regular symbolicanalysis of dynamic networks of pushdown systems. In CONCUR’05, LNCS, 2005.
14. A. Bouajjani and T. Touili. Reachability Analysis of Process Rewrite Systems. In FSTTCS’03. LNCS 2914, 2003.
15. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithmsfor model checking pushdown systems. In Proc. of CAV’2000, number 1855 in LNCS, pages 232-247. Springer-Verlag, 2000.
16. 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.
17. J. Esparza and A. Podelski. Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. In POPL’00. ACM, 2000.
18. Michael Emmi, Shaz Qadeer, and Zvonimir Rakamarić. Delay-bounded scheduling. In POPL '11: Proc. 38th ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, pages 411-422. ACM, 2011.
19. Alain Finkel, BernardWillems, and PierreWolper. A direct symbolic approach to model checking pushdown systems (extended abstract). In Faron Moller, editor, Proceedings of the 2nd Interna-tional 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.
20. Pierre Ganty, Rupak Majumdar, and Benjamin Monmege. Bounded underapproximations. In CAV, volume 6174 of Lecture Notes in Computer Science, pages 600-614. Springer, 2010.
21. Alexander Heußner, Jérome Leroux, Anca Muscholl, and Grégoire Sutre. Reachability analysisof communicating pushdown systems. In FOSSACS, volume 6014 of Lecture Notes in Computer Science, pages 267-281. Springer, 2010.
22. John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
23. Ranjit Jhala and Rupak Majumdar. Interprocedural analysisof asynchronous programs. In POPL. IEEE, 2007.
24. 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.
25. Salvatore La Torre, Parthasarathy Madhusudan, and Gennaro Parlato. Analyzing recursiveprograms using a fixed-point calculus. In Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI’09), pages 211-222. ACM, 2009.
26. Salvatore La Torre, P. Madhusudan, and Gennaro Parlato. Model-checking parameterized concurrent programs using linear interfaces. In CAV '10: Proc. 22nd Intl. Conf. on Computer Aided Verification, pages 629-644. Springer, 2010.
27. Salvatore La Torre and Margherita Napoli. Reachability ofmultistack pushdown systems with scope-bounded matching relations. In CONCUR, volume 6901 of Lecture Notes in Computer Science, pages 203-218. Springer, 2011.
28. 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.
29. D. Lugiez and Ph. Schnoebelen. The regular viewpoint on pa-processes. In CONCUR, volume 1466 of LNCS, pages 50-66. Springer, 1998.
30. P. Madhusudan and Gennaro Parlato. The tree width of auxiliary storage. In Thomas Ball and Mooly Sagiv, editors, POPL, pages 283-294. ACM, 2011.
31. Amir Pnueli. The temporallogic of programs. In FOCS, pages 46-57. IEEE, 1977.
32. S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In TACAS, volume 3440 of LNCS, pages 93-107. Springer, 2005.
33. G. Ramalingam. Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst., 22(2):416-430, 2000.
34. T.W. Reps, S. Schwoon, and S. Jha. Weighted pushdownsystems and their application to interprocedural dataflow analysis. In SAS, volume 2694 of LNCS, pages 189-213. Springer, 2003.
35. Stefan Schwoon. Model-Checking Pushdown Systems. PhD thesis, Technische Universität München, 2002.
36. A. Seth. Global reachabilityin bounded phase multi-stack pushdown systems. In CAV’10, LNCS, 2010.
37. K. Sen and M. Viswanathan. Model checking multithreaded programs with asynchronous atomic methods. In CAV, pages 300-314. LNCS 4144, 2006.
38. S. La Torre, P. Madhusudan, and G. Parlato. A robust class of context-sensitive languages. In Proceedings of LICS, pages 161-170. IEEE, 2007.
39. 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.
40. Salvatore La Torre, P.Madhusudan, and Gennaro Parlato. Reducing context-bounded concurrent reachability to sequential reachability. In CAV, volume 5643 of LNCS, pages 477-492. Springer, 2009.
41. Moshe Y. Vardi. A temporal fixpoint calculus. In POPL, pages 250-259, 1988.
42. Moshe Y. Vardi. Alternating automataand program verification. In Computer Science Today, volume 1000 of Lecture Notes in Computer Science, pages 471-485. Springer, 1995.
43. 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.