{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T14:04:17Z","timestamp":1725545057778},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_18","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T15:07:40Z","timestamp":1141225660000},"page":"213-224","source":"Crossref","is-referenced-by-count":1,"title":["Computing Affine Hulls over ${\\mathbb Q}$ and ${\\mathbb Z}$ from Sets Represented by Number Decision Diagrams"],"prefix":"10.1007","author":[{"given":"Louis","family":"Latour","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"191","DOI":"10.36045\/bbms\/1103408547","volume":"1","author":"V. Bruy\u00e8re","year":"1994","unstructured":"Bruy\u00e8re, V., Hansel, G., Michaux, C., Villemaire, R.: Logic and p-recognizable sets of integers. Bulletin of the Belgian Mathematical Society\u00a01, 191\u2013238 (1994)","journal-title":"Bulletin of the Belgian Mathematical Society"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-60360-3_30","volume-title":"Static Analysis","author":"P. Wolper","year":"1995","unstructured":"Wolper, P., Boigelot, B.: An automata-theoretic approach to Presburger arithmetic constraints. In: Mycroft, A. (ed.) SAS 1995. LNCS, vol.\u00a0983, pp. 21\u201332. Springer, Heidelberg (1995)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-61064-2_27","volume-title":"Trees in Algebra and Programming - CAAP \u201996","author":"A. Boudet","year":"1996","unstructured":"Boudet, A., Comon, H.: Diophantine equations, Presburger arithmetic and finite automata. In: Kirchner, H. (ed.) CAAP 1996. LNCS, vol.\u00a01059, pp. 30\u201343. Springer, Heidelberg (1996)"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1109\/LICS.2004.1319605","volume-title":"Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004)","author":"F. Klaedtke","year":"2004","unstructured":"Klaedtke, F.: On the automata size for Presburger arithmetic. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS 2004), pp. 110\u2013119. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"18_CR5","unstructured":"Leroux, J.: Algorithmique de la v\u00e9rification des syst\u00e8mes \u00e0 compteurs. Approximation et acc\u00e9l\u00e9ration. Impl\u00e9mentation de l\u2019outil FAST. PhD Thesis, Ecole Normale Sup\u00e9rieure de Cachan, Cachan, France (2003)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1109\/LICS.2004.1319606","volume-title":"Proceedings of 19th IEEE Symposium on Logic in Computer Science (LICS 2004)","author":"L. Latour","year":"2004","unstructured":"Latour, L.: From automata to formulas: Convex integer polyhedra. In: Proceedings of 19th IEEE Symposium on Logic in Computer Science (LICS 2004), pp. 120\u2013129. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"18_CR7","unstructured":"Lugiez, D.: From automata to semi-linear sets: a solution for polyhedra and even more general sets. Technical Report 21-2004, Lab. d\u2019informatique de Marseilles (2004)"},{"key":"18_CR8","unstructured":"Leroux, J.: A polynomial time Presburger criterion and synthesis for number decision diagram. Technical report, Universit\u00e9 de Montr\u00e9al (2004)"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.entcs.2003.10.007","volume":"98","author":"J. Leroux","year":"2004","unstructured":"Leroux, J.: The affine hull of a binary automaton is computable in polynomial time. Electr. Notes Theor. Comput. Sci.\u00a098, 89\u2013104 (2004)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b95942","volume-title":"Automata, Languages and Programming","author":"M. M\u00fcller-Olm","year":"2004","unstructured":"M\u00fcller-Olm, M., Seidl, H.: A note on Karr\u2019s algorithm. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, Springer, Heidelberg (2004)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/3-540-53982-4_10","volume-title":"TAPSOFT 1991: Proc.of the International Joint Conference on Theory and Practice of Software Development","author":"P. Granger","year":"1991","unstructured":"Granger, P.: Static analysis of linear congruence equalitites among variables of a program. In: Abramsky, S., Maibaum, T.S.E. (eds.) TAPSOFT 1991, CCPSD 1991, and ADC-Talks 1991. LNCS, vol.\u00a0494, pp. 169\u2013192. Springer, Heidelberg (1991)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Programming Languages and Systems","author":"M. M\u00fcller-Olm","year":"2005","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Analysis of modular arithmetic. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, Springer, Heidelberg (2005)"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Latour, L.: Computing affine hulls over Q and Z from sets represented by number decision diagrams. Technical Report 2005-49, Centre F\u00e9d\u00e9r\u00e9 en V\u00e9rification (2005)","DOI":"10.1007\/11605157_18"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2003.10.002","volume":"313","author":"B. Boigelot","year":"2004","unstructured":"Boigelot, B., Latour, L.: Counting the solutions of presburger equations without enumerating them. Theoretical Computer Science\u00a0313, 17\u201329 (2004)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T16:41:52Z","timestamp":1683391312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11605157_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}