Decision procedures for term algebras with integer constraints

Information and Computation

Volumn 204, Issue 10, 2006, Pages 1526-1574

  Zhang, Ting ^a   Sipma, Henny B ^a   Manna, Zohar ^a  

^a Stanford University   (United States)

Author keywords

Combination of satisfiability procedures; Decision procedures; Presburger arithmetic; Quantifier elimination; Recursive data structures; Term algebras

Indexed keywords

ALGEBRA; DATA STRUCTURES; DIGITAL ARITHMETIC; EMBEDDED SYSTEMS; FORMAL LOGIC;

COMBINATION OF SATISFIABILITY PROCEDURES; DECISION PROCEDURE; PRESBURGER ARITHMETIC; QUANTIFIER ELIMINATION; RECURSIVE DATA STRUCTURES; TERM ALGEBRAS;

DECISION THEORY;

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

References (41)

1. A. Armando, S. Ranise, M. Rusinowitch, Uniform derivation of decision procedures by superposition, in: Lecture Notes in Computer Science, vol. 2142, 2001, pp. 513-527. (Pubitemid 33332660)
2. R. Backofen, A complete axiomatization of a theory with feature and arity constraints, Journal of Logical Programming 24 (1 and 2) (1995) 37-71.
3. N. S. Bjørner, A. Browne, M. Colón, B. Finkbeiner, Z. Manna, H. B. Sipma, T. E. Uribe, Verifying temporal properties of reactive systems: a STeP tutorial, Formal Methods in System Design 16(3) (2000) 227-270.
4. N. S. Bjørner, Integrating decision procedures for temporal verification, Ph. D. thesis, Computer Science Department, Stanford University, 1998.
5. H. Comon, C. Delor, Equational formulae with membership constraints, Information and Computation 112(2) (1994) 167-216.
6. H. Comon, P. Lescanne, Equational problems and disunification, Journal of Symbolic Computation 7(1989) 371-425.
7. D. C. Cooper, Theorem proving in arithmetic without multiplication, in: Machine Intelligence, vol. 7, American Elsevier, 1972, pp. 91-99.
8. T. Zhang, Arithmetic Integration of Decision Procedures, PhD thesis, Computer Science Department, Stanford University, June 2006.
9. J. Downey, R. Sethi, R. E. Tarjan, Variations of the common subexpression problem, Journal of ACM 27(1980) 758-771.
10. H. B. Enderton, A Mathematical Introduction to Logic, Academic Press, New York, 2001.
11. S. Feferman, R. Vaught, The first order properties of products of algebraic systems, Fundamenta Mathematicae 47(1959) 57-103.
12. S. Ghilardi, Model-theoretic methods in combined constraint satisfiability, Journal of Automated Reasoning 33 (3-4) (2005) 221-249.
13. W. Hodges, Model Theory, Cambridge University Press, Cambridge, UK, 1993.
14. J. Hopcroft, J. Ullman, Introduction to Automata Theory, Langages, and Computation, Addison-Wesley Publishing Company, Reading, MA, 1979.
15. K. Korovin, A. Voronkov, A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering, in: Proceedings of the 15th Annual Symposium on Logic in Computer Science, 2000, pp. 291-302.
16. K. Korovin, A. Voronkov, Knuth-Bendix constraint solving is NP-complete, in: Proceedings of 28th International Colloquium on Automata, Languages and Programming (ICALP'01), Lecture Notes in Computer Science, vol. 2076, Springer-Verlag, Berlin, 2001, pp. 979-992. (Pubitemid 33300862)
17. V. Kuncak, M. Rinard, An algorithm for deciding BAPA: Boolean algebra with Presburger arithmetic, in: R. Nieuwenhuis (Ed.), 20th International Conference on Automated Deduction (CADE'05), Lecture Notes in Computer Science, vol. 3632, Springer-Verlag, Berlin, 2005, pp. 260-277.
18. V. Kuncak, M. Rinard, The structural subtyping of non-recursive types is decidable, in: Proceedings of the 18th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, Sliver Spring, MD, 2003, pp. 96-107.
19. V. Kuncak, M. Rinard, On the theory of structural subtyping, Technical Report MIT-LCS-TR-879, Massachusetts Institute of Technology, 2003.
20. L. Lovász, Combinatorial Problems and Exercises, Elsevier, North-Holland, 1993.
21. M. J. Maher, Complete axiomatizations of the algebras of finite, rational and infinite tree, in: Proceedings of the 3rd Annual Symposium on Logic in Computer Science, IEEE Computer Society Press, Sliver Spring, MD, 1988, pp. 348-357.
22. G. S. Makanin, The problem of solvability of equations in a free semigroup, Math. Sbornik 103(1977) 147-236.
23. A. I. Mal'cev, Axiomatizable classes of locally free algebras of various types, in: The Metamathematics of Algebraic Systems, Collected Papers, North Holland, 1971, Ch. 23, pp. 262-281.
24. G. Nelson, D. C. Oppen, Fast decision procedures based on congruence closure, Journal of ACM 27(2) (1980) 356-364. (Pubitemid 11428851)
25. G. Nelson, D. C. Oppen, Simplification by cooperating decision procedures, ACM Transactions on Programming Languages and Systems 1(2) (1979) 245-257.
26. D. C. Oppen, Reasoning about recursively defined data structures, Journal of ACM 27(3) (1980) 403-411.
27. D. C. Oppen, Elementary bounds for Presburger arithmetic, in: Proceedings of 5th ACM Symposium on Theory of Computing, 1973, pp. 34-37.
28. C. R. Reddy, D. W. Loveland, Presburger arithmetic with bounded quantifier alternation, in: Proceedings of the 10th Annual Symposium on Theory of Computing, ACM Press, New York, 1978, pp. 320-325. (Pubitemid 9412048)
29. P. Revesz, Quantifier-elimination for the first-order theory of Boolean algebras with linear cardinality constraints, in: Proceedings of Advances in Databases and Information Systems (ADBIS'04), Lecture Notes in Computer Science, vol. 3255, Springer-Verlag, Berlin, 2004, pp. 1-21. (Pubitemid 39748840)
30. T. Rybina, A. Voronkov, A decision procedure for term algebras with queues, ACM Transactions on Computational Logic 2(2) (2001) 155-181.
31. T. Skolem, Untersuchungen über die axiome des klassenkalküls und über produktations-und summationsprobleme, welche gewisse klassen von aussagen betreffen, in: J. E. Fenstad (Ed.), Selected Works in Logic, Universitetsforlaget, 1970, pp. 67-101.
32. C. Tinelli, M. T. Harandi, A new correctness proof of the Nelson-Oppen combination procedure, in: F. Baader, K. U. Schulz (Eds.), Frontiers of Combining Systems: Proceedings of the 1st International Workshop (Munich, Germany), Applied Logic, Kluwer Academic Publishers, Dordrecht, 1996, pp. 103-120.
33. C. Tinelli, C. Ringeissen, Unions of non-disjoint theories and combinations of satisfiability procedures, Theoretical Computer Science 290(1) (2003) 291-353. (Pubitemid 35264426)
34. C. Tinelli, C. G. Zarba, Combining decision procedures for sorted theories, in: J. J. Alferes, J. A. Leite (Eds.), Proceedings of the 9th European Conference on Logic in Artificial Intelligence (JELIA'04), Lecture Notes in Computer Science, vol. 3229, Springer, Berlin, 2004, pp. 641-653. (Pubitemid 41049970)
35. K. N. Venkataraman, Decidability of the purely existential fragment of the theory of term algebras, Journal of ACM 34(2) (1987) 492-510. (Pubitemid 17602841)
36. C. G. Zarba, Combining sets with integers, in: A. Armando (Ed.), Frontiers of Combining Systems, Lecture Notes in Artificial Intelligence, vol. 2309, Springer, Berlin, 2002, pp. 103-116.
37. C. G. Zarba, Combining multisets with integers, in: A. Voronkov (Ed.), Proceedings of the 18th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, vol. 2392, Springer, Berlin, 2002, pp. 363-376.
38. T. Zhang, H. B. Sipma, Z. Manna, Decision procedures for recursive data structures with integer constraints, in: 2th International Joint Conference on Automated Reasoning (IJCAR'04), Lecture Notes in Computer Science, vol. 3097, Springer-Verlag, Berlin, 2004, pp. 152-167. (Pubitemid 38939967)
39. T. Zhang, H. B. Sipma, Z. Manna, Term algebras with length function and bounded quantifier alternation, in: The 17th International Conference on Theorem Proving in Higher Order Logics (TPHOLs'04), Lecture Notes in Computer Science, vol. 3223, Springer-Verlag, Berlin, 2004, pp. 321-336.
40. T. Zhang, H. B. Sipma, Z. Manna, The decidability of the first-order theory of term algebras with Knuth-Bendix order, in: R. Nieuwenhuis (Ed.), The 20th International Conference on Automated Deduction (CADE'05), Lecture Notes in Computer Science, vol. 3632, Springer-Verlag, Berlin, 2005, pp. 131-148.
41. T. Zhang, H. B. Sipma, Z. Manna, Decision procedures for queues with integer constraints, in: R. Ramanujam, S. Sen (Eds.), Proceedings of the 25th International Conference on the Foundatations of Software Technology and Theoretical Computer Science (FSTTCS'05), Lecture Notes in Computer Science, vol. 3821, Springer Verlag, Hyderabad, India, 2005, pp. 225-237. (Pubitemid 43846907)