Alternating two-way ac-tree automata

Information and Computation

Volumn 205, Issue 6, 2007, Pages 817-869

  Verma, Kumar Neeraj ^a   Goubault Larrecq, Jean ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

Alternating tree automata; Associative commutative; Branching vector addition systems with states; Cryptographic protocols; Resolution; Tree automata; Two way tree automata

Indexed keywords

CRYPTOGRAPHY; FORESTRY; OPTICAL RESOLVING POWER; VECTORS;

ALTERNATING TREE AUTOMATON; ASSOCIATIVE-COMMUTATIVE; BRANCHING VECTOR ADDITION SYSTEMS WITH STATE; CRYPTOGRAPHIC PROTOCOLS; TREE AUTOMATA; TWO-WAY TREE AUTOMATON;

AUTOMATA THEORY;

EID: 84855201936     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.12.006     Document Type: Article

References (73)

1. L. Bachmair, H. Ganzinger, Resolution theorem proving, in: J. A. Robinson, A. Voronkov (Eds.), Handbook of Automated Reasoning, North-Holland, Amsterdam, 2001, pp. 19-99 (Chapter 2).
2. B. Bogaert, S. Tison, Equality and disequality constraints on direct subterms in tree automata, in: Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS'92), LNCS 577, Springer-Verlag, 1992, pp. 161-172.
3. I. Boneva, J.-M. Talbot, Automata and logics for unranked and unordered trees, in: RTA'05, LNCS 3467, Springer-Verlag, 2005, pp. 500-515. (Pubitemid 41313378)
4. A. Bouhoula, J.-P. Jouannaud, Automata-driven automated induction, in: LICS-12, Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97), IEEE Computer Society Press, 1997, pp. 14-25.
5. C.-L. Chang, R. C.-T. Lee, Computer Science Classics, Academic Press, 1973.
6. W. Charatonik, A. Podelski, Set-based analysis of reactive infinite-state systems, in: B. Steffen (Ed.), Proceedings of the 1st International Conferenceon Tools and Algorithms for the Construction and Analysis of Systems (TACAS'98), LNCS 1384, Springer-Verlag, 1998, pp. 358-375. (Pubitemid 128055555)
7. H. Comon, V. Cortier, J. Mitchell, Tree automata with one memory, set constraints and ping-pong protocols, in: Proceedings of the 28th International Colloquium on Automata, Languages, and Programming (ICALP'2001), LNCS 2076, Springer-Verlag, 2001, pp. 682-693. (Pubitemid 33300839)
8. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, M. Tommasi, Tree automata techniques and applications (1997) www.grappa.univ- lille3.fr/tata/.
9. H. Comon, F. Jacquemard, Ground reducibility is EXPTIME-complete, in: Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97), IEEE Computer Society Press, 1997, pp. 26-34.
10. B. Courcelle, On recognizable sets and tree automata, in: M. Nivat, H. Aït-Kaci (Eds.), Resolution of Equations in Algebraic Structures, Academic Press, 1989.
11. M. D. Davis, E. J. Weyuker, Computability, Complexity and Languages, Academic Press, New York, 1985.
12. P. de Groote, B. Guillaume, S. Salvati, Vector addition tree automata, in: Proceedings of the 19th Annual IEEE Symposium on Logics in Computer Science (LICS'04), IEEE Computer Society Press, 2004, pp. 64-73.
13. W. Diffie, M. Hellman, New directions in cryptography, IEEETransactions on Information Theory IT-22(6) (1976) 644-654.
14. W. F. Dowling, J. H. Gallier, Linear-time algorithms for testing the satisfiability of propositional Horn formulae, Journal of Logic Programming 1(3) (1984) 267-284.
15. E. A. Emerson, C. S. Jutla, The complexity of tree automata and logics of programs (extended abstract), in: Proceedings of the 29th Symposium on Foundations of Computer Science (FOCS'88), 1988, pp. 328-337.
16. F. Fages, Associative-commutative unification, in: 7th International Conference on Automated Deduction, LNCS 170, Springer-Verlag, 1984, pp. 194-208.
17. A. Finkel, P. Schnoebelen, Well-structured transition systems everywhere!, Theoretical Computer Science256 (1-2) (2001) 63-92. (Pubitemid 32666102)
18. T. Frühwirth, E. Shapiro, M. Y. Vardi, E. Yardeni, Logic programs as types for logic programs, in: Proceedings of the 6th Annual IEEE Symposium on Logic in ComputerScience (LICS'91), IEEE Computer Society Press, 1991, pp. 300-309. (Pubitemid 21691974)
19. F. Gécseg, M. Steinby, Tree languages, in: in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. 3, Springer Verlag, 1997, pp. 1-68.
20. T. Genet, Decidable approximations of sets of descendants and sets of normal forms, in: T. Nipkow (Ed.), Proceedings of the 9th International Conference on Rewriting Techniques and Applications (RTA'98), LNCS 1379, Springer-Verlag, 1998, pp. 151-165. (Pubitemid 128054452)
21. T. Genet, F. Klay, Rewriting for cryptographic protocol verification, in: 17th International Conference on Automated Deduction (CADE-17), LNCS 1831, Springer Verlag, 2000, pp. 271-290.
22. S. Ginsburg, E. H. Spanier, Semigroups, Presburger formulas and languages, Pacific Journal of Mathematics 16(2) (1966) 285-296.
23. in: R. Goré, A. Leitsch, T. Nipkow (Eds.), 1st International Joint Conference on Automated Reasoning (IJCAR'01), LNAI 2083, Springer Verlag, Siena, Italy, 2001.
24. J. Goubault-Larrecq, A method for automatic cryptographic protocol verification, in: Formal Methods in Parallel Programming Theory and Applications (FMPPTA'2000), 15th IPDPS Workshops, LNCS 1800, Springer-Verlag, 2000, pp. 977-984.
25. J. Goubault-Larrecq, Higher-order positive set constraints, in: J. Bradfield (Ed.), 15th Annual Conference of the European Association for Computer Science Logic (CSL'02), LNCS 2471, Springer Verlag, 2002, pp. 473-489.
26. J. Goubault-Larrecq, Résolution ordonnée avec sélectionet classes décidables dela logiquedupremier ordre, Lecture notes for the course "démonstration automatique et vérification de protocoles cryptographiques" (with Hubert Comon-Lundh), DEA "programmation", 2003, pp. 70, http://www.lsv.ens- cachan.fr/goubault/SOresol.ps (in French).
27. J. Goubault-Larrecq, M. Roger, K. N. Verma, Abstraction and resolution modulo AC: How to verify Diffie-Hellman-like protocols automatically, Journal of Logic and Algebraic Programming 64(2) (2005) 219-251. (Pubitemid 40773872)
28. J. Goubault-Larrecq, K. N. Verma, Alternating two-way AC-tree automata. Research Report LSV-02-11, LSV, ENS de Cachan, 2002, Available at http://www.lsv.ens-cachan.fr/Publis/RAPPORTS-LSV/rr-lsv-2002-11.rr.ps.
29. J. Hopcroft, J. J. Pansiot, On the reachability problem for 5-dimensional vector addition systems, Theoretical Computer Science 8(1979) 135-159.
30. O. H. Ibarra, J. Su, Z. Dang, T. Bultan, R. A. Kemmerer, Counter machines and verification problems, Theoretical Computer Science 289(1) (2002) 165-189.
31. J.-P. Jouannaud, Rewrite proofs and computations, in: H. Schwichtenberg (Ed.), Proof and Computation, NATO series F: Computer and Systems Sciences, vol. 139, Springer Verlag, 1995, pp. 173-218.
32. Y. Kaji, T. Fujiwara, T. Kasami, Solving a unification problem under constrained substitutions using tree automata, Journal of Symbolic Computation 23(1) (1997) 79-117. (Pubitemid 127165288)
33. R. M. Karp, R. E. Miller, Parallel program schemata, Journal of Computer and System Sciences 3(2) (1969) 147-195.
34. S. R. Kosaraju, Decidability of reachability in vector addition systems, in: Proceedings of the 14th Annual ACM Symposium on the Theory of Computing (STOC'82), 1982, pp. 267-281.
35. J.-L. Lambert, A structure to decide reachability in Petri nets, Theoretical Computer Science 99(1) (1992) 79-104.
36. P. Li, Pattern matching in trees, Master's Thesis CS-88-23, University of Waterloo, 1988.
37. LICS-12, Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science (LICS'97), IEEE Computer Society Press, 1997.
38. R. Lipton, The reachability problem requires exponential space, Technical Report 62, Deptartment of Computer Science, Yale University, 1976.
39. D. Lugiez, A good class of tree automata. Application to inductive theoremproving, in: Proceedings of the 25th International Colloquium on Automata, Languages, and Programming (ICALP'98), LNCS 1443, Springer-Verlag, 1998, pp. 409-420. (Pubitemid 128111133)
40. D. Lugiez, Counting and equality constraints for multitree automata, in: Proceedings of the 6th Conference on Foundations of Software Science and Computation Structures (FoSSaCS'03), European Joint Conferences on Theory and Practice of Software (ETAPS'03), LNCS 2620, Springer-Verlag, 2003, pp. 328-342.
41. D. Lugiez, J. L. Moysset, Tree automata help one to solve equational formulae in AC-theories, Journal of Symbolic Computation 18(4) (1994) 297-318.
42. A. Martelli, U. Montanari, An efficient unification algorithm, ACM Transactions on Programming Languages and Systems 4(2) (1982) 258-282.
43. E. W. Mayr, An algorithm for the general Petri net reachability problem, SIAM Journal of Computing 13(1984) 441-460.
44. R. Mayr, M. Rusinowitch, Reachability is decidable for ground AC rewrite systems. in: Proceedings of the 3rd Intl. Workshop on Verification of Infinite State Systems (INFINITY'98), Aalborg, Denmark, 1998, pp. 53-64,. Technical Report TUM-I9825, Technische Universität München. http://www. informatik.uni-freiburg.de/mayrri/ac.ps.
45. M. L. Minsky, Recursive unsolvability of Post's problem of "tag" and other topics in the theory of Turing machines, Annals of Mathematics, Second Series 74(3) (1961) 437-455.
46. D. Monniaux, Abstracting cryptographic protocols with tree automata, in: Proceedings of the 6th International Static Analysis Symposium (SAS'99), LNCS 1694, Springer-Verlag, 1999, pp. 149-163.
47. J. Niehren, A. Podelski, Feature automata and recognizable sets of feature trees, in: Proceedings of the 4th International Conference on Theory and Practice of Software Development (TAPSOFT'93), LNCS 668, Springer-Verlag, 1993, pp. 356-375.
48. H. Ohsaki, Beyond regularity: equational tree automata for associative and commutative theories, in: 14th Annual Conference of the European Association for Computer Science Logic (CSL'01), LNCS 2142, Springer-Verlag, 2001, pp. 539-553. (Pubitemid 33332662)
49. H. Ohsaki, T. Takai, Decidability and closure properties of equational tree languages, in: S. Tison (Ed.), Proceedings of the 13th Conference on Rewriting Techniques and Applications (RTA'02), LNCS 2378, Springer-Verlag, 2002, pp. 114-128.
50. A. Okhotin, Conjunctive grammars, Journal of Automata, Languages and Combinatorics 6(4) (2001) 519-535.
51. R. J. Parikh, On context-free languages, Journal of the Association for Computing Machinery 13(4) (1966) 570-581.
52. N. Peltier, Tree automata and automated model building, Fundamenta Informaticae 30(1) (1997) 59-81. (Pubitemid 127718194)
53. G. Plotkin, Building in equational theories, Machine Intelligence 7(1972) 73-90.
54. C. Reutenauer, Aspects Mathématiques des Réseaux de Petri, Masson, 1993.
55. A. Riazanov, A. Voronkov, Vampire 1.1 (system description), in: R. Goré, A. Leitsch, T. Nipkow (Eds.), 1st Intl. Joint Conference on Automated Reasoning (IJCAR'01), LNAI 2083, Springer Verlag, Siena, Italy, 2001, pp. 376-380. (Pubitemid 33291438)
56. J. A. Robinson, A. Voronkov (Eds.), Handbook of Automated Reasoning, North-Holland, 2001.
57. M. Roger, Raffinementsde larésolutionet vérification deprotocoles cryptographiques, Ph. D. thesis, ENSde Cachan, 2003 (in French).
58. G. S. Sacerdote, R. L. Tenney, The decidability of the reachability problem for vector addition systems, in: Proceedings of the 9th Annual ACM Symposium on the Theory of Computing (STOC'77), 1977, pp. 61-76.
59. K. M. Schimpf, J. H. Gallier, Tree pushdown automata, Journal of Computer and System Sciences 30(1) (1985) 25-40.
60. H. Seidl, Haskell overloading is DEXPTIME-complete, Information Processing Letters 52(2) (1994) 57-60. (Pubitemid 124013221)
61. H. Seidl, T. Schwentick, A. Muscholl, Numerical document queries, in: 22nd ACM Symposium on Principles of Database Systems (PODS'03), San Diego, CA, USA, 2003, pp. 155-166.
62. J. C. Shepherdson, The reduction of two-way automata to one-way automata, IBM Journal of Research and Development 3(1959) 199-201.
63. G. Slutzki, Alternating tree automata, Theoretical Computer Science 41(1985) 305-318.
64. M. Stickel, A unification algorithm for associative-commutative functions, Journal of the Association for Computing Machinery 28(3) (1981) 423-434.
65. W. Thomas, Automata on infinite objects, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, Elsevier Science, 1990, pp. 133-191 (Chapter 4).
66. K. N. Verma, Automates d'arbres bidirectionnels modulo théorieséquationnelles, Ph. D. thesis, ENSdeCachan, 2003a, with French abstracts (in English).
67. K. N. Verma, On closure under complementation of equational tree automata for theories extending AC, in: Proceedings of the 10th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'2003), LNAI 2850, Springer, Verlag, 2003, pp. 183-195.
68. K. N. Verma, Two-way equational tree automata for AC-like theories: Decidability and closure properties, in: Proceedings of the 14th Conference on Rewriting Techniques and Applications (RTA'2003), LNCS 2706, Springer-Verlag, 2003, pp. 180-196. (Pubitemid 36768721)
69. K. N. Verma, Alternation in equational tree automata modulo XOR, in: 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'04), LNCS, vol. 3328, Springer-Verlag, Chennai, India, 2004.
70. K. N. Verma, J. Goubault-Larrecq, Karp-Miller trees for a branching extension of VASS, Discrete Mathematics and Theoretical Computer Science 7(1) (2005) 217-230.
71. K. N. Verma, H. Seidl, T. Schwentick, On the complexity of equational Horn clauses, in: R. Nieuwenhuis (Ed.), 20th International Conference on Automated Deduction (CADE'05), LNCS, vol. 3632, Springer-Verlag, Tallinn, Estonia, 2005, pp. 337-352.
72. A. Voronkov, Algorithms, datastructures, and other issues in efficient automated deduction, in: R. Goré, A. Leitsch, T. Nipkow (Eds.), 1st International Joint Conference on Automated Reasoning (IJCAR'01), LNAI 2083, Springer-Verlag, Siena, Italy, 2001, pp. 13-28. (Pubitemid 33291412)
73. C. Weidenbach, Combining superposition, sorts and splitting, in: J. A. Robinson, A. Voronkov (Eds.), Handbook of Automated Reasoning, North-Holland, 2001, pp. 1965-2013 (Chapter 27).