{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:21:18Z","timestamp":1743060078267,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540875307"},{"type":"electronic","value":"9783540875314"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87531-4_31","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T08:40:53Z","timestamp":1220085653000},"page":"431-445","source":"Crossref","is-referenced-by-count":1,"title":["Upper Bounds on the Automata Size for Integer and Mixed Real and Integer Linear Arithmetic (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Jochen","family":"Eisinger","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1007\/978-3-540-45069-6_12","volume-title":"Computer Aided Verification","author":"S. Bardin","year":"2003","unstructured":"Bardin, S., Finkel, A., Leroux, J., Petrucci, L.: FAST: Fast acceleration of symbolic transition systems. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol.\u00a02725, pp. 118\u2013121. Springer, Heidelberg (2003)"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-73368-3_36","volume-title":"Computer Aided Verification","author":"B. Becker","year":"2007","unstructured":"Becker, B., Dax, C., Eisinger, J., Klaedtke, F.: LIRA: Handling constraints of linear arithmetics over the integers and the reals. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol.\u00a04590, pp. 307\u2013310. Springer, Heidelberg (2007)"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1145\/1071596.1071601","volume":"6","author":"B. Boigelot","year":"2005","unstructured":"Boigelot, B., Jodogne, S., Wolper, P.: An effective decision procedure for linear arithmetic over the integers and reals. ACM Trans.Comput. Log.\u00a06, 614\u2013633 (2005)","journal-title":"ACM Trans.Comput. Log."},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45619-8_1","volume-title":"Logic Programming","author":"B. Boigelot","year":"2002","unstructured":"Boigelot, B., Wolper, P.: Representing arithmetic constraints with finite automata: An overview. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 1\u201319. Springer, Heidelberg (2002)"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.: Weak second-order arithmetic and finite automata. Zeitschrift der mathematischen Logik und Grundlagen der Mathematik\u00a06, 66\u201392 (1960)","journal-title":"Zeitschrift der mathematischen Logik und Grundlagen der Mathematik"},{"key":"31_CR6","unstructured":"B\u00fcchi, J.: On a decision method in restricted second order arithmetic. In: Logic, Methodology and Philosophy of Science (Proc. 1960 Internat. Congr.), pp. 1\u201311. Stanford University Press (1962)"},{"key":"31_CR7","unstructured":"Cooper, D.C.: Theorem proving in arithmetic without multiplication. In: Meltzer, B., Michie, D. (eds.) Proceedings of the 7th Annual Machine Intelligence Workshop, pp. 91\u2013100. Edinburgh University Press (1972)"},{"key":"31_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/978-3-540-30500-2_30","volume-title":"Implementation and Application of Automata","author":"J.-M. Couvreur","year":"2005","unstructured":"Couvreur, J.-M.: A BDD-like implementation of an automata package. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol.\u00a03317, pp. 310\u2013311. Springer, Heidelberg (2005)"},{"key":"31_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2355-7","volume-title":"Mathematical Logic","author":"H.-D. Ebbinghaus","year":"1994","unstructured":"Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic, 2nd edn. Springer, Heidelberg (1994)","edition":"2"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Eisinger, J.: Upper bounds on the automata size for integer and mixed real and integer linear arithmetic, Tech. Report 239, Institut f\u00fcr Informatik, Universit\u00e4t Freiburg (2008)","DOI":"10.1007\/978-3-540-87531-4_31"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/11817963_10","volume-title":"Computer Aided Verification","author":"J. Eisinger","year":"2006","unstructured":"Eisinger, J., Klaedtke, F.: Don\u2019t care words with an application to the automata-based approach for real addition. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.\u00a04144, pp. 67\u201380. Springer, Heidelberg (2006)"},{"key":"31_CR12","series-title":"LNM","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0062837","volume-title":"The Computational Complexity of Logical Theories","author":"J. Ferrante","year":"1979","unstructured":"Ferrante, J., Rackoff, C.: The Computational Complexity of Logical Theories. LNM, vol.\u00a0718. Springer, Heidelberg (1979)"},{"key":"31_CR13","unstructured":"Fischer, M.J., Rabin, M.O.: Super-exponential complexity of presburger arithmetic, tech. report, Massachusetts Institute of Technology, Cambridge, MA, USA (1974)"},{"key":"31_CR14","volume-title":"A shorter model theory","author":"W. Hodges","year":"1997","unstructured":"Hodges, W.: A shorter model theory. Cambridge University Press, New York (1997)"},{"key":"31_CR15","first-page":"110","volume-title":"LICS 2004","author":"F. Klaedtke","year":"2004","unstructured":"Klaedtke, F.: On the automata size for Presburger arithmetic. In: LICS 2004, pp. 110\u2013119. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"31_CR16","unstructured":"Klaedtke, F.: Ehrenfeucht-Fra\u00efss\u00e9 goes automatic for real addition. In: STACS 2008. IBFI Schloss Dagstuhl, pp. 445\u2013456 (2008)"},{"key":"31_CR17","volume-title":"Theory of Computation","author":"D. Kozen","year":"2006","unstructured":"Kozen, D.: Theory of Computation. Springer, New York (2006)"},{"key":"31_CR18","unstructured":"LASH, The Li\u00e8ge Automata-based Symbolic Handler, http:\/\/www.montefiore.ulg.ac.be\/~boigelot\/research\/lash\/"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0020-0190(00)00183-6","volume":"79","author":"C. L\u00f6ding","year":"2001","unstructured":"L\u00f6ding, C.: Efficient minimization of deterministic weak \u03c9-automata. Information Processing Letters\u00a079, 105\u2013109 (2001)","journal-title":"Information Processing Letters"},{"key":"31_CR20","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00312-X","volume":"181","author":"O. Maler","year":"1997","unstructured":"Maler, O., Staiger, L.: On syntactic congruences for omega-languages. Theoretical Comput. Sci.\u00a0181, 93\u2013112 (1997)","journal-title":"Theoretical Comput. Sci."},{"key":"31_CR21","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/309831.309888","volume-title":"ISSAC 1999","author":"V. Weispfenning","year":"1999","unstructured":"Weispfenning, V.: Mixed real-integer linear quantifier elimination. In: ISSAC 1999, pp. 129\u2013136. ACM, New York (1999)"},{"key":"31_CR22","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1093\/comjnl\/36.5.450","volume":"36","author":"V. Weispfenning","year":"1993","unstructured":"Weispfenning, V., Loos, R.: Applying linear quantifier elimination. The Computer Journal\u00a036, 450\u2013462 (1993)","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87531-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T19:04:38Z","timestamp":1738350278000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87531-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540875307","9783540875314"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87531-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}