Extrapolating tree transformations

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

Volumn 2404, Issue , 2002, Pages 539-554

  Bouajjani, Ahmed ^a   Touili, Tayssir ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION PROGRAMS; COMPUTER AIDED ANALYSIS; DATA FLOW ANALYSIS; FORESTRY; ITERATIVE METHODS; MODEL CHECKING; TRANSDUCERS;

ACCELERATION TECHNIQUE; CONTROL STRUCTURE; FIXPOINT COMPUTATIONS; MULTI-THREADED PROGRAMS; REGULAR TREE LANGUAGES; TERM REWRITING SYSTEMS; TREE TRANSFORMATION; WIDENING TECHNIQUES;

TREES (MATHEMATICS);

ALGORITHMS; ARTIFICIAL INTELLIGENCE;

EID: 84937573421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_46     Document Type: Conference Paper

References (28)

1. Rajeev Alur, Robert K. Brayton, Thomas A. Henzinger, Shaz Qadeer, and SriramK. Rajamani. Partial-order reduction in symbolic state space exploration. In Computer Aided Verification, pages 340–351, 1997. 549
2. P. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly Analysis of Systems with Unbounded, Lossy Fifo Channels. In CAV’98. LNCS 1427, 1998. 553
3. P. A. Abdulla, A. Bouajjani, B. Jonsson, and M. Nilsson. Handling global conditions in parametrized system verification. Lecture Notes in Computer Science, 1633:134–150, 1999. 540, 542, 553
4. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In CONCUR’97. LNCS 1243, 1997. 553
5. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In CAV’00. LNCS, 2000. 539, 540, 542, 545
6. A. Bouajjani, A. Muscholl, and T. Touili. Permutation Rewriting and Algorithmic Verification. In LICS’01. IEEE, 2001. 539, 553
7. A. Bouajjani. Languages, Rewriting systems, and Verification of Infinte-State Systems. In ICALP’01. LNCS 2076, 2001. invited paper. 539
8. A. Bouajjani and T. Touili. Extrapolating tree transformations. Technical report, LIAFA, May 2002. http://verif.liafa.jussieu.fr/~touili. 542, 549, 550
9. P. Cousot and R. Cousot. Static Determination of Dynamic Properties of Recursive Procedures. In IFIP Conf. on Formal Description of Programming Concepts. North-Holland Pub., 1977. 542
10. H. Comon, V. Cortier, and J. Mitchell. Tree automata with one memory, set constraints and ping-pong protocols. In ICALP’2001. LNCS 2076, 2001. 553
11. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on:http://www.grappa.univ-lille3.fr/tata, 1997. 544
12. E. M. Clarke, O. Grumberg, and S. Jha. Verifying parameterised networks using abstraction and regular languages. Lecture Notes in Computer Science, 962:395–407, 1995. 549
13. Patrick Cousot and Nicholas Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL’78. ACM, 1978. 542
14. Dennis Dams, Yassine Lakhnech, and Martin Steffen”. Iterating transducers. In CAV’01. LNCS, 2001. 540, 542
15. J. Esparza and J. Knoop. An automata-theoretic approach to interpro-cedural data-flow analysis. In FOSSACS’99, volume LNCS 1578, 1999. 541
16. Joost Engelfriet. Bottom-up and top-down tree transformations – a comparison. In Mathematical Systems Theory, volume 9(3), 1975. 544
17. Javier Esparza and Andreas Podelski. Efficient algorithms for pre * and post * on interprocedural parallel flow graphs. In Symposium on Principles of Programming Languages, pages 1–11, 2000. 542, 551
18. L. Fribourg and H. Olsen. Reachability sets of parametrized rings as regular languages. In Infinity’97. volume 9 of Electronical Notes in Theoretical Computer Science. Elsevier Science, 1997. 547
19. J. Goubault-Larrecq. A method for automatic cryptographic protocol verification. In 15th IPDPS 2000 Workshops. LNCS 1800, 2000. 553
20. R. Gilleron and S. Tison. Regular tree languages and rewrite systems. In Fundamenta Informaticae, volume 24, pages 157–175, 1995. 542, 552
21. B. Jonsson and M. Nilsson. Transitive closures of regular relations for verifying infinite-state systems. In TACAS’ 00. LNCS, 2000. 540, 542
22. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In O. Grumberg, editor, Proc. CAV’97, volume 1254 of LNCS, pages 424–435. Springer, 1997. 539, 542, 547
23. D. Lugiez and Ph. Schnoebelen. The regular viewpoint on PA-processes. In Proc. 9th Int. Conf. Concurrency Theory (CONCUR’98), Nice, France, Sep. 1998, volume 1466, pages 50–66. Springer, 1998. 542, 551
24. R. Mayr. Decidability and Complexity of Model Checking Problems for Infinite-State Systems. Phd. thesis, TUM, 1998. 541, 550
25. D. Monniaux. Abstracting cryptographic protocols with tree automata. Science of Computer Programming, 2002. 553
26. A. Pnueli and E. Shahar. Liveness and acceleration in parametrized verification. In CAV’00. LNCS, 2000. 540, 542
27. T. Touili. Widening Techniques for Regular Model Checking. In Ve pa s Workshop. Volume 50 of Electronic Notes in TCS, 2001. 540, 542, 545, 553
28. Pierre Wolper and Bernard Boigelot. Verifying systems with infinite but regular stae spaces. In CAV’98. LNCS 1254, 1998. 539