{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:07:55Z","timestamp":1725505675143},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787389"},{"type":"electronic","value":"9783540787396"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78739-6_15","type":"book-chapter","created":{"date-parts":[[2008,4,2]],"date-time":"2008-04-02T08:39:06Z","timestamp":1207125546000},"page":"178-192","source":"Crossref","is-referenced-by-count":5,"title":["Upper Adjoints for Fast Inter-procedural Variable Equalities"],"prefix":"10.1007","author":[{"given":"Markus","family":"M\u00fcller-Olm","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Seidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_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":"15_CR2","first-page":"304","volume":"5","author":"C. Fecht","year":"1998","unstructured":"Fecht, C., Seidl, H.: Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. Nordic Journal of Computing (NJC)\u00a05(4), 304\u2013329 (1998)","journal-title":"Nordic Journal of Computing (NJC)"},{"issue":"3","key":"15_CR3","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/229542.229546","volume":"18","author":"L. George","year":"1996","unstructured":"George, L., Appel, A.W.: Iterated Register Coalescing. ACM Transactions on Programming Languages and Systems (TOPLAS)\u00a018(3), 300\u2013324 (1996)","journal-title":"ACM Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1007\/978-3-540-27864-1_17","volume-title":"Static Analysis","author":"S. Gulwani","year":"2004","unstructured":"Gulwani, S., Necula, G.C.: A Polynomial-Time Algorithm for Global Value Numbering. In: Giacobazzi, R. (ed.) SAS 2004. LNCS, vol.\u00a03148, pp. 212\u2013227. Springer, Heidelberg (2004)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T.W., Sagiv, M.: Demand Interprocedural Dataflow Analysis. In: 3rd ACM Symp. on the Foundations of Software Engineering (FSE), pp. 104\u2013115 (1995)","DOI":"10.1145\/222124.222146"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T.W., Sagiv, M.: Precise Interprocedural Dataflow Analysis via Graph Reachability. In: 22nd ACM Symp. on Principles of Programming Languages (POPL), pp. 49\u201361 (1995)","DOI":"10.1145\/222124.222146"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/3-540-48311-X_51","volume-title":"Conceptual Modeling","author":"J. Knoop","year":"1999","unstructured":"Knoop, J.: Parallel Data-Flow Analysis of Explicitly Parallel Programs. In: Chen, P.P., Akoka, J., Kangassalu, H., Thalheim, B. (eds.) Conceptual Modeling. LNCS, vol.\u00a01565, pp. 391\u2013400. Springer, Heidelberg (1999)"},{"key":"15_CR8","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)"},{"key":"15_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/3-540-17162-2_130","volume-title":"Category Theory and Computer Programming","author":"A. Melton","year":"1986","unstructured":"Melton, A., Schmidt, D.A., Strecker, G.E.: Galois Connections and Computer Science Applications. In: Poign\u00e9, A., Pitt, D.H., Rydeheard, D.E., Abramsky, S. (eds.) Category Theory and Computer Programming. LNCS, vol.\u00a0240, pp. 299\u2013312. Springer, Heidelberg (1986)"},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"15_CR11","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Olm, M., Seidl, H.: Precise Interprocedural Analysis through Linear Algebra. In: 31st ACM Symp. on Principles of Programming Languages (POPL), pp. 330\u2013341 (2004)","DOI":"10.1145\/964001.964029"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-3-540-31987-0_4","volume-title":"Programming Languages and Systems","author":"M. M\u00fcller-Olm","year":"2005","unstructured":"M\u00fcller-Olm, M., Seidl, H., Steffen, B.: Interprocedural Herbrand Equalities. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 31\u201345. Springer, Heidelberg (2005)"},{"key":"15_CR13","first-page":"189","volume-title":"Program Flow Analysis: Theory and Applications, cha\u00a07","author":"M. Sharir","year":"1981","unstructured":"Sharir, M., Pnueli, A.: Two Approaches to Interprocedural Data Flow Analysis. In: Muchnick, S.S., Jones, N.D. (eds.) Program Flow Analysis: Theory and Applications, ch.\u00a07, Program Flow Analysis: Theory and Applications, pp. 189\u2013233. Prentice Hall, Englewood Cliffs (1981)"},{"key":"15_CR14","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)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78739-6_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:20:46Z","timestamp":1619522446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78739-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787389","9783540787396"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78739-6_15","relation":{},"subject":[]}}