{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:27:46Z","timestamp":1725488866968},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442356"},{"type":"electronic","value":"9783540457893"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45789-5_4","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T09:50:10Z","timestamp":1186825810000},"page":"4-19","source":"Crossref","is-referenced-by-count":17,"title":["Polynomial Constants Are Decidable"],"prefix":"10.1007","author":[{"given":"Markus","family":"M\u00fcller-Olm","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,9,5]]},"reference":[{"key":"4_CR1","unstructured":"A. V. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques, and Tools. Addison-Wesley, 1986."},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1145\/6490.6494","volume":"33","author":"K. R. Apt","year":"1986","unstructured":"K. R. Apt and G. D. Plotkin. Countable nondeterminism and random assignment. Journal of the ACM, 33(4):724\u2013767, 1986.","journal-title":"Journal of the ACM"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings 4th POPL, Los Angeles, California, 1977.","DOI":"10.1145\/512950.512973"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"4","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract interpretation frameworks. J. Logic Computat., 4(2):511\u2013547, 1992.","journal-title":"J. Logic Computat."},{"key":"4_CR5","unstructured":"J. H. Davenport, Y. Siret, and E. Tournier. Computer Algebra: Systems and Algorithms for Algebraic Computation. Academic Press, 1988."},{"key":"4_CR6","unstructured":"E. W. Dijkstra. A Discipline of Programming. Prentice Hall, 1976."},{"key":"4_CR7","volume-title":"Crafting a Compiler","author":"C. Fischer","year":"1988","unstructured":"C. Fischer and R. LeBlanc. Crafting a Compiler. Benjamin\/Cummings Publishing Co., Inc., Menlo Park, CA, 1988."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"K. O. Geddes, S. R. Czapor, and G. Labahn. Algorithms for Computer Algebra. Kluwer, 1992.","DOI":"10.1007\/b102438"},{"key":"4_CR9","unstructured":"M. S. Hecht. Flow analysis of computer programs. Elsevier North-Holland, 1977."},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF00268497","volume":"6","author":"M. Karr","year":"1976","unstructured":"M. Karr. Affine relationships among variables of a program. Acta Informatica, 6:133\u2013151, 1976.","journal-title":"Acta Informatica"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(94)00195-5","volume":"53","author":"Mathematics of Program Construction Group. Fixed-point calculus","year":"1995","unstructured":"Mathematics of Program Construction Group. Fixed-point calculus. Information Processing Letters, 53(3):131\u2013136, 1995.","journal-title":"Information Processing Letters"},{"key":"4_CR12","unstructured":"Y. V. Matiyasevich. Hilbert\u2019s Tenth Problem. The MIT Press, 1993."},{"key":"4_CR13","series-title":"Lect Notes Comput Sci","first-page":"299","volume-title":"Category Theory and Computer Programming","author":"A. Melton","year":"1985","unstructured":"A. Melton, D. A. Schmidt, and G. E. Strecker. Galois connections and computer science applications. In D. Pitt, S. Abramsky, A. Poign\u00e9, and D. Rydeheard, editors, Category Theory and Computer Programming, LNCS 240, pages 299\u2013312. Springer-Verlag, 1985."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"B. Mishra. Algorithmic Algebra. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4612-4344-1"},{"key":"4_CR15","volume-title":"Advanced compiler design and implementation","author":"S. S. Muchnick","year":"1997","unstructured":"S. S. Muchnick. Advanced compiler design and implementation. Morgan Kaufmann Publishers, San Francisco, California, 1997."},{"key":"4_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/3-540-45309-1_13","volume-title":"ESOP 2001","author":"M. M\u00fcller-Olm","year":"2001","unstructured":"M. M\u00fcller-Olm and O. R\u00fcthing. The complexity of constant propagation. In D. Sands, editor, ESOP 2001, LNCS 2028, pages 190\u2013205. Springer, 2001."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"J. R. Reif and H. R. Lewis. Symbolic evaluation and the global value graph. In Conf. Rec. 4th ACM Symposium on Principles of Programming Languages POPL\u201977, pages 104\u2013118, Los Angeles, CA, January 1977.","DOI":"10.1145\/512950.512961"},{"issue":"1\u20132","key":"4_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(96)00072-2","volume":"167","author":"M. Sagiv","year":"1996","unstructured":"M. Sagiv, T. Reps, and S. Horwitz. Precise interprocedural dataflow analysis with applications to constant propagation. Theoretical Computer Science, 167(1\u20132):131\u2013170, 1996.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0304-3975(91)90392-F","volume":"80","author":"B. Steffen","year":"1991","unstructured":"B. Steffen and J. Knoop. Finite constants: Characterizations of a new decidable set of constants. Theoretical Computer Science, 80(2):303\u2013318, 1991.","journal-title":"Theoretical Computer Science"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"F. Winkler. Polynomial Algorithms. Springer-Verlag, 1996.","DOI":"10.1007\/978-3-7091-6571-3"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45789-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T05:47:54Z","timestamp":1550728074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45789-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442356","9783540457893"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-45789-5_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}