{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:21:25Z","timestamp":1752985285032},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540552536"},{"type":"electronic","value":"9783540468035"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55253-7_19","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:56:29Z","timestamp":1330250189000},"page":"321-340","source":"Crossref","is-referenced-by-count":1,"title":["Interprocedural type propagation for object-oriented languages"],"prefix":"10.1007","author":[{"given":"J. M.","family":"Larchev\u00eaque","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"S. Abiteboul, P. Kanellakis, and E. Waller. Method schemas. In Proceedings of the Ninth ACM Symposium on Principles of Database Systems (Nashville, TN), pages 16\u201327, April 1990.","DOI":"10.1145\/298514.298538"},{"key":"19_CR2","unstructured":"A. Aho, R. Sethi, and J. Ullman. Compilers: principles, techniques and tools. Addison-Wesley, 1986."},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Alan H. Borning and Daniel H. H. Ingalls. A type declaration and inference system for Smalltalk. In Conference record of the Ninth Annual ACM Symposium on the Principles of Programming Languages, Albuquerque (NM), pages 133\u2013141, January 1982.","DOI":"10.1145\/582153.582168"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"David Callahan. The program summary graph and flow-sensitive interprocedural data flow analysis. In Proceedings of the SIGPLAN '88 Conference on Programming Language Design and Implementation, Atlanta, Georgia, pages 47\u201356. ACM, June 1988.","DOI":"10.1145\/53990.53995"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"David Callahan, Keith D. Cooper, Ken Kennedy, and Linda Torczon. Interprocedural constant propagation. In Proceedings of the SIGPLAN '86 Symposium on Compiler Construction, June 86, pages 152\u2013161, June 1986.","DOI":"10.1145\/12276.13327"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Keith D. Cooper and Ken Kennedy. Fast interprocedural alias analysis. In Conference Record of the Annual ACM Symposium on Principles of Programming Languages, Austin (TX), pages 49\u201359, January 1989.","DOI":"10.1145\/75277.75282"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"C. Chambers and D. Ungar. Iterative type analysis and extended message splitting. In Proceedings of the ACM SIGPLAN '90 Conf. on Programming Language Design and Implementation, White Plains, NY, pages 150\u2013164, June 1990. published as SIGPLAN Notices, Vol. 25, Num. 6.","DOI":"10.1145\/93548.93562"},{"issue":"1","key":"19_CR8","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1145\/321921.321939","volume":"23","author":"L. G. Susan","year":"1976","unstructured":"Susan L. Graham and Mark Wegman. A fast and usually linear algorithm for global flow analysis. Journal of the ACM, 23(1):172\u2013202, January 1976.","journal-title":"Journal of the ACM"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Matthew S. Hecht and Jeffrey D. Ullman. Analysis of a simple algorithm for global data flow problems. In Conference Record of the ACM Symposium on the Principles of Programming Languages, pages 207\u2013217, September 1973.","DOI":"10.1145\/512927.512946"},{"key":"19_CR10","unstructured":"Ken Kennedy. A survey of data flow analysis techniques. In S. Muchnick and N. Jones, editors, Program Flow Analysis, Theory and Applications, chapter 1, pages 5\u201354. Prentice-Hall, 1981."},{"key":"19_CR11","first-page":"143","volume":"32","author":"J. W. Klop","year":"1987","unstructured":"Jan Willem Klop. Term rewriting systems: a tutorial. Bulletin of the EATCS, 32:143\u2013182, 1987.","journal-title":"Bulletin of the EATCS"},{"issue":"3","key":"19_CR12","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF00290339","volume":"7","author":"J. B. Kam","year":"1977","unstructured":"J.B. Kam and J.D. Ullman. Monotone data flow analysis frameworks. Acta Information, 7(3):305\u2013318, 1977. Originally published as Research Report TR-169, Computer Sciences Laboratory, Princeton University.","journal-title":"Acta Information"},{"key":"19_CR13","volume-title":"Rapport Technique 64-90-V1","author":"J.-M. Larchev\u00eaque","year":"1991","unstructured":"J.-M. Larchev\u00eaque. Interprocedural type propagation for object-oriented languages. Rapport Technique 64-90-V1, GIP Alta\u00efr, Rocquencourt, France, September 1991."},{"key":"19_CR14","unstructured":"J.-M. Larchev\u00eaque. Compilation techniques for incremental development in a persistent object-oriented environment. PhD thesis, LRI, Universit\u00e9 de Paris-Sud, January 1992."},{"key":"19_CR15","series-title":"Report DCS-TR-25","volume-title":"PhD thesis","author":"T. J. Marlowe","year":"1989","unstructured":"T.J. Marlowe. Data Flow Analysis and Incremental Iteration. PhD thesis, Rutgers University, New Brunswick, New Jersey 08903, October 1989. Report DCS-TR-25."},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Eugene W. Myers. A precise inter-procedural data flow algorithm. In Conference record of the Eighth Annual ACM Symposium on the Principles of Programming Languages, pages 219\u2013230, January 1981.","DOI":"10.1145\/567532.567556"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"John H. Reif and Harry R. Lewis. Symbolic evaluation and the global value graph. In Conference record of the Fourth Annual ACM Symposium on the Principles of Programming Languages, Los Angeles (CA), pages 104\u2013118, January 1977.","DOI":"10.1145\/512950.512961"},{"key":"19_CR18","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0022-0000(86)90031-0","volume":"32","author":"John H. H. Reif","year":"1986","unstructured":"John H. Reif and Harry R. Lewis. Efficient symbolic analysis of programs. Journal of Computer and System Sciences, 32:280\u2013314, June 1986.","journal-title":"Journal of Computer and System Sciences"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Fran\u00e7ois Rouaix. Safe run-time overloading. In Conference Record of the Annual ACM Symposium on Principles of Programming Languages, San Francisco (CA), pages 355\u2013366, January 1990.","DOI":"10.1145\/96709.96746"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Barry K. Rosen, Mark N. Wegman, and F. Kenneth Zadeck. Global value numbers and redundant computations. In Proceedings of the Fifteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, San Diego (CA), pages 12\u201327, January 1988.","DOI":"10.1145\/73560.73562"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Norihisa Suzuki. Inferring types in Smalltalk. In Conference record of the Eighth Annual ACM Symposium on the Principles of Programming Languages, pages 187\u2013198, January 1981.","DOI":"10.1145\/567532.567553"},{"issue":"3","key":"19_CR22","first-page":"576","volume":"28","author":"R. E. Tarjan","year":"1981","unstructured":"R. Endre Tarjan. A unified approach to path problems. Journal of the ACM, 28(3):576\u2013593, 1981.","journal-title":"Journal of the ACM"},{"issue":"3","key":"19_CR23","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1109\/TSE.1975.6312852","volume":"1","author":"B. Wegbreit","year":"1975","unstructured":"Ben Wegbreit. Property extraction in well-founded property sets. IEEE Trans. Software Eng., SE-1(3):270\u2013285, September 1975.","journal-title":"IEEE Trans. Software Eng."},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"William E. Weihl. Interprocedural data flow analysis in the presence of pointers, procedure variables, and label variables. In Conference record of the Seventh Annual ACM Symposium on the Principles of Programming Languages, pages 83\u201394, June 1980.","DOI":"10.1145\/567446.567455"},{"issue":"2","key":"19_CR25","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1145\/103135.103136","volume":"13","author":"Mark N. N. Wegman","year":"1991","unstructured":"Mark N. Wegman and F. Kenneth Zadeck. Constant propagation with conditional branches. ACM Transactions on Programming Languages and Systems, 13(2):181\u2013210, April 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"6","key":"19_CR26","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1145\/502949.502888","volume":"19","author":"F. K. Zadeck","year":"1984","unstructured":"F. K. Zadeck. Incremental data flow analysis in a structured program editor. SIGPLAN Notices, 19(6):132\u2013143, June 1984. Proceedings of the SIGPLAN Symposium on Compiler Construction (Montreal, Canada).","journal-title":"SIGPLAN Notices"}],"container-title":["Lecture Notes in Computer Science","ESOP '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55253-7_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:26Z","timestamp":1605646706000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55253-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552536","9783540468035"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-55253-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}