A Decision Procedure for Term Algebras with Queues

ACM Transactions on Computational Logic

Volumn 2, Issue 2, 2001, Pages 155-181

  Rybina, Tatiana ^a   Voronkov, Andrei ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

queues; Term algebras; Theory; trees; Verification; words

Indexed keywords

EID: 85015274734     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/371316.371494     Document Type: Article

References (24)

1. Belegradek, O. 1988a. Model theory of locally free algebras (in Russian). In Model Theory and its Applications. Trudy Instituta Matematiki, vol. 8. Nauka, Novosibirsk, 3-24. English summary in [Belegradek 1988b].
2. Belegradek, O. 1988b. Some model theory of locally free algebras (in Russian). In 6th Easter Conference on Model Theory, B. Dahn and H. Wolter, Eds. Humboldt University, Berlin, 28-32.
3. Berman, L. 1980. The complexity of logical theories. Theoretical Computer Science 11, 71-77.
4. BjøBner, N. 1998. Reactive verification with queues. In Aroionrinsfidarpa Workshop On Engineering Automation For Computer-Based Systems. Carmel, CA, 1-8.
5. BjøBner, N. 2000. Integrating decision procedures for temporal verification. Ph.D. thesis, Stanford University.
6. Comon, H. and Lescanne, P. 1989. Equational problems and disunification. Journal of Symbolic Computations 7, 3, 4, 371-425.
7. Comon, H., Haberstrau, M., and Jouannaud, J.-P. 1994. Syntacticness, cycle-syntacticness and shallow theories. Journal of Symbolic Computations 111, 1, 154-191.
8. Compton, K. and Henson, C. 1990. A Uniform method for proving lower bounds on the computational complexity of logical theories. Annals of Pure and Applied Logic 48, 1-79.
9. Ferrante, J. and Rackoff, C. W. 1979. The computational complexity of logical theories. Lecture Notes in Mathematics, vol. 718. Springer-Verlag.
10. Hmelevskii, J. 1976. Equations in free semigroups. Proceedings of the Steklov Institute of Mathematics, vol. 107. American Mathematical Society. Translated from Russian, the Russian edition appeared in 1971.
11. Hodges, W. 1993. Model theory. Cambridge University Press.
12. Kunen, K. 1987. Negation in logic programming. Journal of Logic Programming 4, 289-308.
13. Lauchly, H. and Savoiz, C. 1987. Monadic Second-Order Definable Relations On The Binary Tree. Journal Of Symbolic Logic 52, 219-226.
14. Maher, M. 1988. Complete axiomatizations of the algebras of finite, rational and infinite trees. In Proc. IEEE ConferEnce on Logic in Computer Science (LICS), 348-357.
15. Malcev, A. 1961. On the elementary theories of locally free universal algebras. Soviet Mathematical Doklady 2, 3, 768-771. Reprinted in [Malcev 1971].
16. Mal Cev, A. 1971. Axiomatizable classes of locally free algebras of various types. In The MetaMathematics of AlgebraIc Systems. Anatolii Ivanovic Malcev. Collected Papers: 1936-1967, B. Wells III, Ed. Vol. 66. North Holland, Chapter 23, 262-281.
17. Peltier, N. 1997. Increasing model building capabilities by constraint solving on terms with integer exponents. Journal of Symbolic Computations 24, 1, 59-101.
18. Rybina, T. and Voronkov, A. 2000. A decision procedure for term algebras with queues. Preprint CSPP-2, Department of Computer Science, University of Manchester. Feb.
19. Seese, D. 1972. Entscheidbarkeits- und Definierbarkeitsfragen der Theorie“netzartiger” Graphen I. Wiss. Zeitschr. der Humboldt-Univ. zu Berlin, Math.-Nat. Reihe 21, 513-517.
20. Thomas, W. 1990. Automata on infinite objects. In Handbook of Theoretical Computer Science, J. Van Leeuwen, Ed. Vol. B: Formal Methods and Semantics. Elsevier Science, Amsterdam, Chapter 4, 133-191.
21. Visser, W., Barringer, H., Fellows, D., Gough, G., and Williams, A. 1998. Efficient CTL model checking for analysis of Rainbow designs. In Advances in Hardware Design and Verification, Procedings of Charme'97, H. Li and K. Probst, Eds. Chapman and Hall, Montreal.
22. Volger, H. 1983a. A new hierarchy of elementary recursive decision problems. Methods of Operations Research 45, 509-519.
23. Volger, H. 1983b. Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories (Note). Theoretical Computer Science 23, 333-337.
24. Vorobyov, S. and Voronkov, A. 1998. Complexity of nonrecursive logic programs with complex values. In PODS'98. ACM Press, Seattle, Washington, 244-253.