Forward analysis of dynamic network of pushdown systems is easier without order

International Journal of Foundations of Computer Science

Volumn 22, Issue 4, 2011, Pages 843-862

  Lugiez, Denis ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Concurrent programs; static analysis; weighted tree automata

Indexed keywords

EID: 79958861749     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054111008453     Document Type: Conference Paper

References (17)

1. A. Bouajjani, M. Müller-Olm, and T. Touili. Regular symbolic analysis of dynamic networks of pushdown systems. In Martín Abadi and Luca de Alfaro, editors, CON- CUR, volume 3653 of Lecture Notes in Computer Science, pages 473-487. Springer, 2005. (Pubitemid 41520760)
2. J. Esparza and A. Podelski. Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. In POPL, pages 1-11, 2000.
3. O. Maler A. Bouajjani, J. Esparza. Reachability analysis of pushdown automata: Application to model-checking. In Proceedings 8th International Conference on Concurrency Theory (CONCUR), volume 1243 of Lecture Notes in Computer Science, pages 14-25. Springer-Verlag, 1997.
4. T. W. Reps, S. Schwoon, and S. Jha. Weighted pushdown systems and their application to interprocedural dataflow analysis. In Radhia Cousot, editor, SAS, volume 2694 of Lecture Notes in Computer Science, pages 189-213. Springer, 2003.
5. D. Lugiez and Ph. Schnoebelen. The regular viewpoint on pa-processes. In D.Sangiorgi and R.de Simone, editors, Concur'98, volume 1466 of Lecture Notes in Computer Science, pages 50-66. Springer-Verlag, September 1998. (Pubitemid 128125348)
6. V. Kahlon and A. Gupta. On the analysis of interacting pushdown systems. In Martin Hofmann and Matthias Felleisen, editors, POPL, pages 303-314. ACM, 2007.
7. P. Lammich, M. Mller-Olm, and A. Wenner. Predecessor sets of dynamic pushdown networks with tree-regular constraints. In Proc. of 21st Conf. on Computer Aided Verification (CAV), volume 5643 of Lecture Notes in Computer Science, pages 525- 539. Springer, 2009.
8. S. Dal Zilio and D. Lugiez. XML schema, tree logic and sheaves automata. Applicable Algebra in Engineering, Communication and Computing, 17(5):337-377, 2006. (Pubitemid 44569381)
9. R. Mayr and M. Rusinowitch. Reachability is decidable for ground ac rewrite systems. In Proceedings of the 3rd INFINITY Workshop, pages 53-64, 1998.
10. D. Lugiez. Forward analysis of dynamic network of pushdown systems is easier without order, 2009. Available at http://www.lif.univ-mrs.fr/~lugiez.
11. H. Comon, M. Dauchet, F. Jacquemard, C. Loeding, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata and their application. Freeware Book, 1999. available at http://tata.gforge.inria.fr/.
12. R. Buchi. Regular canonical systems. Archiv fur Matematische Logik und Grundla- genforschung, 6(91-111), 1964.
13. D. Caucal. On word rewriting systems having a rational derivation. In Jerzy Tiuryn, editor, FoSSaCS, volume 1784 of Lecture Notes in Computer Science, pages 48-62. Springer, 2000.
14. M. Presburger. Uber die vollstandigkeit eines gewissen system der arithmetik ganzer zahlen in welchem die addition als einzige operation hervortritt. In Comptes Rendus du I Congres des Mathematiciens des Pays Slaves, Warszawa, 1929.
15. C. Reutenauer. The Mathematics Of Petri Nets. Prentice-Hall, 1990. ISBN 0135618878.
16. S. Ginsburg and E. Spanier. Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics, 16:285-296, 1966.
17. K. N. Verma, H. Seidl, and T. Schwentick. On the complexity of equational horn clauses. In Robert Nieuwenhuis, editor, CADE, volume 3632 of Lecture Notes in Computer Science, pages 337-352. Springer, 2005.