Model checking dynamic pushdown networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8301 LNCS, Issue , 2013, Pages 33-49

  Song, Fu ^a   Touili, Tayssir ^b  

^a EAST CHINA NORMAL UNIVERSITY   (China)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMIC PROPOSITIONS; CONTROL LOCATIONS; MODEL CHECKING PROBLEM; MODEL-CHECKING ALGORITHMS; MULTI-THREADED PROGRAMS; NATURAL MODELS; PROCEDURE CALL; PUSHDOWN SYSTEMS;

AUTOMATA THEORY;

MODEL CHECKING;

EID: 84893414617     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-03542-0_3     Document Type: Conference Paper

References (25)

1. Atig, M.F., Bouajjani, A., Touili, T.: On the reachability analysis of acyclic networks of push-down systems. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, pp. 356-371. Springer, Heidelberg (2008)
2. Bouajjani, A., Esparza, J., Maler, O.: Reachability Analysis of Pushdown Automata: Application to Model Checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135-150. Springer, Heidelberg (1997) (Pubitemid 127089315)
3. Bouajjani, A., Esparza, J., Touili, T.: A generic approach to the static analysis of concurrent programs with procedures. In: POPL, pp. 62-73 (2003)
4. Bouajjani, A., Müller-Olm, M., Touili, T.: Regular symbolic analysis of dynamic networks of pushdown systems. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol. 3653, pp. 473-487. Springer, Heidelberg (2005) (Pubitemid 41520760)
5. Bozzelli, L., Kretínský, M., Rehák, V., Strejcek, J.: On decidability of LTL model checking for process rewrite systems. Acta Inf. 46(1) (2009)
6. Chaki, S., Clarke, E., Kidd, N., Reps, T., Touili, T.: Verifying concurrent message-passing C programs with recursive calls. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006. LNCS, vol. 3920, pp. 334-349. Springer, Heidelberg (2006) (Pubitemid 44019380)
7. Esparza, J., Hansel, D., Rossmanith, P., Schwoon, S.: Efficient algorithm for model checking pushdown systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 232-247. Springer, Heidelberg (2000)
8. Esparza, J., Kucera, A., Schwoon, S.: Model checking LTL with regular valuations for pushdown systems. Inf. Comput. 186(2), 355-376 (2003)
9. Gawlitza, T.M., Lammich, P., Müller-Olm, M., Seidl, H., Wenner, A.: Join-lock-sensitive forward reachability analysis for concurrent programs with dynamic process creation. In: VMCAI, pp. 199-213 (2011)
10. Göller, S., Lin, A.W.: The complexity of verifying ground tree rewrite systems. In: LICS, pp. 279-288 (2011)
11. Kahlon, V., Gupta, A.: An Automata-Theoretic Approach for Model Checking Threads for LTL Properties. In: LICS, pp. 101-110 (2006)
12. Kahlon, V., Gupta, A.: On the analysis of interacting pushdown systems. In: POPL, pp. 303-314 (2007)
13. Kahlon, V., Ivančić, F., Gupta, A.: Reasoning about threads communicating via locks. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 505-518. Springer, Heidelberg (2005) (Pubitemid 41431760)
14. Kidd, N., Lammich, P., Touili, T., Reps, T.: A decision procedure for detecting atomicity violations for communicating processes with locks. In: Pǎsǎreanu, C.S. (ed.) Model Checking Software. LNCS, vol. 5578, pp. 125-142. Springer, Heidelberg (2009)
15. Lammich, P., Müller-Olm, M.: Precise fixpoint-based analysis of programs with thread-creation and procedures. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol. 4703, pp. 287-302. Springer, Heidelberg (2007)
16. Lammich, P., Müller-Olm, M.: Conflict analysis of programs with procedures, dynamic thread creation, and monitors. In: Alpuente, M., Vidal, G. (eds.) SAS 2008. LNCS, vol. 5079, pp. 205-220. Springer, Heidelberg (2008)
17. Lammich, P., Müller-Olm, M.,Wenner, A.: Predecessor sets of dynamic pushdown networks with tree-regular constraints. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 525-539. Springer, Heidelberg (2009)
18. Lugiez, D.: Forward analysis of dynamic network of pushdown systems is easier without order. Int. J. Found. Comput. Sci. 22(4), 843-862 (2011)
19. Mayr, R.: Process rewrite systems. Inf. Comput. 156(1-2), 264-286 (2000)
20. Song, F., Touili, T.: Efficient CTL model-checking for pushdown systems. In: Katoen, J.-P., König, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 434-449. Springer, Heidelberg (2011)
21. Song, F., Touili, T.: Model Checking Dynamic Pushdown Networks. Research report (2012), http://www.liafa.univ-paris-diderot.fr/~song/dpn-full.pdf
22. Touili, T., Atig, M.F.: Verifying parallel programs with dynamic communication structures. Theor. Comput. Sci. 411(38-39), 3460-3468 (2010)
23. Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. J. Comput. Syst. Sci. 32(2), 183-221 (1986)
24. Wenner, A.: Weighted dynamic pushdown networks. In: Gordon, A.D. (ed.) ESOP 2010. LNCS, vol. 6012, pp. 590-609. Springer, Heidelberg (2010)
25. Yahav, E.: Verifying safety properties of concurrent java programs using 3-valued logic. In: POPL, pp. 27-40 (2001)