An effective decision procedure for linear arithmetic over the integers and reals

ACM Transactions on Computational Logic

Volumn 6, Issue 3, 2005, Pages 614-633

  Boigelot, Bernard ^a   Jodogne, Sébastien ^a   Wolper, Pierre ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

Decision procedure; Finite state representations; Integer and real arithmetic; Weak automata

Indexed keywords

COMPUTATIONAL LOGIC; DECISION PROCEDURE; FINITE-STATE REPRESENTATIONS; FORMAL METHODS; INTEGER AND REAL ARITHMETIC; PROGRAM VERIFICATION; RECURSIVE SETS; REGULAR SETS; RESOURCE-BOUNDED; WEAK Ω-AUTOMATA;

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL METHODS; DECISION THEORY; FORMAL LANGUAGES; SET THEORY; SOFTWARE ENGINEERING;

NUMBER THEORY;

EID: 23244468556     PISSN: 15293785     EISSN: None     Source Type: Journal    
DOI: 10.1145/1071596.1071601     Document Type: Article

References (41)

1. ALUR, R., COURCOUBETIS, C., HALBWACHS, N., HENZINGER, T. A., HO, P. H., NICOLLIN, X., OLIVERO, A., SIFAKIS, J., AND YOVINE, S. 1995. The algorithmic analysis of hybrid systems. Theoret. Comput. Sci. 138, 1 (Feb.), 3-34.
2. BOIGELOT, B. 1998. Symbolic methods for exploring infinite state spaces. Ph.D. dissertation. Université de Liège, Liège, Belgium.
3. BOIGELOT, B., BRONNE, L., AND RASSART, S. 1997. An improved reachability analysis method for strongly linear hybrid systems. In Proceedings of the 9th International Conference on Computer-Aided Verification. Lecture Notes in Computer Science, vol. 1254. Springer-Verlag, Berlin, Germany, 167-177.
4. BOIGELOT, B., JODOGNE, S., AND WOLPER, P. 2001. On the use of weak automata for deciding linear arithmetic with integer and real variables. In Proceedings of the International Joint Conference on Automated Reasoning (IJCAR). Lecture Notes in Computer Science, vol. 2083. Springer-Verlag, Berlin, Germany, 611-625.
5. BOIGELOT, B. AND LATOUR, L. 2001. Counting the solutions of Presburger equations without enumerating them. In Proceedings of the International Conference on Implementations and Applications of Automata. Lecture Notes in Computer Science, vol. 2494. Springer-Verlag, Berlin, Germany, 40-51.
6. BOIGELOT, B., RASSART, S., AND WOLPER, P. 1998. On the expressiveness of real and integer arithmetic automata. In Proceedings of the 25th Colloquium on Automata, Programming, and Languages (ICALP). Lecture Notes in Computer Science, vol. 1443. Springer-Verlag, Berlin, Germany, 152-163.
7. BOUDET, A. AND COMON, H. 1996. Diophantine equations, Presburger arithmetic and finite automata. In Proceedings of CAAP'96. Lecture Notes in Computer Science, vol. 1059. Springer-Verlag, Berlin, Germany, 30-43.
8. BRUYÈRE, V., HANSEL, G., MICHAUX, C., AND VILLEMAIRE, R. 1994. Logic and p-recognizable sets of integers. Bull. Belgian Math. Soc. 1, 2 (Mar.), 191-238.
9. BÜCHI, J. R. 1960. Weak second-order arithmetic and finite automata. Z. Math. Logik Grundl. Math. 6, 66-92.
10. BÜCHI, J. R. 1962. On a decision method in restricted second order arithmetic. In Proceedings of the International Congress on Logic, Method, and Philosophy of Science. Stanford University Press, Stanford, CA, 1-12.
11. CHOMICKI, J. AND IMIELIŃSKI, T. 1988. Temporal deductive databases and infinite objects. In Proceedings of the Seventh ACM Symposium on Principles of Database Systems. ACM Press, New York, NY, 61-73.
12. COBHAM, A. 1969. On the base-dependence of sets of numbers recognizable by finite automata. Math. Syst. Theor. 3, 186-192.
13. COURCOUBETIS, C., VARDI, M. Y., WOLPER, P., AND YANNAKAKIS, M. 1990. Memory efficient algorithms for the verification of temporal properties. In Proceedings of the 2nd Workshop on Computer Aided Verification. Lecture Notes in Computer Science, vol. 531. Springer-Verlag, Berlin, Germany, 233-242.
14. FERRANTE, J. AND RACKOFF, C. W. 1979. The Computational Complexity of Logical Theories. Lecture Notes in Mathematics, vol. 718. Springer-Verlag, Berlin and Heidelberg, Germany/New York, NY.
15. HOLZMANN, G. J. 1997. The model checker SPIN. IEEE Trans. Softw. Eng. 23, 5 (May), 279-295. (Special issue on Formal Methods in Software Practice).
16. HOPCROFT, J. E. 1971. An n log n algorithm for minimizing states in a finite automaton. Theor. Mach. Computat. 189-196.
17. JÜRGENSEN, H. AND STAIGER, L. 2001. Finite automata encoding geometric figures. In Proceedings of the 4th International Workshop on Implementing Automata (WIA'99), Revised Papers, O. Boldt and H. Jürgensen, Eds. Lecture Notes in Computer Science, vol. 2214. Springer-Verlag, Potsdam, Germany, 101-108.
18. KABANZA, F., STÉVENNE, J.-M., AND WOLPER, P. 1990. Handling infinite temporal data. In Proceedings of the 9th ACM Symposium on Principles of Database Systems. ACM Press, New York, NY, 392-403.
19. KLARLUND, N. 1991. Progress measures for complementation of ω-automata with applications to temporal logic. In Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 358-367.
20. KUPFERMAN, O. AND VARDI, M. 1997. Weak alternating automata are not that weak. In Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems. IEEE Computer Society Press, Los Alamitos, CA, 147-158.
21. KUPFERMAN, O., VARDI, M. Y., AND WOLPER, P. 2000. An automata-theoretic approach to branching-time model checking. J. ACM 47, 2 (Mar.), 312-360.
22. LANDWEBER, L. H. 1969. Decision problems for ω-automata. Math. Syst. Theor. 3, 4, 376-384.
23. LöDING, C. 2001. Efficient minimization of deterministic weak ω-automata. Informat. Process. Lett. 79, 3, 105-109.
24. MALER, O. AND STAIGER, L. 1997. On syntactic congruences for ω-languages. Theoret. Comput. Sci. 183,1, 93-112.
25. MIYANO, S. AND HAYASHI, T. 1984. Alternating finite automata on ω-words. Theoret. Comput. Sci. 32, 321-330.
26. MULLER, D. E., SAOUDI, A., AND SCHUPP, P. E. 1986. Alternating automata, the weak monadic theory of the tree and its complexity. In Proceedings of the 13th International Colloquium on Automata, Languages and Programming. Springer-Verlag, Berlin, Germany, 275-283.
27. RABIN, M. O. 1969. Decidability of second order theories and automata on infinite trees. Trans. AMS 141, 1-35.
28. SAFEA, S. 1988. On the complexity of omega-automata. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 319-327.
29. SEMENOV, A. L. 1977. Presburgerness of predicates regular in two number systems. Siberian Math. J. 18, 289-299.
30. SHIPLE, T. R., KUKULA, J. H., AND RANJAN, R. K. 1998. A comparison of Presburger engines for EFSM reachability. In Proceedings of the 10th International Conference on Computer-faded Verification. Lecture Notes in Computer Science, vol. 1427. Springer-Verlag, Berlin, Germany, 280-292.
31. SISTLA, A. P., VARDI, M. Y., AND WOLPER, P. 1987. The complementation problem for Büchi automata with applications to temporal logic. Theoret. Comput. Sci. 49, 217-237.
32. STAIGER, L. 1983. Finite-state ω-languages. J. Comput. Syst. Sci. 27, 3, 434-448.
33. STAIGER, L. AND WAGNER, K. 1974. Automaten theoretische und automatenfreie Charakterisierungen topologischer klassen regulärer folgenmengen. Elektron. Informationsverarbeitung und Kybernetik EIK 10, 379-392.
34. THOMAS, W. 1990. Automata on objects. In Handbook of Theoretical Computer Science - Volume B: Formal Models and Semantics, J. Van Leeuwen, Ed. Elsevier, Amsterdam, The Netherlands, Chapter 4,133-191.
35. VARDI, M. Y. AND WOLPER, P. 1986a. An automata-theoretic approach to automatic program verification. In Proceedings of the First Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 322-331.
36. VARDI, M. Y. AND WOLPER, P. 1986b. Automata-theoretic techniques or modal logics of programs. J. Comput. Syst. Sci. 32, 2 (Apr.), 183-221.
37. VARDI, M. Y. AND WOLPER, P. 1994. Reasoning about infinite computations. Inform. Computat. 115, 1 (Nov.), 1-37.
38. WAGNER, K. 1979. On omega-regular sets. Inform. Contr. 43, 2 (Nov.), 123-177.
39. WEISPFENNING, V. 1999. Mixed real-integer linear quantifier elimination. In ISSAC: Proceedings of the ACM SIGSAM International Symposium on Symbolic and Algebraic Computation. ACM Press, New York, NY, 129-136.
40. WOLPER, P. AND BOIGELOT, B. 1995. An automata-theoretic approach to Presburger arithmetic constraints. In Proceedings of the Static Analysis Symposium. Lecture Notes in Computer Science, vol. 983. Springer-Verlag, Berlin, Germany, 21-32.
41. WOLPER, P. AND BOIGELOT, B. 2000. On the construction of automata from linear arithmetic constraints. In Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, vol. 1785. Springer-Verlag, Berlin, Germany, 1-19.