Abstract regular tree model checking

Electronic Notes in Theoretical Computer Science

Volumn 149, Issue 1, 2006, Pages 37-48

  Bouajjani, Ahmed ^a   Habermehl, Peter ^a   Rogalewicz, Adam ^b   Vojnar, Tomáš ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b BRNO UNIVERSITY OF TECHNOLOGY   (Czech Republic)

Author keywords

Abstraction; Automata theory; Formal verification; Infinite state systems; Regular model checking; Tree automata

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL METHODS; MATHEMATICAL MODELS; SET THEORY;

ABSTRACTION; FORMAL VERIFICATION; REGULAR MODEL CHECKING; TREE AUTOMATA;

TREES (MATHEMATICS);

EID: 31144434364     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.11.015     Document Type: Conference Paper

References (19)

1. P.A. Abdulla, B. Jonsson, P. Mahata, and J. d'Orso Regular Tree Model Checking Proc. of CAV'02 LNCS 2404 2002 Springer
2. P.A. Abdulla, A. Legay, J. d'Orso, and A. Rezine Simulation-Based Iteration of Tree Transducers Proc. of TACAS'05 LNCS 3440 2005 Springer
3. R. Alur, R. Brayton, T. Henzinger, S. Qadeer, and S. Rajamani Partial-Order Reduction in Symbolic State Space Exploration Proc. of CAV'97 LNCS 1254 1997 Springer
4. B. Boigelot, and P. Wolper Verifying systems with infinite but regular state spaces Proc. of CAV'98 LNCS 1427 1998 Springer
5. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili Regular Model Checking Proc. of CAV'00 LNCS 1855 2000 Springer
6. A. Bouajjani, and T. Touili Extrapolating Tree Transformations Proc. of CAV'02 LNCS 2404 2002 Springer
7. A. Bouajjani, P. Habermehl, P. Moro, and T. Vojnar TACAS'05 LNCS 3440 2005 Springer
8. A. Bouajjani, P. Habermehl, and T. Vojnar Abstract Regular Model Checking Proc. CAV'04 LNCS 3114 2004 Springer
9. A. Bruggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets: Version 1. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, 2001
10. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi Tree Automata Techniques and Applications http://www.grappa.univ-lille3.fr/tata 2005
11. J. Engelfriet Bottom-up and Top-down Tree Transformations - A Comparison Mathematical System Theory 9 1975 198 231
12. J. Esparza Grammars as Processes Formal and Natural Computing LNCS 2300 2002
13. T. Genet Timbuk, a tree automata library http://www.irisa.fr/lande/genet/timbuk 2005
14. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar Symbolic Model Checking with Rich Assertional Languages Proc. CAV'97 LNCS 1254 1997 Springer
15. N. Klarlund, and M.I. Schwartzbach Graph Types Proc. of POPL'93 1993 ACM
16. N. Klarlund and A. Møller. MONA Version 1.4 User Manual. BRICS, Department of Computer Science, University of Aarhus, Denmark, 2001
17. M. Křetínský, V. Řehák, and J. Strejček Extended Process Rewrite Systems: Expressiveness and Reachability Proc. of Concur'04 LNCS 3170 2004 Springer
18. D. Monniaux Abstracting cryptographic protocols with tree automata Science of Computer Programming 47 2-3 May 2003
19. A. Pnueli and E. Shahar. Acceleration in Verification of Parameterized Tree Networks. Technical report MCS02-12, Weizmann Institute of Science, Israel, 2004