{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T14:10:29Z","timestamp":1649081429634},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8233,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991]]},"DOI":"10.1016\/0304-3975(91)90392-f","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T17:17:57Z","timestamp":1032283077000},"page":"303-318","source":"Crossref","is-referenced-by-count":5,"title":["Finite constants: characterizations of a new decidable set of constants"],"prefix":"10.1016","volume":"80","author":[{"given":"Bernhard","family":"Steffen","sequence":"first","affiliation":[]},{"given":"Jens","family":"Knoop","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90392-F_BIB1","series-title":"Principles of Compiler Design","author":"Aho","year":"1977"},{"key":"10.1016\/0304-3975(91)90392-F_BIB2","doi-asserted-by":"crossref","DOI":"10.1145\/390013.808479","article-title":"Control flow analysis","author":"Allen","year":"1970","journal-title":"ACM Sigplan Notices"},{"key":"10.1016\/0304-3975(91)90392-F_BIB3","first-page":"1","article-title":"Detecting equality of variables in programs","author":"Alpern","year":"1988","journal-title":"15th POPL"},{"key":"10.1016\/0304-3975(91)90392-F_BIB4","series-title":"Preliminary Notes","article-title":"Programming languages and their compilers","author":"Cocke","year":"1970"},{"key":"10.1016\/0304-3975(91)90392-F_BIB5","series-title":"Program Flow Analysis: Theory and Applications","article-title":"Denotational definition of properties of program computations","author":"Donzeau-Gouge","year":"1981"},{"key":"10.1016\/0304-3975(91)90392-F_BIB6","first-page":"217","article-title":"A program form based on data dependency in predicate regions","author":"Ferrante","year":"1983","journal-title":"10th POPL"},{"key":"10.1016\/0304-3975(91)90392-F_BIB7","series-title":"SETL Newsletter 112","article-title":"Variable subsumption with constant folding","author":"Kennedy","year":"1973"},{"key":"10.1016\/0304-3975(91)90392-F_BIB8","series-title":"Technical Report No. 72-06-02","article-title":"Global expression optimization during compilation","author":"Kildall","year":"1972"},{"key":"10.1016\/0304-3975(91)90392-F_BIB9","first-page":"194","article-title":"A unified approach to global program optimization","author":"Kildall","year":"1973","journal-title":"1st POPL"},{"issue":"1","key":"10.1016\/0304-3975(91)90392-F_BIB10","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/321921.321938","article-title":"Global data flow analysis and iterative algorithms","volume":"23","author":"Kam","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(91)90392-F_BIB11","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF00290339","article-title":"Monotone data flow analysis frameworks","volume":"7","author":"Kam","year":"1977","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(91)90392-F_BIB12","first-page":"31","article-title":"A bibliography on abstract interpretations","volume":"21","author":"Nielson","year":"1986","journal-title":"ACM Sigplan Notices"},{"key":"10.1016\/0304-3975(91)90392-F_BIB13","first-page":"104","article-title":"Symbolic evaluation and the global value graph","author":"Reif","year":"1977","journal-title":"4th POPL"},{"key":"10.1016\/0304-3975(91)90392-F_BIB14","series-title":"Technical Report No. 37\u201382","article-title":"Efficient symbolic analysis of programs","author":"Reif","year":"1982"},{"key":"10.1016\/0304-3975(91)90392-F_BIB15","series-title":"PhD thesis","article-title":"Abstrakte Interpretationen beim Optimieren von Programmlaufzeiten. Ein Optimalit\u00e4tskonzept und seine Anwendung","author":"Steffen","year":"1987"},{"key":"10.1016\/0304-3975(91)90392-F_BIB16","series-title":"2nd TAPSOFT","article-title":"Optimal run time optimization. Provedby a new look at abstract interpretations","volume":"249","author":"Steffen","year":"1987"},{"key":"10.1016\/0304-3975(91)90392-F_BIB17","series-title":"14th MFCS","first-page":"492","article-title":"Optimal data flow analysis via observational equivalence","volume":"379","author":"Steffen","year":"1989"},{"key":"10.1016\/0304-3975(91)90392-F_BIB18","series-title":"14th MFCS","first-page":"481","article-title":"Finite constants: characterizations of a new decidable set of constants","volume":"379","author":"Steffen","year":"1989"},{"key":"10.1016\/0304-3975(91)90392-F_BIB19","series-title":"LFCS Report Series. ECS-LFCS-89-79","article-title":"Finite constants: characterizations of a new decidable set of constants","author":"Steffen","year":"1989"},{"key":"10.1016\/0304-3975(91)90392-F_BIB20","unstructured":"B. Steffen and J. Knoop, Term closures for optimal program optimization, in preparation."},{"issue":"3","key":"10.1016\/0304-3975(91)90392-F_BIB21","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1145\/322261.322273","article-title":"Fast algorithms for solving path problems","volume":"28","author":"Tarjan","year":"1981","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0304-3975(91)90392-F_BIB22","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/TSE.1975.6312852","article-title":"Property extraction in well-founded property sets","volume":"1","author":"Wegbreit","year":"1975","journal-title":"IEEE Trans. Software Engineering"},{"key":"10.1016\/0304-3975(91)90392-F_BIB23","series-title":"Program Flow Analysis: Theory and Applications","article-title":"Global flow analysis and optimization in the MUG2 compiler generating system","author":"Wilhelm","year":"1981"},{"key":"10.1016\/0304-3975(91)90392-F_BIB24","first-page":"291","article-title":"Constant propagation with conditional branches","author":"Wegman","year":"1985","journal-title":"12th POPL"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190392F?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759190392F?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T15:56:01Z","timestamp":1554825361000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759190392F"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991]]}},"alternative-id":["030439759190392F"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90392-f","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991]]}}}