Counting the solutions of Presburger equations without enumerating them

Theoretical Computer Science

Volumn 313, Issue 1, 2004, Pages 17-29

  Boigelot, Bernard ^a   Latour, Louis ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

Automata; Counting; Presburger arithmetic; Symbolic representation systems

Indexed keywords

ALGORITHMS; DIGITAL ARITHMETIC; PROBLEM SOLVING; SET THEORY; VECTORS;

PRESBURGER ARITHMETIC; SYMBOLIC REPRESENTATION SYSTEMS;

FINITE AUTOMATA;

EID: 0742267112     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2003.10.002     Document Type: Conference Paper

References (20)

1. A. Boudet, H. Comon, Diophantine equations, Presburger arithmetic and finite automata, in: Proc. CAAP'96, Lecture Notes in Computer Science, Vol. 1059, Springer, Berlin, 1996, pp. 30-43.
2. Bultan T., Gerber R., Pugh W. Model-checking concurrent systems with unbounded integer variables. symbolic representations, approximations, and experimental results ACM Trans. Programming Languages Systems (TOPLAS). 21(4):1999;747-789.
3. Bruyère V., Hansel G., Michaux C., Villemaire R. Logic and. p -recognizable sets of integers Bull. Belgian Math. Soc. 1(2):1994;191-238.
4. B. Boigelot, Symbolic Methods for Exploring Infinite State Spaces, Collection des publications de la Faculté des Sciences Appliquées de l'Université de Liège, Liège, Belgium, 1999.
5. Cobham A. On the base-dependence of sets of numbers recognizable by finite automata. Math. Systems Theory. 3:1969;186-192.
6. Dang Z., Kemmerer R.A. Using the astral symbolic model checker as a specification debugger: Three approximation techniques. Clarke E.M., Kurshan R.P. Proc. 22nd Internat. Conf. on Software Engineering (ICSE 2000). 2000;IEEE Press, New York.
7. L. Fribourg, H. Olsén, Proving safety properties of infinite state systems by compilation into Presburger arithmetic, in: Proc. CONCUR'97, Vol. 1243, Warsaw, Poland, July 1997, Springer, Berlin, 1997, pp. 213-227.
8. Kabanza F., Stevenne J.-M., Wolper P. Handling infinite temporal data. J. Comput. System Sci. 51(1):1995;3-17.
9. The Liège Automata-based Symbolic Handler (LASH). Available at http://www.montefiore.ulg.ac.be/̃boigelot/research/lash/.
10. Padberg M., Rijal M. Location, Scheduling, Design and Integer Programming. 1996;Kluwer Academic Publishers, Hingham, MA.
11. M. Presburger, Über die Volständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, in: Comptes Rendus du Premier Congrès des Mathématiciens des Pays Slaves, Warsaw, Poland, 1929, pp. 92-101.
12. Pugh W. The Omega Test: A fast and practical integer programming algorithm for dependence analysis. Comm. ACM. 35:1992;102-114.
13. Pugh W. Counting solutions to Presburger formulas. how and why SIGPLAN. 94-6/94:1994;121-134.
14. Schrijver A. Theory of Linear and Integer Programming. 1986;Wiley, Chichester.
15. Semenov A.L. Presburgerness of predicates regular in two number systems. Siberian Math. J. 18:1977;289-299.
16. T.R. Shiple, J.H. Kukula, R.K. Ranjan, A comparison of Presburger engines for EFSM reachability, in: Proc. 10th Internat. Conf. on Computer-Aided Verification, Lecture Notes in Computer Science, Vol. 1427, Vancouver, June/ July 1998, Springer, Berlin, 1998, pp. 280-292.
17. N. Tawbi, P. Feautrier, Processor allocation and loop scheduling on multiprocessor computers, in: Proc. 6th Internat. Conf. on Supercomputing, ACM Press, New York, 1992, pp. 63-71.
18. A. Valmari, State space generation with induction, in: Proc. SCAI'89, Tampere, Finland, June 1989, pp. 99-115.
19. P. Wolper, B. Boigelot, An automata-theoretic approach to Presburger arithmetic constraints, in: Proc. Static Analysis Symp., Lecture Notes in Computer Science, Vol. 983, Glasgow, September 1995, Springer, Berlin, 1995, pp. 21-32.
20. P. Wolper, B. Boigelot, On the construction of automata from linear arithmetic constraints, in: Proc. 6th Internat. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science, Vol. 1785, Berlin, March 2000, Springer, Berlin, 2000, pp. 1-19.