{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:31:01Z","timestamp":1726407061437},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540004004"},{"type":"electronic","value":"9783540363903"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36390-4_4","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T19:45:05Z","timestamp":1180208705000},"page":"40-51","source":"Crossref","is-referenced-by-count":0,"title":["Counting the Solutions of Presburger Equations without Enumerating Them"],"prefix":"10.1007","author":[{"given":"Bernard","family":"Boigelot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis","family":"Latour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"4_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/3-540-61064-2_27","volume-title":"Proceedings of CAAP\u201996","author":"A. Boudet","year":"1996","unstructured":"A. Boudet and H. Comon. Diophantine equations, Presburger arithmetic and finite automata. In Proceedings of CAAP\u201996, number 1059 in Lecture Notes in Computer Science, pages 30\u201343. Springer-Verlag, 1996."},{"issue":"2","key":"4_CR2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.36045\/bbms\/1103408547","volume":"1","author":"V. Bruy\u00e9re","year":"1994","unstructured":"V. Bruy\u00e9re, G. Hansel, C. Michaux, and R. Villemaire. Logic and p- recognizable sets of integers. Bulletin of the Belgian Mathematical Society, 1(2):191\u2013238, March 1994.","journal-title":"Bulletin of the Belgian Mathematical Society"},{"key":"4_CR3","volume-title":"Symbolic Methods for Exploring Infinite State Spaces","author":"B. Boigelot","year":"1999","unstructured":"B. Boigelot. Symbolic Methods for Exploring Infinite State Spaces. Collection des publications de la Facult\u00e9 des Sciences Appliqu\u00e9es de l\u2019Universit\u00e9 de Li\u00e9ge, Li\u00e9ge, Belgium, 1999."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BF01746527","volume":"3","author":"A. Cobham","year":"1969","unstructured":"A. Cobham. On the base-dependence of sets of numbers recognizable by finite automata. Mathematical Systems Theory, 3:186\u2013192, 1969.","journal-title":"Mathematical Systems Theory"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"L. Fribourg and H. Ols\u00e9n. Proving safety properties of infinite state systems by compilation into Presburger arithmetic. In Proceedings of CONCUR\u201997, volume 1243, pages 213\u2013227, Warsaw, Poland, July 1997. Springer-Verlag.","DOI":"10.1007\/3-540-63141-0_15"},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1995.1049","volume":"51","author":"F. Kabanza","year":"1995","unstructured":"F. Kabanza, J.-M. Stevenne, and P. Wolper. Handling infinite temporal data. Journal of computer and System Sciences, 51(1):3\u201317, 1995.","journal-title":"Journal of computer and System Sciences"},{"key":"4_CR7","unstructured":"The Li\u00e9ge Automata-based Symbolic Handler (LASH). Available at http:\/\/www.montefiore.ulg.ac.be\/~boigelot\/research\/lash\/ ."},{"key":"4_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1379-3","volume-title":"Location, Scheduling, Design and Integer Programming","author":"M. Padberg","year":"1996","unstructured":"M. Padberg and M. Rijal. Location, Scheduling, Design and Integer Programming. Kluwer Academic Publishers, Massachusetts, 1996."},{"key":"4_CR9","unstructured":"M. Presburger. \u00dcber die Volst\u00e4ndigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In Comptes Rendus du Premier Congr\u00e9s des Math\u00e9maticiens des Pays Slaves, pages 92\u2013101, Warsaw, Poland, 1929."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"W. Pugh. The Omega Test: A fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, pages 102\u2013114, August 1992.","DOI":"10.1145\/135226.135233"},{"key":"4_CR11","first-page":"121","volume":"94-6\/94","author":"W. Pugh","year":"1994","unstructured":"W. Pugh. Counting solutions to Presburger formulas: How and why. SIG-PLAN, 94-6\/94:121\u2013134, 1994.","journal-title":"SIG-PLAN"},{"key":"4_CR12","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver. Theory of Linear and Integer Programming. John Wiley & sons, Chichester, 1986."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/BF00967164","volume":"18","author":"A. L. Semenov","year":"1977","unstructured":"A. L. Semenov. Presburgerness of predicates regular in two number systems. Siberian Mathematical Journal, 18:289\u2013299, 1977.","journal-title":"Siberian Mathematical Journal"},{"key":"4_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/BFb0028752","volume-title":"Proceedings of the 10th Intl. Conf. on Computer-Aided Verification","author":"T.R. Shiple","year":"1998","unstructured":"T. R. Shiple, J. H. Kukula, and R. K. Ranjan. A comparison of Presburger engines for EFSM reachability. In Proceedings of the 10th Intl. Conf. on Computer-Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 280\u2013292, Vancouver, June\/July 1998. Springer-Verlag."},{"key":"4_CR15","unstructured":"A. Valmari. State space generation with induction. In Proceedings of the SCAI\u201989, pages 99\u2013115, Tampere, Finland, June 1989."},{"key":"4_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/3-540-60360-3_30","volume-title":"Proceedings of Static Analysis Symposium","author":"P. Wolper","year":"1995","unstructured":"P. Wolper and B. Boigelot. An automata-theoretic approach to Presburger arithmetic constraints. In Proceedings of Static Analysis Symposium, volume 983 of Lecture Notes in Computer Science, pages 21\u201332, Glasgow, September 1995. Springer-Verlag."},{"key":"4_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-46419-0_1","volume-title":"Proc. 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","author":"P. Wolper","year":"2000","unstructured":"P. Wolper and B. Boigelot. On the construction of automata from linear arithmetic constraints. In Proc. 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 1785 of Lecture Notes in Computer Science, pages 1\u201319, Berlin, March 2000. Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36390-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T07:49:17Z","timestamp":1587541757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36390-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540004004","9783540363903"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-36390-4_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}