Toward a Complete Transformational Toolkit for Compilers

ACM Transactions on Programming Languages and Systems

Volumn 19, Issue 5, 1997, Pages 639-684

  Bergstra, J A ^a   Dinesh, T B ^b   Field, J ^c   Heering, J ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b CWI   (Netherlands)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL LINGUISTICS; DATA STRUCTURES; FORMAL LOGIC; GRAPH THEORY; LOGIC PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; PROGRAM INTERPRETERS;

EQUATIONAL AXIOMATIZATION;

PROGRAM COMPILERS;

EID: 0031223628     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/265943.265944     Document Type: Article

References (52)

1. AMMARGUELLAT, Z. 1992. A control-flow normalization algorithm and its complexity. IEEE Trans. Softw. Eng. 18, 3 (Mar.), 237-251.
2. BALLANCE, R. A., MACCABE, A. B., AND OTTENSTEIN, K. J. 1990. The program dependence Web: A representation supporting control-, data-, and demand-driven interpretation of imperative languages. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 257-271.
3. BARENDREGT, H., VAN EEKELEN, M., GLAUERT, J., KENNAWAY, J., PLASMEIJER, M., AND SLEEP, M. 1987. Term graph rewriting. In Proceedings of the PARLE Conference. Vol. 2: Parallel Languages. Lecture Notes in Computer Science, vol. 259. Springer-Verlag, Berlin, 141-158.
4. BERGSTRA, J. A. AND HEERING, J. 1994. Which data types have ω-complete initial algebra specifications? Theoret. Comput. Sci. 124, 149-168.
5. BERGSTRA, J. A. AND TUCKER, J. V. 1995. The data type variety of stack algebras. Ann. Pure Applied Logic 73, 1 (May), 11-36.
6. BERLIN, A. AND WEISE, D. 1990. Compiling scientific code using partial evaluation. IEEE Comput. 23, 12 (Dec.), 25-36.
7. BOEHM, H.-J. 1985. Side effects and aliasing can have simple axiomatic descriptions. ACM Trans. Program. Lang. Syst. 7, 4 (Oct.), 637-655.
8. BOUDOL, G. 1985. Computational semantics of term rewriting systems. In Algebraic Methods in Semantics, M. Nivat and J. C. Reynolds, Eds. Cambridge University Press, Cambridge, U.K., 169-236.
9. CARTWRIGHT, R. AND FELLEISEN, M. 1989. The semantics of program dependence. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM, New York, 13-27.
10. CHAMBERS, C. AND UNGAR, C. 1989. Customization: Optimizing compiler technology for Self, a dynamically-typed object-oriented programming language. In Proceedings of the ACM SIG-PLAN Conference on Programming Language Design and Implementation. ACM, New York, 146-160.
11. CLICK, C. 1995. Global code motion, global value numbering. In Proceedings of the ACM SIG-PLAN Conference on Programming Language Design and Implementation. ACM SIGPLAN Not. 30, 6. ACM, New York, 246-257.
12. CYTRON, R., FERRANTE, J., ROSEN, B. K., WEGMAN, M. N., AND ZADECK, F. K. 1991. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Program. Lang. Syst. 13, 4 (Oct.), 451-490.
13. DERSHOWITZ, N. AND JOUANNAUD, J.-P. 1990. Rewrite systems. In Handbook of Theoretical Computer Science. Vol. B, Formal Models and Semantics, J. van Leeuwen, Ed. Elsevier/The MIT Press, Amsterdam, 243-320.
14. ERSHOV, A. P. 1982. Mixed computation: Potential applications and problems for study. Theoret. Comput. Sci. 18, 41-67.
15. ERSHOV, A. P. AND OSTROVSKI, B. N. 1987. Controlled mixed computation and its appplication to systematic development of language-oriented parsers. In Program Specification and Transformation, L. G. L. T. Meertens, Ed. North-Holland, Amsterdam, 31-48.
16. FELLEISEN, M. AND FRIEDMAN, D. P. 1989. A syntactic theory of sequential state. Theoret. Comput. Sci. 69, 243-287.
17. FELLEISEN, M. AND HIEB, R. 1992. The revised report on the syntactic theories of sequential control and state. Theoret. Comput. Sci. 103, 235-271.
18. FERRANTE, J., OTTENSTEIN, K. J., AND WARREN, J. D. 1987. The program dependence graph and its use in optimization. ACM Trans. Program. Lang. Syst. 9, 3 (July), 319-349.
19. FIELD, J. 1992. A simple rewriting semantics for realistic imperative programs and its application to program analysis. In Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation. ACM, New York, 98-107. Also available as Yale Univ. Technical Report YALEU/DCS/RR-909.
20. FIELD, J., RAMALINGAM, G., AND TIP, F. 1995. Parametric program slicing. In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages. ACM, New York, 379-392.
21. FRAUS, U. 1994. Inductive theorem proving for algebraic specifications - TIP system user's manual. Tech. Rep. MIP 9401, Univ. of Passau. The TIP system is available at ftp://forwiss.unipassau.de/pub/local/tip.
22. GARLAND, S. AND GUTTAG, J. 1991. A Guide to LP, The Larch Prover. Tech. Rep. 82, DEC Systems Research Center, Palo Alto, Calif. December.
23. HEERING, J. 1985. Variaties op het thema 'stack'. Tech. Rep. CS-N8502, CWI, Amsterdam. In Dutch.
24. HEERING, J. 1986. Partial evaluation and ω-completeness of algebraic specifications. Theoret. Comput. Sci. 43, 149-167.
25. HOARE, C., HAYES, I., JIFENG, H., MORGAN, C., ROSCOE, A., SANDERS, J., SORENSEN, I., SPIVEY, J., AND SUFRIN, B. 1987. Laws of programming. Commun. ACM 30, 8 (Aug.), 672-686. Corrigenda, CACM 30, 9, p. 770.
26. HOARE, C., HAYES, I., JIFENG, H., MORGAN, C., ROSCOE, A., SANDERS, J., SORENSEN, I., SPIVEY, J., AND SUFRIN, B. 1987. Laws of programming. Commun. ACM 30, 8 (Aug.), 672-686. Corrigenda, CACM 30, 9, p. 770.
27. HORWITZ, S., PRINS, J., AND REPS, T. 1988. On the adequacy of program dependence graphs for representing programs. In Proceedings of the 15th ACM Symposium on Principles of Programming Languages. ACM, New York, 146-157.
28. HSIANG, J. AND DERSHOWITZ, N. 1983. Rewrite methods for clausal and non-clausal theorem proving. In Automata, Languages and Programming (10th ICALP), J. Diaz, Ed. Lecture Notes in Computer Science, vol. 154. Springer-Verlag, Berlin, 331-346.
29. JONES, N. D., GOMARD, C. K., AND SESTOFT, P. 1993. Partial Evaluation and Automatic Program Generation. Prentice-Hall, Englewood Cliffs, N.J.
30. KAHN, G. 1987. Natural semantics. In 4th Annual Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 247. Springer-Verlag, Berlin, 22-39.
31. KENNAWAY, J. R., KLOP, J. W., SLEEP, M. R., AND DE VRIES, F. J. 1994. On the adequacy of graph rewriting for simulating term rewriting. ACM Trans. Program. Lang. Syst. 16, 3, 493-523.
32. KLOP, J. W. 1992. Term rewriting systems. In Handbook of Logic in Computer Science. Vol. 2, Background: Computational Structures, S. Abramsky, D. Gabbay, and T. Maibaum, Eds. Oxford University Press, New York, 1-116.
33. LAZREK, A., LESCANNE, P., AND THIEL, J.-J. 1990. Tools for proving inductive equalities, relative completeness, and ω-completeness. Inf. Comput. 84, 47-70.
34. MASON, I. A. AND TALCOTT, C. 1989. Axiomatizing operational equivalence in the presence of side effects. In Proceedings of the 4th IEEE Symposium on Logic in Computer Science. IEEE, New York, 284-293.
35. MEINKE, K. AND TUCKER, J. V. 1992. Universal algebra. In Handbook of Logic in Computer Science. Vol. 1, Background: Mathematical Structures, S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum, Eds. Oxford University Press, New York, 189-411.
36. MESEGUER, J. AND GOGUEN, J. A. 1985. Initiality, induction and computability. In Algebraic Methods in Semantics, M. Nivat and J. C. Reynolds, Eds. Cambridge University Press, Cambridge, U.K., 459-541.
37. MÜLLER, F. 1992. Confluence of the lambda calculus with left-linear algebraic rewriting. Inf. Process. Lett. 41, 293-299. Amended proof available from Inge Bethke (inge@cwi.nl).
38. NAIDICH, D. AND DINESH, T. B. 1996. An automated induction method for verification of PIM - a transformational toolkit for compilers. Tech. Rep. CS-R9630, CWI, Amsterdam, The Netherlands.
39. NIRKHE, V. AND PUGH, W. 1992. Partial evaluation of high-level imperative programming languages with applications in hard real-time systems. In Proceedings of the 19th ACM Symposium on Principles of Programming Languages. ACM, New York, 269-280.
40. ODERSKY, M., RABIN, D., AND HUDAK, P. 1993. Call by name, assignment, and the lambda calculus. In Proceedings of the 20th ACM Symposium on Principles of Programming Languages. ACM, New York, 43-56.
41. PEYTON JONES, S. L. 1987. The Implementation of Functional Programming Languages. Prentice Hall International, Englewood Cliffs, N.J.
42. PLOTKIN, G. D. 1974. The λ-calculus is ω-incomplete. J. Symbol. Logic 39, 2 (June), 313-317.
43. RAMALINGAM, G. AND REPS, T. 1989. Semantics of program representation graphs. Tech. Rep. 900, Computer Sciences Dept., Univ. of Wisconsin, Madison, Wisc. December.
44. SELKE, R. P. 1989a. A rewriting semantics for program dependence graphs. In Proceedings of the 16th ACM Symposium on Principles of Programming Languages. ACM, New York, 12-24.
45. SELKE, R. P. 1989b. Transforming program dependence graphs. Tech. Rep. TR90-131, Dept. of Computer Science, Rice Univ., Houston, Tex. July.
46. SWARUP, V., REDDY, U. S., AND IRELAND, E. 1991. Assignments for applicative languages. In Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture. Lecture Notes in Computer Science, vol. 523. Springer-Verlag, Berlin, 192-214.
47. VAN DEURSEN, A., HEERING, J., AND KLINT, P., Eds. 1996. Language Prototyping: An Algebraic Specification Approach. AMAST Series in Computing. World Scientific, Singapore.
48. WAND, M. AND WANG, Z.-Y. 1990. Conditional lambda-theories and the verification of static properties of programs. In Proceedings of the 5th IEEE Symposium on Logic in Computer Science. IEEE, New York.
49. WEISE, D., CREW, R. F., ERNST, M., AND STEENSGAARD, B. 1994. Value dependence graphs: Representation without taxation. In Proceedings of the 21st ACM Symposium on Principles of Programming Languages. ACM, New York, 297-310.
50. WIRSING, M. 1990. Algebraic specification. In Handbook of Theoretical Computer Science. Vol. B, Formal Models and Semantics, J. van Leeuwen, Ed. Elsevier/The MIT Press, Amsterdam, 675-788.
51. YANG, W., HORWITZ, S., AND REPS, T. 1989. Detecting program components with equivalent behaviors. Tech. Rep. 840, Univ. of Wiconsin, Madison, Wisc. April.
52. YANG, W., HORWITZ, S., AND REPS, T. 1990. A program integration algorithm that accommodates semantics-preserving transformations. In Proceedings of the 4th ACM SIGSOFT Symposium on Software Development Environments. ACM, New York, 133-143.