Efficient CTL model-checking for pushdown systems

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

Volumn 6901 LNCS, Issue , 2011, Pages 434-449

  Song, Fu ^a   Touili, Tayssir ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ATOMIC PROPOSITIONS; CONTROL STATE; CTL MODEL-CHECKING; EMPTINESS PROBLEM; MODEL CHECKING ALGORITHM; PROCEDURE CALL; PUSHDOWN SYSTEMS; SEQUENTIAL PROGRAMS; SOURCE CODES;

ALGORITHMS; COMPUTER OPERATING SYSTEMS; CONCURRENCY CONTROL; CONFERENCE CALLS; MATHEMATICAL MODELS; PROBLEM SOLVING;

MODEL CHECKING;

EID: 80052873279     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23217-6_29     Document Type: Conference Paper

References (25)

1. 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. 133-150. Springer, Heidelberg (1997)
2. Bozzelli, L.: Complexity results on branching-time pushdown model checking. Theor. Comput. Sci. 379(1-2), 286-297 (2007)
3. Bozzelli, L.,Murano, A., Peron, A.: Pushdown module checking. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS (LNAI), vol. 3835, pp. 504-518. Springer, Heidelberg (2005)
4. Bozzelli, L.,Murano, A., Peron, A.: Pushdown module checking. Formal Methods in System Design 36(1), 65-95 (2010)
5. Burkart, O., Steffen, B.: Composition, decomposition and model checking of pushdown processes. Nord. J. Comput. 2(2), 89-125 (1995)
6. Burkart, O., Steffen, B.: Model checking the full modal mu-calculus for infinite sequential processes. In: Degano, P., Gorrieri, R.,Marchetti- Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 419-429. Springer, Heidelberg (1997) (Pubitemid 127097758)
7. Cachat, T.: Symbolic strategy synthesis for games on pushdown graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 704-715. Springer, Heidelberg (2002)
8. Cachat, T.: Uniform solution of parity games on prefix-recognizable graphs. Electr. Notes Theor. Comput. Sci. 68(6) (2002)
9. 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)
10. Esparza, J., Knoop, J.: An automata-theoretic approach to interprocedural data-flow analysis. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol. 1578, pp. 14-30. Springer, Heidelberg (1999)
11. Esparza, J., Kučera, A., Schwoon, S.: Model-checking LTL with regular valuations for pushdown systems. In: Kobayashi, N., Babu, C. S. (eds.) TACS 2001. LNCS, vol. 2215, pp. 316-339. Springer, Heidelberg (2001) (Pubitemid 33359699)
12. Esparza, J., Kucera, A., Schwoon, S.: Model checking ltl with regular valuations for pushdown systems. Inf. Comput. 186(2), 355-376 (2003)
13. Esparza, J., Schwoon, S.: A BDD-based model checker for recursive programs. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, p. 324. Springer, Heidelberg (2001)
14. Finkel, A., Willems, B., Wolper, P.: A Direct Symbolic Approach to Model Checking Pushdown Systems. In: Infinity 1997. ENTCS, vol. 9. Elsevier Sci. Pub., Amsterdam (1997)
15. Harel, D., Raz, D.: Deciding emptiness for stack automata on infinite trees. Inf. Comput. 113(2), 278-299 (1994)
16. Kupferman, O., Piterman, N., Vardi, M.Y.: Pushdown specifications. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol. 2514, pp. 262-277. Springer, Heidelberg (2002)
17. Kupferman, O., Piterman, N., Vardi, M.Y.: An automata-theoretic approach to infinitestate systems. In: Manna, Z., Peled, D.A. (eds.) Time for Verification. LNCS, vol. 6200, pp. 202-259. Springer, Heidelberg (2010)
18. Kupferman, O., Vardi, M.Y.: An automata-theoretic approach to reasoning about infinitestate systems. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 36-52. Springer, Heidelberg (2000)
19. Piterman, N., Vardi, M.Y.: Global model-checking of infinite-state systems. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 387-400. Springer, Heidelberg (2004)
20. Qadeer, S., Wu, D.: Kiss: Keep it simple and sequential. In: PLDI 2004: Programming Language Design and Implementation, pp. 14-24 (2004)
21. Schwoon, S.: Model-Checking Pushdown Systems. PhD thesis, Technische Universität München (2002)
22. Serre, O.: Note on winning positions on pushdown games with [omega]-regular conditions. Inf. Process. Lett. 85(6), 285-291 (2003)
23. Suwimonteerabuth, D., Schwoon, S., Esparza, J.: Efficient algorithms for alternating pushdown systems with an application to the computation of certificate chains. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218, pp. 141-153. Springer, Heidelberg (2006) (Pubitemid 44850334)
24. Walukiewicz, I.: Pushdown processes: Games and model checking. In: Alur, R., Henzinger, T.A. (eds.) CAV 1996. LNCS, vol. 1102, pp. 62-74. Springer, Heidelberg (1996)
25. Walukiewicz, I.: Model checking CTL properties of pushdown systems. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 127-138. Springer, Heidelberg (2000)