{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:24:19Z","timestamp":1725488659746},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540664598"},{"type":"electronic","value":"9783540482949"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48294-6_15","type":"book-chapter","created":{"date-parts":[[2007,8,3]],"date-time":"2007-08-03T20:16:02Z","timestamp":1186172162000},"page":"232-247","source":"Crossref","is-referenced-by-count":17,"title":["Detecting Equalities of Variables: Combining Efficiency with Precision"],"prefix":"10.1007","author":[{"given":"Oliver","family":"R\u00fcthing","sequence":"first","affiliation":[]},{"given":"Jens","family":"Knoop","sequence":"additional","affiliation":[]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,10,1]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"B. Alpern, M. Wegman, and F. K. Zadeck. Detecting equality of variables in programs. In Conf. Record of the 15 th ACM Symposium on the Principles of Programming Languages (POPL), January 1988.","DOI":"10.1145\/73560.73561"},{"issue":"6","key":"15_CR2","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1002\/(SICI)1097-024X(199706)27:6<701::AID-SPE104>3.0.CO;2-0","volume":"27","author":"P. Briggs","year":"1997","unstructured":"P. Briggs, K. D. Cooper, and L. T. Simpson. Value numbering. Software-Practice and Experience, 27(6):701\u2013724, June 1997.","journal-title":"Software-Practice and Experience"},{"issue":"6","key":"15_CR3","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/223428.207154","volume":"30","author":"C. Click","year":"1995","unstructured":"C. Click. Global code motion\/global value numbering. In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), volume 30,6 of ACM SIGPLAN Notices, pages 246\u2013257, La Jolla, CA, June 1995.","journal-title":"ACM SIGPLAN Notices"},{"key":"15_CR4","volume-title":"Programming languages and their compilers","author":"J. Cocke","year":"1970","unstructured":"J. Cocke and J. T. Schwartz. Programming languages and their compilers. Courant Institute of Mathematical Sciences, NY, 1970."},{"issue":"4","key":"15_CR5","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"R. Cytron, J. Ferrante, B. Rosen, M. Wegman, and F. K. Zadeck. Efficiently computing static single assignment form and the control dependency graph. ACM Transactions on Programming Languages and Systems, 13(4):451\u2013490, 1991.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"A. Fong, J. B. Kam, and J. D. Ullman. Application of lattice algebra to loop optimization. In Conf. Record of the 2 nd ACM Symposium on the Principles of Programming Languages (POPL), pages 1\u20139, Palo Alto, CA, 1975.","DOI":"10.1145\/512976.512977"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"J. Hopcroft. An n log n algorithm for minimizing the states of a finite automaton. The Theory of Machines an Computations, pages 189\u2013169, 1971.","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"G. A. Kildall. A unified approach to global program optimization. In Conf. Record of the 1 st ACM Symposium on the Principles of Programming Languages (POPL), pages 194\u2013206, Boston, MA, 1973.","DOI":"10.1145\/512927.512945"},{"key":"15_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/BFb0053569","volume-title":"Proc. 6 th European Symposium on Programming (ESOP)","author":"J. Knoop","year":"1998","unstructured":"J. Knoop, O. R\u00fcthing, and B. Steffen. Code motion and code placement: Just synonyms? In Proc. 6 th European Symposium on Programming (ESOP), Lecture Notes in Computer Science 1381, pages 154\u2013196, Lisbon, Portugal, 1998. Springer-Verlag."},{"key":"15_CR10","volume-title":"Advanced Compiler Design & Implementation","author":"S. S. Muchnick","year":"1997","unstructured":"S. S. Muchnick. Advanced Compiler Design & Implementation. Morgan Kaufmann, San Francisco, CA, 1997."},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M. H. A. Newman","year":"1942","unstructured":"M. H. A. Newman. On theories with a combinatorial definition of equivalence. Annals of Math., 43,2:223\u2013243, 1942.","journal-title":"Annals of Math."},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"J. H. Reif and R. Lewis. Symbolic evaluation and the gobal value graph. In Conf. Record of the 4 th ACM Symposium on the Principles of Programming Languages (POPL), pages 104\u2013118, Los Angeles, CA, 1977.","DOI":"10.1145\/512950.512961"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"B. K. Rosen, M. N. Wegman, and F. K. Zadeck. Global value numbers and redundant computations. In Conf. Record of the 15 th ACM Symposium on the Principles of Programming Languages (POPL), pages 12\u201327, San Diego, CA, 1988.","DOI":"10.1145\/73560.73562"},{"key":"15_CR14","unstructured":"L. T. Simpson. Value-driven redundancy elimination. Technical Report TR98-308, Rice University, April 6, 1998."},{"key":"15_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-17660-8_47","volume-title":"Proc. 2 nd International Joint Conference on the Theory and Practice of Software Development (TAPSOFT)","author":"B. Steffen","year":"1987","unstructured":"B. Steffen. Optimal run time optimization. Proved by a new look at abstract interpretations. In Proc. 2 nd International Joint Conference on the Theory and Practice of Software Development (TAPSOFT), Lecture Notes in Computer Science 249, pages 52\u201368, Pisa, Italy, 1987. Springer-Verlag."},{"key":"15_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-52592-0_76","volume-title":"Proc. 3 rd European Symposium on Programming (ESOP)","author":"B. Steffen","year":"1990","unstructured":"B. Steffen, J. Knoop, and O. R\u00fcthing. The value flow graph: A program representation for optimal program transformations. In Proc. 3 rd European Symposium on Programming (ESOP), Lecture Notes in Computer Science 432, pages 389\u2013405, Copenhagen, Denmark, 1990. Springer-Verlag."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48294-6_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:58:54Z","timestamp":1556737134000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48294-6_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540664598","9783540482949"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48294-6_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}