Counting the solutions of Presburger equations without enumerating them
- 1 February 2004
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 313 (1) , 17-29
- https://doi.org/10.1016/j.tcs.2003.10.002
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Model-checking concurrent systems with unbounded integer variablesACM Transactions on Programming Languages and Systems, 1999
- A comparison of Presburger engines for EFSM reachabilityPublished by Springer Nature ,1998
- Proving safety properties of infinite state systems by compilation into Presburger arithmeticPublished by Springer Nature ,1997
- Diophantine equations, Presburger arithmetic and finite automataPublished by Springer Nature ,1996
- Handling Infinite Temporal DataJournal of Computer and System Sciences, 1995
- Counting solutions to Presburger formulasACM SIGPLAN Notices, 1994
- Logic and {$p$}-recognizable sets of integersBulletin of the Belgian Mathematical Society - Simon Stevin, 1994
- A practical algorithm for exact array dependence analysisCommunications of the ACM, 1992
- Presburgerness of predicates regular in two number systemsSiberian Mathematical Journal, 1977
- On the base-dependence of sets of numbers recognizable by finite automataTheory of Computing Systems, 1969