{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T05:04:40Z","timestamp":1773983080675,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540603603","type":"print"},{"value":"9783540450504","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60360-3_31","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:20:18Z","timestamp":1330262418000},"page":"33-50","source":"Crossref","is-referenced-by-count":33,"title":["Generation of efficient interprocedural analyzers with PAG"],"prefix":"10.1007","author":[{"given":"Martin","family":"Alt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Martin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"M. Alt, U. A\u00dfmann, and H. van Someren. Cosy Compiler Phase Embedding with the Cosy Compiler Model. In CC'94, LNCS 786 Springer, 1994.","DOI":"10.1007\/3-540-57877-3_19"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"D. Callahan, K. D. Cooper, K. Kennedy, and L. Torczon. Interprocedural constant propagation. In SIGPLAN '86, volume 21, June 1986.","DOI":"10.1145\/12276.13327"},{"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 POPL'77, pages 238\u2013252, 1977.","DOI":"10.1145\/512950.512973"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In POPL'79, pages 269\u2013282, January 1979.","DOI":"10.1145\/567752.567778"},{"issue":"4","key":"4_CR5","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1093\/logcom\/2.4.511","volume":"2","author":"P. Cousot","year":"1992","unstructured":"P. Cousot and R. Cousot. Abstract interpretation frameworks. Journal of Logic Computation, 2(4):511\u2013547, 1992.","journal-title":"Journal of Logic Computation"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"D. Dhamdhere, B. Rosen, and F. K. Zadeck. How to analyze large programs efficiently and informatively. In SIGPLAN PLDI '92, volume 27, June 1992.","DOI":"10.1145\/143095.143135"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"E. Duesterwald, R. Gupta, and M. L. Soffa. Demand-driven computation of interprocedual data flow. In POPL '95, January 1995.","DOI":"10.1145\/199448.199461"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"D. Grove and L. Torczon. Interprocedural Constant Propagation: A Study of Jump Function Implementations. In ACM SIGPLAN PLDI '93, 1993.","DOI":"10.1145\/155090.155099"},{"key":"4_CR9","unstructured":"M. Hecht. Flow Analysis of Computer Programs. North Holland, 1977."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"N. Jones and S. Muchnick. Even simple programs are hard to analyze. In POPL'75, pages 106\u2013118, January 1975.","DOI":"10.1145\/512976.512988"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/BF00290339","volume":"7","author":"J. Kam","year":"1977","unstructured":"J. Kam and J. Ullman. Monotone data flow analysis frameworks. Acta Informatica, 7:305\u2013317, 1977.","journal-title":"Acta Informatica"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"G. Kildall. A unified approach to global program optimization. In POPL'73, pages 194\u2013206, October 1973.","DOI":"10.1145\/512927.512945"},{"key":"4_CR13","first-page":"125","volume":"641","author":"J. Knoop","year":"1992","unstructured":"J. Knoop and B. Steffen. The interprocedural coincidence theorem. In CC'92, LNCS 641, pages 125\u2013140., 1992.","journal-title":"LNCS"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"T. Reps, M. Sagiv, and S. Horwitz. Precise interprocedural dataflow analysis with application to constant propagation. In TAPSOFT'95, Arhus, Denmark, 1995.","DOI":"10.1145\/199448.199462"},{"key":"4_CR15","unstructured":"Florian Martin. Die Generierung von Datenflu\u00dfanalysatoren. Master's thesis, Universit\u00e4t des Saarlandes, 1995."},{"key":"4_CR16","unstructured":"Florian Martin. PAG Reference Manual. Universit\u00e4t des Saarlandes, 1995."},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Kurt Mehlhorn. Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness. Springer Verlag, 1984. ISBN 3\u2013540-13641-X.","DOI":"10.1007\/978-3-642-69897-2_3"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"H.R. Nielson and F. Nielson. Bounded fixed point iteration. In ACM POPL'92, pages 71\u201382, Albuquerque, NM, January 1992.","DOI":"10.1145\/143165.143182"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Mads Rosendahl. Higher-order chaotic iteration sequences. In PLILP'93, Tallinn, Estonia, LNCS 714, pages 332\u2013345. Springer-Verlag, 1993.","DOI":"10.1007\/3-540-57186-8_89"},{"key":"4_CR20","unstructured":"M. Sharir and A. Pnueli. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, chapter 7, Prentice-Hall, 1981."},{"key":"4_CR21","unstructured":"S. Tjiang and J. Hennessy. Sharlit \u2014 A tool for building optimizers. In PLDI'92."},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"G.V. Venkatesch and C. N. Fischer. Spare: A development environment For Program Analysis Algorithms. In IEEE Transactions on Software Engineering, 1992.","DOI":"10.1109\/32.129219"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"M. N. Wegman and F. K. Zadeck. Constant propagation with conditional branches. In ACM POPL'85, pages 291\u2013299, New Orleans, LA, January 1985.","DOI":"10.1145\/318593.318659"},{"key":"4_CR24","unstructured":"Reinhard Wilhelm and Dieter Maurer. Compiler Design. International Computer Science Series. Addison-Wesley, 1995."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"K. Yi and W.L. Harrison III. Automatic generation and management of interprocedural program analyses. In ACM SIGPLAN-SIGACT, January 1993.","DOI":"10.1145\/158511.158642"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60360-3_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:58:22Z","timestamp":1605628702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60360-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540603603","9783540450504"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-60360-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}