{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:53:40Z","timestamp":1725573220626},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540254355"},{"type":"electronic","value":"9783540319870"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31987-0_4","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T13:42:00Z","timestamp":1292852520000},"page":"31-45","source":"Crossref","is-referenced-by-count":10,"title":["Interprocedural Herbrand Equalities"],"prefix":"10.1007","author":[{"given":"Markus","family":"M\u00fcller-Olm","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Alpern, B., Wegman, M., Zadeck, F.K.: Detecting Equality of Variables in Programs. In: 15th ACM Symp. on Principles of Programming Languages (POPL), pp. 1\u201311 (1988)","DOI":"10.1145\/73560.73561"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1145\/6490.6494","volume":"33","author":"K.R. Apt","year":"1986","unstructured":"Apt, K.R., Plotkin, G.D.: Countable Nondeterminism and Random Assignment. Journal of the ACM\u00a033(4), 724\u2013767 (1986)","journal-title":"Journal of the ACM"},{"issue":"2","key":"4_CR3","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/201059.201061","volume":"17","author":"C. Click","year":"1995","unstructured":"Click, C., Cooper, K.D.: Combining Analyses, Combining Optimizations. ACM Transactions on Programming Languages and Systems\u00a017(2), 181\u2013196 (1995)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR4","unstructured":"Cocke, J., Schwartz, J.T.: Programming languages and their compilers. Courant Institute of Mathematical Sciences, NY (1970)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Cousot, P.: Constructive Design of a Hierarchy of Semantics of a Transition System by Abstract Interpretation. Electronic Notes in Theoretical Computer Science\u00a06 (1997), www.elsevier.nl\/locate\/entcs\/volume6.html","DOI":"10.1016\/S1571-0661(05)80168-9"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In: 4th ACM Symp. on Principles of Programming Languages, POPL (1977)","DOI":"10.1145\/512950.512973"},{"key":"4_CR7","first-page":"237","volume-title":"IFIP Conf. on Formal Description of Programming Concepts","author":"P. Cousot","year":"1977","unstructured":"Cousot, P., Cousot, R.: Static Determination of Dynamic Properties of Recursive Procedures. In: Neuhold, E. (ed.) IFIP Conf. on Formal Description of Programming Concepts, pp. 237\u2013277. North-Holland, Amsterdam (1977)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Gargi, K.: A Sparse Algorithm for Predicated Global Value Numbering. In: ACM Conf. on Programming Language Design and Implementation (PLDI), pp. 45\u201356 (2002)","DOI":"10.1145\/512529.512536"},{"key":"4_CR9","volume-title":"11th Int. Static Analysis Symposium (SAS)","author":"S. Gulwani","year":"2004","unstructured":"Gulwani, S., Necula, G.C.: A Polynomial-time Algorithm for Global Value Numbering. In: 11th Int. Static Analysis Symposium (SAS). Springer, Heidelberg (2004)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Necula, G.C.: Global Value Numbering Using Random Interpretation. In: 31st ACM Symp. on Principles of Programming Languages (POPL), pp. 342\u2013352 (2004)","DOI":"10.1145\/964001.964030"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Kildall, G.A.: A Unified Approach to Global Program Optimization. In: First\u00a0ACM Symp. on Principles of Programming Languages (POPL), pp. 194\u2013206 (1973)","DOI":"10.1145\/512927.512945"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/BFb0053569","volume-title":"Programming Languages and Systems","author":"J. Knoop","year":"1998","unstructured":"Knoop, J., R\u00fcthing, O., Steffen, B.: Code Motion and Code Placement: Just Synonyms? In: Hankin, C. (ed.) ESOP 1998. LNCS, vol.\u00a01381, pp. 154\u2013196. Springer, Heidelberg (1998)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","first-page":"125","volume-title":"EPIA\u201991","author":"J. Knoop","year":"1991","unstructured":"Knoop, J., Steffen, B.: The Interprocedural Coincidence Theorem. In: Barahona, P., Porto, A., Moniz Pereira, L. (eds.) EPIA 1991. LNCS, vol.\u00a0541, pp. 125\u2013140. Springer, Heidelberg (1991)"},{"volume-title":"Program Flow Analysis: Theory and Applications","year":"1981","key":"4_CR14","unstructured":"Muchnick, S.S., Jones, N.D. (eds.): Program Flow Analysis: Theory and Applications. Prentice-Hall, Englewood Cliffs (1981)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-30579-8_6","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"M. M\u00fcller-Olm","year":"2005","unstructured":"M\u00fcller-Olm, M., R\u00fcthing, O., Seidl, H.: Checking Herbrand Equalities and Beyond. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol.\u00a03385, pp. 79\u201396. Springer, Heidelberg (2005)"},{"key":"4_CR16","unstructured":"M\u00fcller-Olm, M., Seidl, H., Steffen, B.: Interprocedural Analysis for Free. Technical Report 790, Fachbereich Informatik, Universit\u00e4t Dortmund (2004)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Reif, J.H., Lewis, R.: Symbolic Evaluation and the Gobal Value Graph. In: 4th\u00a0ACM Symp. on Principles of Programming Languages (POPL), pp. 104\u2013118 (1977)","DOI":"10.1145\/512950.512961"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Global Value Numbers and Redundant Computations. In: 15th\u00a0ACM Symp. on Principles of Programming Languages (POPL), pp. 12\u201327 (1988)","DOI":"10.1145\/73560.73562"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-48294-6_15","volume-title":"Static Analysis","author":"O. R\u00fcthing","year":"1999","unstructured":"R\u00fcthing, O., Knoop, J., Steffen, B.: Detecting Equalities of Variables: Combining Efficiency with Precision. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, pp. 232\u2013247. Springer, Heidelberg (1999)"},{"key":"4_CR20","unstructured":"Sharir, M., Pnueli, A.: Two Approaches to Interprocedural Data Flow Analysis. In: [14] ch.\u00a07, pp. 189\u2013233"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-17660-8_47","volume-title":"TAPSOFT \u201987 Proceedings of the International Joint Conference on Theory and Practice of Software Development","author":"B. Steffen","year":"1987","unstructured":"Steffen, B.: Optimal Run Time Optimization\u2014Proved by a New Look at Abstract Interpretations. In: Ehrig, H., Levi, G., Montanari, U. (eds.) CAAP 1987 and TAPSOFT 1987. LNCS, vol.\u00a0249, pp. 52\u201368. Springer, Heidelberg (1987)"},{"key":"4_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-52592-0_76","volume-title":"ESOP \u201990","author":"B. Steffen","year":"1990","unstructured":"Steffen, B., Knoop, J., R\u00fcthing, O.: The Value Flow Graph: A Program Representation for Optimal Program Transformations. In: Jones, N.D. (ed.) ESOP 1990. LNCS, vol.\u00a0432, pp. 389\u2013405. Springer, Heidelberg (1990)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/3540539816_78","volume-title":"TAPSOFT \u201991. Proceedings of the International Joint Conference on Theory and Practice of Software Development","author":"B. Steffen","year":"1991","unstructured":"Steffen, B., Knoop, J., R\u00fcthing, O.: Efficient Code Motion and an Adaption to Strength Reduction. In: Abramsky, S. (ed.) TAPSOFT 1991, CCPSD 1991, and ADC-Talks 1991. LNCS, vol.\u00a0494, pp. 394\u2013415. Springer, Heidelberg (1991)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31987-0_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:33:22Z","timestamp":1605742402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31987-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540254355","9783540319870"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31987-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}