{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T10:50:53Z","timestamp":1768733453910,"version":"3.49.0"},"reference-count":34,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":6407,"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":[[1996]]},"DOI":"10.1016\/0304-3975(96)00072-2","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"131-170","source":"Crossref","is-referenced-by-count":201,"title":["Precise interprocedural dataflow analysis with applications to constant propagation"],"prefix":"10.1016","volume":"167","author":[{"given":"Mooly","family":"Sagiv","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Reps","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susan","family":"Horwitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(96)00072-2_bib1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(96)00072-2_bib2","series-title":"Proc. 5th ACM Symp. on Principles of Database Systems","article-title":"Magic sets and other strange ways to implement logic programs","author":"Bancilhon","year":"1986"},{"key":"10.1016\/0304-3975(96)00072-2_bib3","series-title":"Proc. 6th ACM Symp. on Principles of Database Systems","first-page":"269","article-title":"On the power of magic","author":"Beeri","year":"1987"},{"key":"10.1016\/0304-3975(96)00072-2_bib4","series-title":"SIGPLAN Conf. on Programming Languages Design and Implementation","first-page":"47","article-title":"The program summary graph and flow-sensitive interprocedural data flow analysis","author":"Callahan","year":"1988"},{"key":"10.1016\/0304-3975(96)00072-2_bib5","series-title":"SIGPLAN Symp. on Compiler Construction","first-page":"152","article-title":"Interprocedural constant propagation","author":"Callahan","year":"1986"},{"key":"10.1016\/0304-3975(96)00072-2_bib6","series-title":"SIGPLAN Conference on Programming Languages Design and Implementation","first-page":"23","article-title":"Flow-sensitive interprocedural constant propagation","author":"Carini","year":"1995"},{"key":"10.1016\/0304-3975(96)00072-2_bib7","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/0304-3975(96)00072-2_bib8","series-title":"Formal Descriptions of Programming Concepts","first-page":"237","article-title":"Static determination of dynamic properties of recursive procedures","author":"Cousot","year":"1978"},{"key":"10.1016\/0304-3975(96)00072-2_bib9","series-title":"ACM Symp. on Principles of Programming Languages","first-page":"37","article-title":"Demand-driven computation of interprocedural data flow","author":"Duesterwald","year":"1995"},{"key":"10.1016\/0304-3975(96)00072-2_bib10","series-title":"Crafting a Compiler","author":"Fischer","year":"1988"},{"key":"10.1016\/0304-3975(96)00072-2_bib11","series-title":"GI 81 11th GI Annual Conf. Informatik-Fachberichte 50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-662-01089-1_1","article-title":"Invariance of approximative semantics with respect to program transformation","author":"Giegerich","year":"1981"},{"key":"10.1016\/0304-3975(96)00072-2_bib12","series-title":"SIGPLAN Conf. on Programming Languages Design and Implementation","first-page":"90","article-title":"A study of jump function implementations","author":"Grove","year":"1993"},{"key":"10.1016\/0304-3975(96)00072-2_bib13","series-title":"Proc. 3rd ACM SIGSOFT Symp. on the Foundations of Software Engineering","first-page":"104","article-title":"Demand interprocedural dataflow analysis","author":"Horwitz","year":"1995"},{"key":"10.1016\/0304-3975(96)00072-2_bib14","series-title":"ACM Symp. on Principles of Programming Languages","first-page":"296","article-title":"Data flow analysis of applicative programs using minimal function graphs","author":"Jones","year":"1986"},{"key":"10.1016\/0304-3975(96)00072-2_bib15","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF00268497","article-title":"Affine relationship among variables of a program","volume":"6","author":"Karr","year":"1976","journal-title":"Acta Inform."},{"key":"10.1016\/0304-3975(96)00072-2_bib16","series-title":"ACM Symp. on Principles of Programming Languages","first-page":"194","article-title":"A unified approach to global program optimization","author":"Kildall","year":"1973"},{"key":"10.1016\/0304-3975(96)00072-2_bib17","series-title":"Proc. Internat. Conf. on Compiler Construction","first-page":"125","article-title":"The interprocedural coincidence theorem","author":"Knoop","year":"1992"},{"key":"10.1016\/0304-3975(96)00072-2_bib18","series-title":"ACM Symp. on Principles of Programming Languages","first-page":"93","article-title":"Pointer induced aliasing: a problem classification","author":"Landi","year":"1991"},{"key":"10.1016\/0304-3975(96)00072-2_bib19","doi-asserted-by":"crossref","DOI":"10.1145\/176454.176526","article-title":"Interprocedural constant propagation: an empirical study","volume":"2","author":"Metzger","year":"1993","journal-title":"ACM Lett. on Programming Languages Systems"},{"key":"10.1016\/0304-3975(96)00072-2_bib20","series-title":"SIGPLAN Conf. on Programming Languages Design and Implementation","article-title":"Data flow frequency analysis","author":"Ramalingam","year":"1996"},{"key":"10.1016\/0304-3975(96)00072-2_bib21","series-title":"Applications of Logic Databases","article-title":"Demand interprocedural program analysis using logic databases","author":"Reps","year":"1994"},{"key":"10.1016\/0304-3975(96)00072-2_bib22","series-title":"Proc. Internat. Conf. on Compiler Construction","first-page":"389","article-title":"Solving demand versions of interprocedural analysis problems","author":"Reps","year":"1994"},{"key":"10.1016\/0304-3975(96)00072-2_bib23_1","series-title":"Proc. 5th Internat. Conf. on Compiler Construction","first-page":"389","article-title":"Solving demand versions of interprocedural analysis problems","author":"Reps","year":"1994"},{"key":"10.1016\/0304-3975(96)00072-2_bib23_2","volume":"Vol. 786","author":"Reps","year":"1994"},{"key":"10.1016\/0304-3975(96)00072-2_bib24","series-title":"ACM Symp. on Principles of Programming Languages","first-page":"49","article-title":"Precise interprocedural dataflow analysis via graph reachability","author":"Reps","year":"1995"},{"key":"10.1016\/0304-3975(96)00072-2_bib25","article-title":"Interprocedural dataflow analysis via graph reachability","author":"Reps","year":"1994"},{"key":"10.1016\/0304-3975(96)00072-2_bib26","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF03037407","article-title":"The Alexander method, a technique for the processing of recursive axioms in deductive databases","volume":"4","author":"Rohmer","year":"1986","journal-title":"New Generation Comput."},{"key":"10.1016\/0304-3975(96)00072-2_bib27","series-title":"Proc. FASE'95: Coll. on Formal Approaches in Software Engineering","first-page":"651","article-title":"Precise interprocedural dataflow analysis with applications to constant propagation","volume":"Vol. 915","author":"Sagiv","year":"1995"},{"key":"10.1016\/0304-3975(96)00072-2_bib28","series-title":"Program Flow Analysis: Theory and Applications","first-page":"189","article-title":"Two approaches to interprocedural data flow analysis","author":"Sharir","year":"1981"},{"key":"10.1016\/0304-3975(96)00072-2_bib29","series-title":"SPEC Component CPU Integer Release 2\/1992 (Cint92)","year":"1992"},{"key":"10.1016\/0304-3975(96)00072-2_bib30","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(91)90392-F","article-title":"Finite constants: characterizations of a new decidable set of constants","volume":"80","author":"Steffen","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(96)00072-2_bib31","article-title":"Principles of Database and Knowledge-Base Systems, Vol. II: The New Technologies","author":"Ullman","year":"1989"},{"key":"10.1016\/0304-3975(96)00072-2_bib32","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 Eng."},{"key":"10.1016\/0304-3975(96)00072-2_bib33","series-title":"ACM Symp. on Principles of Programming Languages","article-title":"Constant propagation with conditional branches","author":"Wegman","year":"1985"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596000722?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397596000722?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:24:45Z","timestamp":1556522685000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397596000722"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996]]}},"alternative-id":["0304397596000722"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(96)00072-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996]]}}}