{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T07:05:10Z","timestamp":1748070310820},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540610557"},{"type":"electronic","value":"9783540499428"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61055-3_31","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:14:40Z","timestamp":1330290880000},"page":"92-107","source":"Crossref","is-referenced-by-count":3,"title":["A complete transformational toolkit for compilers"],"prefix":"10.1007","author":[{"given":"J. A.","family":"Bergstra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. B.","family":"Dinesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Field","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Heering","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1109\/32.126773","volume":"18","author":"Z. Ammarguellat","year":"1992","unstructured":"Ammarguellat, Z. A control-flow normalization algorithm and its complexity. IEEE Transactions on Software Engineering 18, 3 (March 1992), 237\u2013251.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Ballance, R. A., Maccabe, A. B., and Ottenstein, K. J. The program dependence Web: A representation supporting control-, data-, and demand-driven interpretation of imperative languages. In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (White Plains, NY, June 1990), pp. 257\u2013271.","DOI":"10.1145\/93548.93578"},{"key":"6_CR3","first-page":"141","volume-title":"vol. 259 of Lecture Notes in Computer Science","author":"H. Barendregt","year":"1987","unstructured":"Barendregt, H., van Eekelen, M., Glauert, J., Kennaway, J., Plasmeijer, M., and Sleep, M. Term graph rewriting. In Proc. PARLE Conference, Vol. II: Parallel Languages (Eindhoven, The Netherlands, 1987), vol. 259 of Lecture Notes in Computer Science, Springer-Verlag, pp. 141\u2013158."},{"key":"6_CR4","volume-title":"Report CS-R9601","author":"J. Bergstra","year":"1996","unstructured":"Bergstra, J., Dinesh, T., Field, J., and Heering, J. A complete transformational toolkit for compilers. Report CS-R9601, CWI, Amsterdam, January 1996; also Report RC 20342, IBM T.J. Watson Reseach Center, January 1996."},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(94)90057-4","volume":"124","author":"J. Bergstra","year":"1994","unstructured":"Bergstra,J., and Heering, J. Which data types have \u03c9-complete initial algebra specifications? Theoretical Computer Science 124 (1994), 149\u2013168.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"6_CR6","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/4472.4474","volume":"7","author":"H.-J. Boehm","year":"1985","unstructured":"Boehm, H.-J. Side effects and aliasing can have simple axiomatic descriptions. ACM Trans. on Programming Languages and Systems 7,4 (October 1985), 637\u2013655.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Cartwright, R., and Felleisen, M. The semantics of program dependence. In Proc. ACM SIGPLAN Conference on Programming Language Design and Implementation (Portland, OR, June 1989), pp. 13\u201327.","DOI":"10.1145\/73141.74820"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Click, C. Global code motion, global value numbering. In Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation (La Jolla, CA, June 1995), pp. 246\u2013257. Published as ACM SIGPLAN Notices 30(6).","DOI":"10.1145\/207110.207154"},{"issue":"4","key":"6_CR9","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R. Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B. K., Wegman, M. N., and Zadeck, F. K. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. on Programming Languages and Systems 13, 4 (October 1991), 451\u2013490.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Dershowitz, N., and Jouannaud, J.-P. Rewrite systems. In Handbook of Theoretical Computer Science, Vol. B, Formal Models and Semantics, J. van Leeuwen, Ed. Elsevier\/The MIT Press, 1990, pp. 243\u2013320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(89)90069-8","volume":"69","author":"M. Felleisen","year":"1989","unstructured":"Felleisen, M., and Friedman, D. P. A syntactic theory of sequential state. Theoretical Computer Science 69 (1989), 243\u2013287.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"6_CR12","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1145\/24039.24041","volume":"9","author":"J. Ferrante","year":"1987","unstructured":"Ferrante, J., Ottenstein, K. J., and Warren, J. D. The program dependence graph and its use in optimization. ACM Trans. on Programming Languages and Systems 9, 3 (July 1987), 319\u2013349.","journal-title":"ACM Trans. on Programming Languages and Systems"},{"key":"6_CR13","unstructured":"Field, J. A simple rewriting semantics for realistic imperative programs and its application to program analysis. In Proc. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (San Francisco, June 1992), pp. 98\u2013107. Published as Yale University Technical Report YALEU\/DCS\/RR-909."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Field, J., Ramalingam, G., and Tip, F. Parametric program slicing. In Proc. Twenty-second ACM Symp. on Principles of Programming Languages (San Francisco, January 1995), pp. 379\u2013392.","DOI":"10.1145\/199448.199534"},{"key":"6_CR15","unstructured":"Fraus, U. Inductive theorem proving for algebraic specifications\u2014TIP system user's manual. Tech. Rep. MIP 9401, University of Passau, 1994. The TIP system is available at URL: ftp:\/\/forwiss.uni-passau.de\/pub\/local\/tip."},{"key":"6_CR16","unstructured":"Garland, S., and Guttag, J. A Guide to LP, The Larch Prover. Tech. Rep. 82, Systems Research Center, DEC, Dec 1991."},{"key":"6_CR17","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0304-3975(86)90173-8","volume":"43","author":"J. Heering","year":"1986","unstructured":"Heering, J. Partial evaluation and \u03c9-completeness of algebraic specifications. Theoretical Computer Science 43 (1986), 149\u2013167.","journal-title":"Theoretical Computer Science"},{"issue":"8","key":"6_CR18","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/27651.27653","volume":"30","author":"C. Hoare","year":"1987","unstructured":"Hoare, C., Hayes, I., Jifeng, H., Morgan, C., Roscoe, A., Sanders, J., Sorensen, I., Spivey, J., and Sufrin, B. Laws of programming. Communications of the ACM 30, 8 (August 1987), 672\u2013686.","journal-title":"Communications of the ACM"},{"key":"6_CR19","unstructured":"Jones, N., Gomard,C., and Sestoft, P. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993."},{"key":"6_CR20","unstructured":"Klop, J. Term rewriting systems. In Handbook of Logic in Computer Science, Vol. II, S. Abramsky, D. Gabbay, and T. Maibaum, Eds. Oxford University Press, 1992, pp. 1\u2013116."},{"key":"6_CR21","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0890-5401(90)90033-E","volume":"84","author":"A. Lazrek","year":"1990","unstructured":"Lazrek, A., Lescanne, P., and Thiel, J.-J. Tools for proving inductive equalities, relative completeness, and \u03c9-completeness. Information and Computation 84 (1990), 47\u201370.","journal-title":"Information and Computation"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Mason. I. A., and Talcott, C. Axiomatizing operational equivalence in the presence of side effects. In Proc. Fourth IEEE Symp. on Logic in Computer Science (Cambridge, MA, March 1989), pp. 284\u2013293.","DOI":"10.1109\/LICS.1989.39183"},{"key":"6_CR23","unstructured":"Meseguer, J., and Goguen, J. Initiality, induction and computability. In Algebraic Methods in Semantics, M. Nivat and J. Reynolds, Eds. Cambridge University Press, 1985, pp. 459\u2013541."},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Odersky, M., Rabin, D., and Hudak, P. Call by name, assignment, and the lambda calculus. In Proc. Twentieth ACM Symp. on Principles of Programming Languages (Charleston, SC, January 1993), pp. 43\u201356.","DOI":"10.1145\/158511.158521"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Swarup, V., Reddy, U., and Ireland, E. Assignments for applicative languages. In Proc. Fifth ACM Conf. on Functional Programming Languages and Computer Architecture (August 1991), vol. 523 of Lecture Notes in Computer Science, Springer-Verlag, pp. 192\u2013214.","DOI":"10.1007\/3540543961_10"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Weise, D., Crew, R., Ernst, M., and Steensgaard, B. Value dependence graphs: Representation without taxation. In Proc. Twenty-First ACM Symp. on Principles of Programming Languages (Portland, OR, January 1994), pp. 297\u2013310.","DOI":"10.1145\/174675.177907"},{"key":"6_CR27","unstructured":"Yang, W, Horwitz, S., and Reps, T. Detecting program components with equivalent behaviors. Tech. Rep. 840, University of Wiconsin-Madison, April 1989."},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Yang, W., Horwitz, S., and Reps, T. A program integration algorithm that accommodates semantics-preserving transformations. In Proc. Fourth ACM SIGSOFT Symp.on Software Development Environments (Irvine, CA, December 1990),pp. 133\u2013143.","DOI":"10.1145\/99277.99290"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems \u2014 ESOP '96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61055-3_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:57Z","timestamp":1605647037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61055-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540610557","9783540499428"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-61055-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}