Symbolic reachability analysis of higher-order context-free processes

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

Volumn 3328, Issue , 2004, Pages 135-147

  Bouajjani, Ahmed ^a   Meyer, Antoine ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE LANGUAGES; TEMPORAL LOGIC; MODEL CHECKING; SOFTWARE ENGINEERING;

BACKWARD REACHABILITY; BPA-PROCESSES; CONTEXT-FREE PROCESS; GENERALISATION; HIGH-ORDER; HIGHER-ORDER; LEVEL-1; REACHABILITY ANALYSIS; REGULAR SETS; SYMBOLIC REACHABILITY ANALYSIS; SYMBOLIC MODEL CHECKING;

MODEL CHECKING; CONTEXT FREE LANGUAGES;

EID: 26844563300     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30538-5_12     Document Type: Article

References (23)

1. P. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly analysis of systems with unbounded, lossy fifo channels. In 10th CAV, volume 1427 of LNCS, pages 305-318, 1998.
2. R. Alur, K. Etessami, and P. Madhusudan. A temporal logic of nested calls and returns. In 10th TACAS, volume 2988 of LNCS, pages 467-481, 2004.
3. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of qdds. In 4th SAS, volume 1302 of LNCS, pages 172-186, 1997.
4. A. Bouajjani. Languages, rewriting systems, and verification of infinite-state systems. In 28th ICALP, volume 2076 of LNCS, pages 24-39, 2001.
5. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In 8th CONCUR, volume 1243 of LNCS, pages 135-150, 1997.
6. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In 12th CAV, volume 1855 of LNCS, pages 403-418, 2000.
7. O. Burkart, D. Caucal, and B. Steffen. Bisimulation collapse and the process taxonomy. In 7th CONCUR, volume 1119 of LNCS, pages 247-262, 1996.
8. T. Cachat. Symbolic strategy synthesis for games on pushdown graphs. In 29th ICALP, volume 2380 of LNCS, pages 704-715, 2002.
9. T. Cachat. Higher order pushdown automata, the caucal hierarchy of graphs and parity games. In 30th ICALP, volume 2719 of LNCS, pages 556-569, 2003.
10. A. Carayol and S. Wöhrle. The caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata. In 23rd FSTTCS, volume 2914 of LNCS, pages 112-123, 2003.
11. D. Caucal. On the regular structure of prefix rewriting. TCS, 106:61-86, 1992.
12. D. Caucal. On infinite terms having a decidable monadic theory. In 27th MFCS, volume 2420 of LNCS, pages 165-176, 2002.
13. J. Engelfriet. Iterated pushdown automata and complexity classes. In 15th STOC, pages 365-373, 1983.
14. J. Esparza. Grammars as processes. In Formal and Natural Computing, volume 2300 of LNCS, pages 232-247, 2002.
15. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithm for model checking pushdown systems. In 12th CAV, volume 1885 of LNCS, pages 232-247, 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, 1999.
17. J. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, R. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In 1st TACAS, volume 1019 of LNCS, pages 89-110, 1995.
18. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In 9th CAV, volume 1254 of LNCS, pages 424-435, 1997.
19. T. Knapik, D. Niwinski, and P. Urzyczyn. Higher-order pushdown trees are easy. In 5th FoSSaCS, volume 2303 of LNCS, pages 205-222, 2002.
20. D. Muller and P. Schupp. The theory of ends, pushdown automata, and second-order logic. TCS, 37:51-75, 1985.
21. Stefan Schwoon. Model-Checking Pushdown Systems. PhD thesis, Technische Universität München, 2002.
22. I. Walukiewicz. Pushdown processes: Games and model checking. In 8th CAV, volume 1102 of LNCS, pages 62-74, 1996.
23. P. Wolper and B. Boigelot. Verifying systems with infinite but regular state spaces. In 10th CAV, volume 1427 of LNCS, pages 88-97, 1998.