{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:07Z","timestamp":1725663187846},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540514862"},{"type":"electronic","value":"9783540481768"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51486-4_94","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:58:54Z","timestamp":1330185534000},"page":"481-491","source":"Crossref","is-referenced-by-count":8,"title":["Finite constants: Characterizations of a new decidable set of constants"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Steffen","sequence":"first","affiliation":[]},{"given":"Jens","family":"Knoop","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"42_CR1","unstructured":"A. V. Aho and J. D. Ullman. Principles of Compiler Design. Addison-Wesley, 1977."},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"F. E. Allen. Control flow analysis. ACM Sigplan Notices, July 1970.","DOI":"10.1145\/390013.808479"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"B. Alpern, M. N. Wegman, and F. K. Zadeck. Detecting equality of variables in programs. In 15th POPL, pages 1\u201311, San Diego, 1988.","DOI":"10.1145\/73560.73561"},{"key":"42_CR4","unstructured":"J. Cocke and J. T. Schwartz. Programming languages and their compilers. Preliminary notes, Courant Institute of Mathematical Sciences, New York University, April 1970."},{"key":"42_CR5","volume-title":"Program Flow Analysis: Theory and Applications","author":"V. Donzeau-Gouge","year":"1981","unstructured":"V. Donzeau-Gouge. Denotational definition of properties of program computations. In St. S. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications. Prentice Hall, New Jersey, 1981."},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"J. Ferrante and K. J. Ottenstein. A program form based on data dependency in predicate regions. In 10th POPL, pages 217\u2013236, Austin, Texas, 1983.","DOI":"10.1145\/567067.567089"},{"key":"42_CR7","first-page":"309","volume":"7","author":"J. B. Kam","year":"1975","unstructured":"J. B. Kam and J. D. Ullman. Monotone data flow analysis frameworks. Acta Informatica, 7:309\u2013317, 1975.","journal-title":"Acta Informatica"},{"issue":"1","key":"42_CR8","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321921.321938","volume":"23","author":"J. B. Kam","year":"1976","unstructured":"J. B. Kam and J. D. Ullman. Global data flow analysis and iterative algorithms. Journal of the ACM, 23(1):158\u2013171, January 1976.","journal-title":"Journal of the ACM"},{"key":"42_CR9","unstructured":"K. W. Kennedy. Variable subsumption with constant folding. SETL Newsletter 112, Courant Institute of Mathematical Sciences, New York University, August 1973."},{"key":"42_CR10","series-title":"Technical Report","volume-title":"Global expression optimization during compilation","author":"G. A. Kildall","year":"1972","unstructured":"G. A. Kildall. Global expression optimization during compilation. Technical Report 72-06-02, University of Washington, Computer Science Group, Seattle, Washington, 1972."},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"G. A. Kildall. A unified approach to global program optimization. In 1st POPL, pages 194\u2013206, Boston, Massachusetts, 1973.","DOI":"10.1145\/512927.512945"},{"key":"42_CR12","first-page":"31","volume":"21","author":"F. Nielson","year":"1986","unstructured":"F. Nielson. A bibliography on abstract interpretations. ACM Sigplan Notices, 21:31\u201338, 1986.","journal-title":"ACM Sigplan Notices"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"J. H. Reif and R. Lewis. Symbolic evaluation and the global value graph. In 4th POPL, pages 104\u2013118, Los Angeles, California, 1977.","DOI":"10.1145\/512950.512961"},{"key":"42_CR14","unstructured":"J. H. Reif and R. Lewis. Efficient symbolic analysis of programs. Technical Report 37\u201382, Harvard University, Aiken Computation Laboratory, 1982."},{"key":"42_CR15","unstructured":"B. Steffen. Abstrakte Interpretationen beim Optimieren von Programmlaufzeiten. Ein Optimalit\u00e4tskonzept und seine Anwendung. PhD thesis, Christian-Albrechts-Universit\u00e4t Kiel, 1987."},{"key":"42_CR16","first-page":"52","volume":"249","author":"B. Steffen","year":"1987","unstructured":"B. Steffen. Optimal run time optimization \u2014 proved by a new look at abstract interpretations. In TAPSOFT '87, pages 52\u201368. LNCS 249, 1987.","journal-title":"LNCS"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"B. Steffen. Optimal data flow analysis via observational equivalence. In MFCS '89, Lecture Notes in Computer Science. Springer Verlag, 1989.","DOI":"10.1007\/3-540-51486-4_95"},{"key":"42_CR18","unstructured":"B. Steffen and J. Knoop. Term closures for optimal program optimization. To appear."},{"key":"42_CR19","unstructured":"B. Steffen and J. Knoop. Ein optimales interpretationsunabh\u00e4ngiges Datenflu\u00dfanalyseverfahren. Technical Report 8711: Programmspezifikation \u2014 Midlum\/F\u00f6hr, 1987, Christian-Albrechts-Universit\u00e4t Kiel, Institut f\u00fcr Informatik, West-Germany, 1987."},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"B. Steffen and J. Knoop. Finite constants: Characterizations of a new decidable set of constants. LFCS Report Series 8979, LFCS, Edinburgh Univ., Dept. of Comp. Sci., 1989.","DOI":"10.1007\/3-540-51486-4_94"},{"issue":"3","key":"42_CR21","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/322261.322273","volume":"28","author":"R. E. Tarjan","year":"1981","unstructured":"R. E. Tarjan. Fast algorithms for solving path problems. Journal of the ACM, 28(3):594\u2013614, July 1981.","journal-title":"Journal of the ACM"},{"issue":"3","key":"42_CR22","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/TSE.1975.6312852","volume":"1","author":"B. Wegbreit","year":"1975","unstructured":"B. Wegbreit. Property extraction in well-founded property sets. IEEE Transactions on Software Engineering, 1(3):270\u2013285, September 1975.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"M. N. Wegman and F. K. Zadeck. Constant propagation with conditional branches. In 12th POPL, pages 291\u2013299, New Orleans, Lousiana, 1985.","DOI":"10.1145\/318593.318659"},{"key":"42_CR24","volume-title":"Program Flow Analysis: Theory and Applications","author":"R. Wilhelm","year":"1981","unstructured":"R. Wilhelm. Global flow analysis and optimization in the MUG2 compiler generating system. In St. S. Muchnick and N. D. Jones, editors, Program Flow Analysis: Theory and Applications. Prentice Hall, New Jersey, 1981."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1989"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51486-4_94.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:21:31Z","timestamp":1605630091000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51486-4_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540514862","9783540481768"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-51486-4_94","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}