Program Transformation Systems

ACM Computing Surveys (CSUR)

Volumn 15, Issue 3, 1983, Pages 199-236

  Partsch, H ^a   Steinbruggen R ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

transformation system; Transformational programming

Indexed keywords

COMPUTER PROGRAMMING;

EID: 0020810134     PISSN: 03600300     EISSN: 15577341     Source Type: Journal    
DOI: 10.1145/356914.356917     Document Type: Article

References (184)

1. Aho, A. V., Hopcroft, J. E., and Ullman, J. D., 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.
2. Alberga, C. N., Brown, A. L., Leeman, G. B., Jr., Mikelsons, M., and Wegman, M. N. 1981. A program development tool. In Proceedings of 8th ACM Symposium on Principles of Programming Languages (Williamsburg, Va., Jan. 26-23). ACM, New York, pp. 92-104.
3. Arsac, j. 1974. Languages sans etiquettes et transformations de programmes. In Proceedings of 2d International Colloquium on Automata, languages, and Programming. Lecture Notes in Computer Science, vol. 14. Springer-Verlag, New York.
4. Arsac, J. 1977a. La Construction de Programmes Structures. Dunod, Paris.
5. Arsac, J. 1977b. Emploi de methodes constructives en programmation. Un dossier: la fonction d'Ackermann. RAIRO Theor. Comput. Sci. 11, 2, 91-112.
6. Arsac, J. 1978. An interactive program manipulation system for non naive users. LITP Res. Rep. 78-10, Institut de Programmation, Paris.
7. Arsac, J. 1979. Syntactic source to source transforms and program manipulation. Commun. ACM 22,1 (Jan.), 43-54.
8. Arsac, j., and Kodratoff, Y. 1979. Some methods for transformation of recursive procedures into iterative ones. LITP Res, Rep. 79-2, Institut de Programmation, Paris.
9. Arsac, J., and Kodratoff, Y, 1982. Some techniques for recursion removal from recursive functions. ACM Trans. Program. Lang. Syst. 4, 2 (Apr.), 295-322.
10. Balzer, R. 1973. A global view of automatic programming. In Proceedings of the 3rd International Joint Conference on Artificial Intelligence (Stanford, Calif.), pp. 494-499.
11. Balzer, R. 1977. Correct and efficient software implementation via semi-automatic transformations. USC/ISI Internal Rep., Information Science Institute, Univ. of Southern California, Marina del Rey.
12. Balzer, R. 1981a. Final report on GIST. Information Science Institute, Univ. of Southern California, Marina del Rey.
13. Balzer, R. 1981b. Transformational implementation: An example. IEEE Trans. Softw. Eng. SE-7, 1, 3-14.
14. Balzer, R., Goldman, N., and Wile, D. 1976. On the transformational implementation approach to programming. In Proceedings of 2nd Interna-tioncU Conference on Software Engineering (San Francisco, Oct. 13-15). IEEE, New York, pp. 337-344.
15. Balzer, R., Goldman, N., and Wile, D. 1980. Informality in program specifications. IEEE Trans. Softw. Eng. SE-4, 2, 94-103.
16. Balzer, R. M., Goldman, N. M., and Wile, D. S. 1982. Operational specifications as the basis for rapid prototyping. SIGSOFT Softw. Eng. Notes (ACM) 7, 5 (Dec.), 3-16.
17. Barstow, D. R. 1977a. Automatic construction of algorithms and data structures using a knowledge base of programming rules. Ph.D. dissertation, Stanford Univ., Stanford, Calif.
18. Barstow, D. R. 1977b. A knowledge base of organization for rules about programming, SIGART NewsL (ACM) 63, (June), 18-22.
19. Barstow, D. R., 1977c. A knowledge-based system for automated program construction. Proceedings of the 5th International Joint Conference on Artificial Intelligence (Cambridge, Maas.). M.I.T., Cambridge, Mass., pp. 382-388.
20. BarSTOW, D. R. 1979a. An experiment in knowledge-based automatic programming. Artif. Intell. 12, 73-119.
21. BaeSTOW, D. R. 1979b. The roles of knowledge and deduction in program synthesis. In Proceedings of the 6th International Joint Conference on Artificial Intelligence (Tokyo, Aug. 20-23). International Joint Council on Artificial Intelligence, Inc., Stanford, Calif., pp. 37-43.
22. Barstow, D. R. 1979c. On convergence toward a data base of programming rules. Paper distributed at 2nd Program Transformation Workshop (Cambridge, Mass., Sept.).
23. Bakstow, D. R., and Kant, E. 1976. Observations on the interaction between coding and efficiency knowledge in the PSI program synthesis system. In Proceedings of the 2nd International Conference on Software Engineering (San Francisco, Oct. 13-15). IEEE, New York, pp. 19-31.
24. Bauer, F. L. 1976. Programming aa an evolutionary process. In Language Hierarchies and Interfaces, F. L. Bauer and K. Samelson, Eds. Lecture Notes in Computer Science, vol. 46. Springer-Verlag, New York, pp. 153-182.
25. Baoer, F. L., and WOSSNER, H. 1982. Algorithmic Language and Program Development. Springer-Verlag, New York.
26. Baoer, F. L., Partsch, H., Pepper, P., and WOSSNER, H. 1977. Notes on the project CIP: Outline of a transformation system. TUM-INFO-7729, Institut für Informatik, Technische Univ. Miinchen, Munich, Weat Germany.
27. Bauer, F. L., Broy, M., Gnatz, R., Hesse, W., KRiEG-BRtJCKNER, B., Partsch, H,, Pepper, P., and WOssner, H. 1978. Towards a wide spectrum language to support program specification and program development. SIGPLAN Not. (ACM) 13,12 (Dec.), 15-24.
28. Bauer, F. L., Broy, M., Dosch, W., Geiselbrechtinger, F., Hesse, W., Gnatz, R., Krieg-Bruckner, B., Laut, a., Matzner, T., MOller, B., Partsch, H., Pepper, P., Samelson, K., WiRSING, M,, AND WdSSNER, H. 1981a. Report on a wide spectrum language for program specification and development. TUM-1810 4, Institut für Informatik, Technische Univ. Miinchen, Munich, West Germany.
29. Bauer, F. L., Brov, M., Dosch, W., Gnatz, R., Krieg-BrCtckner, B., Laut, A., Luckmann, M., Matzner, T., MOller, B., Partsch, H., Pepper P, Samelson, K., STEiNBRtiCGEN, R., WiRSING, M., AND WOSSNEH, H. 1981b. Programming in a wide spectrum language: A collection of examples. Sci. Comput. Program. 1, 73-114.
30. Beckmann, L., Haraldsson, A., Oskarsson, O., and Sandewall, E. 1976. A partial evaluator and its use as a programming tool. Artif. InteU. 7, 319-357.
31. Bidoit, M., Gresse, C., and Guiho, G. 1979. A system which synthesizes array-manipulating programs from specifications. In Proceedings of 6th International Joint Conference on Artificial Intelligence (Tokyo, Aug. 20-23). International Joint Council on Artificial Intelligence, Inc., Stanford, Calif., pp. 63-65.
32. Biermann, A. W. 1976. Approaches to automatic programming. In Advanj:es in Computers, vol. IB. Academic Press, New York, pp. 1-63.
33. Bird, R. S. 1980, Tabulation techniques for recursive programs. ACM Comput. Suru. 12, 4 (Dec.), 403-417.
34. Boyle, J. M. 1970. A transformational component for programming language grammar. Rep. ANL-7690, Atgonne National Laboratory, Argonne, III.
35. Boyle, J. M. 1976. An introduction to transformation-assisted multiple program realization (TAMPR) system. In Cooperative Development of Mathematical Software, J. R. Bunch, Ed. Dept, of Mathematics, Univ. of California, San Diego.
36. Boyle, J. M. 1978. Extending reliability: Transformational tailoring of abstract mathematical software. In Proceedings of Programming Environment for Mathematical Software (Pasadena, Calif., Oct, 18-20). ACM, New York, pp. 27-30.
37. Boyle, J. M. 1980. Software adaptability and program transformation. In Software Engineering, H. Freeman and P. M, Lewis, Eds. Academic Press, New York, pp. 75-93.
38. Boyle, J. M. 1981. Practical applications of program transformation. Unpublished manuscript.
39. Boyle, J. M., and Dritz, K. W. 1974. An automated programming system to facilitate the development of quality mathematical software. In Information Processing 74. Elsevier North-Hol-land, New York, pp. 542-546.
40. Boyle, J. M., and Matz, M. 1977. Automating multiple program realizations. In Proceedings of the MRI Symposium. Computer Software Engineering, vol. 24. Polytechnic Press, Brooklyn, N.Y., pp. 421-456.
41. Brass, B., Erhard, F., Hohsch, A., Riethmayer, H.-O., and SteinbrOgoen, R. 1982. CIP-S: An instrument for program transformation and rule generation. TUM-I8211, Institut für Informatik, Technische Univ. Miinchen, Munich, West Germany.
42. Broy, M., Partsch, H., Pepper, P., and Wirsing, M. 1980. Semantic relations in programming languages. In Information Processing 80, S. H. Lavington, Ed. Elsevier North-HoUand, New York, pp. 101-106.
43. Broy, M., Pepper, P., and Wirsing, M. 1982. On the algebraic definition of programming languages. TUM-18204, Institut für Informatik, Technishe Univ. Miinchen, Munich, West Germany.
44. Buestall, R. M. 1977. Design considerations for a functional programming language. In Proceedings of Infotech State of the Art Conference (Copenhagen). Infotech Ltd., Maidenhead, UK.
45. Burstall, R. M., and Darlington, J. 1975. Some transformations for developing recursive programs. In Proceedings of International Conference on Reliable Software (Los Angeles). IEEE, New York, pp. 465-472.
46. Burstali, R. M., and Darlington, J. 1977. A transformation system for developing recursive programs. J. ACM 24,1 (Jan.), 44-67.
47. Burstali., R. M., and Feather, M. S. 1978. Program development by transformation: An overview. In Les fandements de la programrmtion. Proceedings of Toulouse CREST Course on Programming, M. Armirchahy and D. Neel, Eds. IRIA-SEFI, Le Chesnay, France.
48. Burstall, R. M., McQueen, D. B., and Sannella, D. T. 1980. HOPE: An experimental applicative language. Internal Rep., Dept, of Computer Science, Edinburgh Univ., Scotland.
49. Cheatham, T. E., Jr. 1981. Overview of the Harvard program development system. In Software Engineering Enuironments, H. Hiinke, Ed.
50. Cheatham, T. E., Jr., and Wegbeeit, B. 1972. A laboratory for the study of automatic programming, In Proceedings ofAFIPS Spring Joint Computer Conference (Atlantic City, N.J., May 1618), vol. 40. ATIPS Press, Eeston, Va., pp. 11-21.
51. Cheatham, T.E.J., Holloway, G. H., and TowNLEY, J.A. 1979a. Symbolic evaluation and the analysis of programs. IEEE Trans. Soft. Eng. SE-5, 4, 402-417.
52. Cheatham, T.E.J., Townley, J. A., and Holloway, G. H. 1979b. A system for proam refinement. In Proceedings of 4th International Conference on Software Engineering (Munich, West Germany, Sept. 17-19). EEEE, New York, pp. 53-62.
53. Cheatham, T. E., Jr. Holloway, G. H., and Townley, J. A. 1981. Program refinement by transformation. In Proceedings of 5th International Conference on Software Engineering (San Diego, Calif., Mar. 9-12). IEEE, New York, pp. 430-437.
54. Chusho, T. 1980. A good'piogram = a structured program optimization commands. In Information Processing SO, S. H. Lavington, Ed. Elsevier North'Holland, New York, pp. 269-274.
55. Cohen, D., Swartout, W., and Balzer, R. 1982. Using symbolic execution to characterize behavior. SIGSOFT Soft. Eng. Notes (ACM) 7, 5 (Dec.) 25-32.
56. COUSINEAU, G. 1976. Transformations de programmes iteratifs. In Programmation, B. Robinet, Ed. Dvmod, Paris, pp. 53-74.
57. Darlington, J. 1972. A semantic approach to automatic program improvement. Ph.D. dissertation, Dept, of Machine Intelligence, Univ. of Edinburgh, Scotland.
58. Darlington, J. 1975. Applications of program transformation to program synthesis. In Proceedings of International Symposium on Proving and Improving Programs (Arc-et-Senans, France, July 1-3). IRIA, Le Chesnay, France, pp. 133 144.
59. Darlington, J. 1978. A synthesis of several sort programs. Acta Inf 11,1, 1-30.
60. Darlington, J. 1979. Program transformation; An introduction and survey. Comput. Bull. (Dec.), 22-24.
61. Darlington, J. 1981a. An experimental program transformation and synthesis system. Artif. In-telL J6,1-46.
62. Darlington, J. 1981b. The structured description of algorithm derivations. In Algorithmic Languages, J. W. deBakker and H. van Vliet, Eds. Elsevier North-Holland, New York, pp. 221-250.
63. Darlington, J., and Burstall, R, M. 1973. A system which automatically improves programs. In Proceeditgis of 3d International Joint Conference on Artificial Intelligence (Stanford, Calif.). SRI, Menlo Park, Calif., pp. 479-485.
64. Darlington, J., and Burstall, R. M. 1976. A system which automatically improves programs. Acta Inf. 6, 41-60.
65. Darlington, J., and Feather, M. 1979. A transformational approach to modification. Paper presented at the 25th meeting of IPIP WG 2.1 (Summit, N.J., Apr.). Available from authors.
66. Davis, R., and King, J. 1975. An overview of production, systems. STAN-CS-75-524, -Dept, of Computer Science, Stanford Univ., Stanford, Calif.
67. Deak, B. 1950. A transformational approach to the development and unification of programs in a very high level language. Courant Computer Science Rep, 22, Courant Institute, New York Univ., New York.
68. Deak, E. 1981, A transformational derivation of a parsing algorithm in a high-level language. IEEE Trans. Softw. Eng. SE-7,1, 23-31.
69. DE RiVlfeRES, J. 1980. The design of an interactive program manipulation system. Master's thesis, Dept, of Computer Science, Univ. of Toronto, Canada.
70. Dershowitz, N. 1980. The evolution of programs. Ph.D. dissertation. Dept, of Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel; available as Rep. R-80-1017, Dept, of Computer Science, Univ. of Illinois, Urbana 111.
71. Dershowitz, N. 1981. The evolution of programs: Program abstraction and instantiation. In Proceedings of 5th International Conference on Software Engineering (San Diego, Calif., Mar. 9-12). IEEE, New York, pp. 79-88.
72. Dershowitz, N., and Manna, Z. 1975. On automating structured programming. In Proceedings of International Symposium on Proving and Improving Programs (Arc-et-Senan, France, July 13). IRIA, Le Chesnay, France.
73. Dershowitz, N., and Manna, Z. 1977. The evolution of programs: Automatic program modification. IEEE Trans. Softw. Eng. SE-3,6, 377-385.
74. Dewar, R. B. K., Grand, A., Liu, S-C., and Schwartz, J. T. 1979a. Programming by refinement as exemplified by the SETL representation sublanguage. ACM Trans. Program. Lang. Syst. 1,1 (July), 27-49.
75. Dew AH, R. B. K., Sharir, M., and Weixelbaum, E. 1979b. On transformational construction of garbage collection algorithms. Paper presented at the 26th meeting of IFIP WG 2.1 (Brussels, Dec.). Available from authors.
76. Dijkstka, E. W. 1976a. Why naive transformation systems are unlikely to work. EWD-636, privately circulated manuscript.
77. Dijkstha, E. W. 1976b. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, N.J.
78. Donzeau-Gouge, V., Huet, G., Kahn, G., Lang, B., AND Levy, J. J. 1975. A structure oriented program editor: A first step towards computer assisted programming. In Proceedings of International Computing Symposium 1975 (Antibes, France). Also, Lab. Rep. 114, lEIA, Le Chesnay, France.
79. Donzeau-Gouge, V., Huet, G., Kahn, G., and Lang, B. 1980. Programming environments based on structured editors: The MENTOR Experience. Res. Rep. 26, INRIA, Le Chesnay, France.
80. ECL 1974. ECL programmer's manual. TR-23-74, Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass.
81. Erhard, F. 1981. Programmtransformation im CIP System. Notizen zum interaktiven Programmieren 6, GI Fachausschuss 2, GI, Bonn, West Germany.
82. Erickson, R. W., Ed. 1981. AFFIRM collected papers. Information Science Institute, Univ. Southern California, Marina del Rey.
83. Ershov, A. P. 1978. On the essence of compilation. In Proceedings of IFIP Working Conference on Formal Description of Programming Concepts (St. Andrews, Canada, 1977), E. J. Neuhold, Ed. Elsevier North-Holland, New York, pp. 391-420.
84. Ershov, A. P. 1982. Mixed computation: Potential applications and problems for study. Tkeor. Corn-put. Sci. 18, 41-67.
85. Feather, M. S. 1978a. ZAP program transformation system: Primer and user manual. Res. Rep. 54, Dept, of Artificial Intelligence, Univ. of Edinburgh, Scotland.
86. Feather, M. S., 1978b. Program transformation applied to the telegram problem. In Program Transformations, B, Robinet, Ed. Dunod, Paris, pp. 173-186.
87. Feather, M. S. 1979. A program transformation system. Ph.D. dissertation, Univ. of Edinburgh, Scotland.
88. Feather, M. 1982a. Mappings for rapid prototyping. SIGSOFT Softw. Eng. Notes 7, 5 (Dec.) 1724.
89. Feather, M. S. 1982b. A system for assisting program transformation. ACM Trans. Program. Lang. Syst. 4, 1 (Jan.) 1-20.
90. Fickas, s. F. 1982. Automating the transformational development of software. Ph.D. dissertation, Univ. of California, Irvine.
91. Gerhart, S. L. 1980. Complete and recursion induction in current AFFIRM. Affirm-Memo-33-SLG, Information Science Institute, Univ. Southern California, Marina del Rey.
92. Gerhart, S. L., and Wile, D. S. 1979. The DELTA experiment: Specification and verification of a multiple-user file updating module. In Proceedings of Specifications of Reliable Software Conference (Cambridge, Mass., Apr.). IEEE, New York, pp. 198-211.
93. Gerhart, S. L., Musser, D. R., Thompson, D. H., Baker, D. A., Bates, R. L., Erickson, R. W., London, R. L., Taylor, D. G., and Wile, D. S. 1980. On overview of AFFIRM: A specification and verification system. In Information Processing 80, S. H. Lavington, Ed. Elsevier North-Holland, New York, pp. 343-347.
94. Goad, C. 1982. Automatic construction of special purpose programs. Rep. STAN-CS-82-897, Dept, of Computer Science, Stanford Univ., Stanford, Calif.
95. Goldman, N., and Wile, D. 1980. A relational data base foundation for process specification. In Entity Relationship Approach to Systems Analysis and Design, P. P. S. Chen, Ed. Elsevier North-Holland, New York.
96. Gordon, M. J., Milner, R., and Wadsworth, C. 1977. Edinburgh LCP. Rep. CSR-ll-77, Dept, of Computer Science, Edinburgh Univ., Scotland.
97. Green, C. 1976. The design of the PSI program synthesis system. In Proceedings of 2d International Conference on Software Engineering (San Francisco, Calif., Oct. 13-15). IEEE, New York, pp. 4-18.
98. Green, C. 1977, A summary of the PSI program synthesis system. In Proceedings of 5th International Joint Conference on Artificial Intelligence (Cambridge, Mass.). M. I. T., Cambricfee, Mass., pp. 380-381.
99. Green, C, 1978. The PSI program synthesis system 1978: An abstract. In Proceedings of 1978 National Computer Conference (Anaheim, Calif., June 5-8), AFIPS Press, Reston, Va., pp. 673-674.
100. Green, C., and Barstow, D. 1975. Some rules for the automatic synthesis of programs. In Advance Papers of the 4th Internatiomd Joint Conference on Artificial Intelligence (Tbilisi, Georgia, USSR, Sept. 3-8). International Joint Council on Artificial Intelligence, Inc., Stanford, Calif.
101. Green, C., and Barstow, D. 1976. A hypothetical dialogue exhibiting a knowledge base for a program understanding system. In Machine Representations of Knowledge, E. W. Elcock and D. Michie, Eds. Wiley, New York, pp. 335-359.
102. Green, C, and BarStoW, D. 1978. On program synthesis knowledge. Artif Intell. 10, 241-279.
103. Green, C., Gabriel, R. P., Kant, E., Kedzierski, B. J., McCune, B. R., Phillips, J. V., Tappel, S. T., AND Westfold, S. J. 1979. Results in knowledge based program synthesis. In Proceedings of 6th International Joint Conference on Artificial Intelligence (Tokyo, Aug. 20-23). International Joint Council on Artificial Intelligence, Inc. Stanford, Calif., pp. 342-344.
104. Green, C., Philips, J., Westfold, S., PressburGER, T., Kedzierski, B., Angebranndt, s. Mont-Reynaud, B., and Tappel, s. 1982. Research on knowledge-based programming and algorithm design-1981. Rep. Kes. U. 81.2, Kestrel Institute, Palo Alto, Calif.
105. Guiho, G., Gresse, C., and Bidojt, M. 1980. Conception et certification de programmes a partir d'une dmposition par les donnees. RAIRO Inf. 14, 4. 319-351.
106. Haraldsson, a. 1974. PCDB-A procedure generator for a predicate calculus data base. In Information Processing 74. Elsevier North-Holland, New York, pp. 375-379.
107. Haraldsson, A. 1977. A program manipulation system based on partial evaluation. Ph.D. dissertation, Dept, of Mathematics, Linkoping Univ., Sweden.
108. Haraldsson, A. 1978. A partial evaluator and its use for compiling iterative statements in LISP. In Proceedings of 5th Annual Symposium on Principles of Programming Languages (Tucaon, Ariz., Jan. 23-25). ACM, New York, pp. 195-202.
109. Hesse, W. 1981. Methoden und Werkzeuge zuc Software-Entwicklung: Einordnung und Oberblick. In Werkzeuge der Programmiertechnik, G. Goos, Ed., Informatik-Fachberichte, vol. 43. Springer, New York, pp. 113-153.
110. Hewitt, C. 1971. Desciption and theoretical analysis (using schemata) of PLANNER; A language for proving theorems and manipulating models in a robot. Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, Mass.
111. Huet, G., and Lang, B. 1978. Proving and applying program transformations expressed with second-order patterns. Acta Inf 11, 31-55.
112. HCnke, H., Ed. 1981. Software Engineering Environments. Elsevier North-Holland, New York.
113. Igarashi, S., London, R. L., and Luckham, D. C. 1975. Automatic program verification I: Logical basis and its implementation. Acta Inf. 4, 145-182.
114. Kant, E. 1977. The selection of efficient implementations for a high-level language. In Proceedings of 4th ACM Symposium on Artificial Intelligence and Programming Languages (Rochester, N.Y,, Aug. 15-17). SIGPLAN Not. (ACM) 12,8 (Aug.)/ SIGARTNewsL (ACM) 64 (Aug.), 140-156.
115. Kant, E. 1979. A knowledge-based approach to using efficiency estimation in program synthesis. In Proceedings of 6th International Joint Conference on Artificial Intelligence (Tokyo, Aug. 20-23). International Joint Council on Artificial Intelligence, Inc., Stanford, Calif., pp. 457-462.
116. Kant, E., and Barstow, D. R. 1981. The refinement paradigm: The interaction of coding and efficiency knowledge in program synthesis. IEEE Trans. Softw. Eng. 7, 458-471.
117. Kibler, D. F. 1978. Power, efficiency, and correctness of transformation systems. Ph.D. dissertation, Univ. of California, Irvine.
118. Kibler, D. F., Neighbors, J. M., and Standish, T. A. 1977. Program manipulation via an efficient production system. In Proceedings of Symposium on Artificial Intelligence and Programming Languages, (Rochester, N.Y., Aug. 15-17). SIGPLAN Not. (ACM) 12, 8 (Aug.ySIGART NewsL (ACM) 64 (Aug.), 163-173.
119. Knuth, D. E. 1974. Structured programming with goto statements. ACM Comput. Surv. 6, 4 (Dec.), 261-301.
120. Koenig, S., and Paige, R. 1981. A transformational framework for the automatic control of derived data. In Proceedings of 7th International Conference on Very Large Data Bases (Cannes, France, Sept. 9-11). IEEE, New York, pp. 306-318.
121. Kott, L. 1978. About a transformation system: A theoretical study. In Program Transformations.
122. B. Robinet, Ed. Dunot, Paris. Kott, L. 1982. Unfold/fold program transformations. Res. Rep. 155, INRIA Centre de Rennes, France.
123. Lee, s. Erickson, E. W., and Gerhart, S. L. 1981. Finding a design error in a distributed system: A case study. In Proceedings of IEEE Symposium on ReliiAility in Distributed Software and Database Systems (Pittsburgh, Pa., July 2122). IEEE Computer Society, Los Akmitos, Calif.
124. London, P., and Feather, M. 1982. Implementing specification freedoms. Res. Rep. 81-100, Information Science Institute, Univ. of Southern California, Marina del Rey.
125. Loveman, D. B. 1977. Program improvement by source-to-source transformation. J. ACM 24, 1 (Jan.) 121-145.
126. Loveman, D., and Faneup, R. 1975. Program optimization-Theory and practice. In Proceedings of Conference on Programming Languages and Compilers for Parallel and Vector Machines. SIGPLAN Not. 10, 3 (Mar.). 97-102.
127. Low, J. R. 1978. Automatic data structure selection: An example and overview. Commun. ACM 21, 5 (May) 376-385.
128. LuckmANN, M. 1979. CIP-Baummodul (Benutzeranleitung). Report, Institut für Informatik, Technische Univ. Miinchen, Munich, West Germany.
129. Maher, B., and Sleeman, D. H. 1983. Automatic program improvement: Variable usage transformations. ACM Trans. Program. Lang, Syst. 5, 2 (Apr.) 236-264.
130. Manna, Z., and Waldinger, R. 1975. Knowledge and reasoning in program synthesis. Artif. Intell. 6, 2, 175-208.
131. Manna, Z., and Waldinger, R. 1977a. The automatic synthesis of recursive programs. In Proceedings of Symposium on Artificial Intelligence and Programming Languages (Rochester, N.Y., Aug. 15-17). SIGPLAN Not. (ACM) 12, 8 (Aug.)/ SIGARTNewsL (ACM) 64 (Aug.), 29-36.
132. Manna, Z., and Waldinger, R. 1977b. The automatic synthesis of systems of recursive programs. In Proceedings of 5th International Joint Conference on Artificial Intelligence (Cambridge, Maas., Aug. 22-25). M. I. T., Cambridge, Mass., pp. 405-411.
133. Manna, Z., and Waldinger, R. 1978a. The synthesis of structure-changing programs. In. Proceedings of 3rd International Conference on Software Engineering (Atlanta Ga., May 10-12). IEEE, New York, pp. 175-187.
134. Manna, Z., and Waldinger, R. 1978b. DEDALUS-The DEDuctive Algorithm Ut-syn-thesizer. In Proceedings of National Computer Conference (Anaheim, Calif., June 5-8), vol. 47. AFIPS Press, Reaton, Va., pp. 683-690.
135. Manna, Z., and Waldinger, R. 1979. Synthesis: Dreams Programs. IEEE Trans. Softw. Eng. SE-5, 4, 294-328.
136. Manna, Z., and Waldinger, B. 1980. A deductive approch to program synthesis. ACM. Trans. Program. Lang. Syst. 2,1 (Jan.), 90-121.
137. Manna, Z., and Waldinger, R. 1981. Deductive synthesis of the unification algorithm. Sci. Corn-put. Program. J, 5-48.
138. McCune, B. p. 1970. The PSI program model builder: Synthesis of very high-level programs. In Proceedings of Symposium on Artificial Intelligence and Programming Languages (Rochester, N.Y., Aug. 15-17). SIGPLAN Not (ACM) 12, 8 (Axig.)-SIGART Newsl. (ACM) 64 (Aug.), 130 139.
139. McCune, B. p. 1979. Building program models incrementally from informal descriptions. Ph.D. dissertation, STAN-CS-79-772, Computing Science Dept., Stanford Univ., Stanford, Calif.
140. MSlese, B. 1981. MENTOR: L'environnement PASCAL. Tech. Rep. 5, INRIA Centre de Roquencourt, Le Chesnay, France.
141. Michie, D., Ed. 1979. Expert Systems in the Micro Electronic Age. University Press, Edinburgh, Scotland.
142. Michie, D. Ed. 1982. Introductory Readings in Expert Systems. Gordon and Breach, New York.
143. MOller, B., Pahtsch, H., and Pepper, P. 1983. Programming with transformations: An overview of the Munich CIP project. Submitted for publication.
144. Moor, I. W., and Darlington, J. 1981. Formal synthesis of an efficient implementation for an abstract data type. Unpublished manuscript.
145. MOSTOW, D. J. 1981. Mechanical transformation of tasks heuristics into operational procedures. Ph.D. dissertation, Rep, CMU-CS-81-113, Carnegie-Mellon Univ., Pittsburgh, Pa.
146. Musser, D. R. 1979. Abstract data type specification in the AFFIRM system. In Prvceedings of Specifications of Reliable Software (Cambridge, Mass., Apr. 3-5). IEEE, New York, pp. 47-57.
147. Neighbors, J. M. 1980. Software construction using components. Ph.D. dissertation, Tech. Rep. 160, Univ. of Calif., Irvine.
148. Paige, R. 1981. Expression continuity and formal differentiation of algorithms. Rep. LCSR-TR-9, Laboratory for Computing Science Research, Rutgers Univ., New Brunswick, N.J.
149. Paige, R. 1982. Applications of finite differencing to database integrity control and query/transaction optimization. In Advances in Database Theory, vol. 2, J, Minker, J. M. Nicolas, and H. Gallaire, Eda. Plenum Press, New York.
150. Paige, R. 1983. Transformational programming- Application to algorithms and systems, in Proceedings of lOth ACM Symposium on Principles of Programming Languages (Austin, Tex., Jan. 24-26). ACM, New York, pp. 73-87.
151. Paige, R., and Koenig, S. 1982. Finite differencing of computable expressions. ACM. Trans. Program. Lang. Syst. 4, 3 (July), 402-454.
152. Paige, R., and Schwartz, J. T. 1977. Expression continuity and the formal differentiation of algorithms. In Proceedings of 4th ACM Symposium on Principles of Programming Languages (Los Angeles, (ialif., Jan. 17-19). ACM, New York, pp. 58-63.
153. Partsch, H. 1984. The CIP transformation system. In Program Transformation and Programming Environments, Pepper, P., Ed. Lecture Notes in Computer Science. Springer-Verlag. New York, to be published.
154. Partsch, H., and SteinbrCggen, R. 1981. A comprehensive survey on program transformation systems. Rep. TUM 18108, Institut für Informatik, Technische Univ. Miinchen, Munich, West Germany.
155. Pepper, P. 1979. A study on transformational semantics. In Program construction, F. L. Bauer and M. Broy, Eds. Lecture Notes in Computer Science, vol. 69. Springer-Verlag, New York, pp. 322-405.
156. Pepper, P., Ed. 1984. Program Transformation and Programming Environments. Lecture Notes in Computer Science. Springer-Verlag, New York. To be published.
157. Rich, C., and Sheobe, H. E. 1978. Initial report on a LISP programmer's apprentice. IEEE Trans. Softw. Eng. SE-4, 6.
158. Rich, C., Shrobe, H. E., Waters, R. C. 1979. Overview of the progiammer's apprentice. In Proceedings of 6th International Joint Conference on Artificial Intelligence (Tokyo, Aug. 20-23).
159. Riethmayer, H.-O. 1981. Die Bntwicklung der Be-dieaungskomponente des CIP Systems. Notizen ZOT interaktiven Programmierung 6, GI-Fachaua-schuss 2, GI, Bonn, West Germany.
160. Rutter, P. E. 1977. Improving programs by source-to-source transformations. Ph.D. dissertation, Univ. of Illinois, Urbana.
161. ScHONBERG, E., Schwartz, J. T., and Sharib, M. 1979. Automatic data structure selection in SETL. In Proceedings of 6th ACM Symposium on Principles of Programming Languages (San Antonio, Tex., Jan. 29-31). ACM, New York, pp. 197-210.
162. SCHONBERG, E., SCHWAETZ, J. T., AND SHARIR, M. 1981. An automatic technique for selection of data representations in SETL programs. ACM Trans. Program. Lang. Syst. 3, 2 (Apr.), 126-143.
163. Schwartz, J. T. 1975a. On programming: An interim report of the SETL project. Courant Institute, New York Univ., New York.
164. Schwartz, J. T., 1975b. Automatic data structure choice in a language of very high level. Commun. ACM 18, 722-728.
165. Schwartz, J. T. 1977. Correct program technology. Courant Computer Rep. 12, Courant Institute, New York Univ., New York.
166. Shakir, M. 1979a. Some observations concerning formal differentiation of set-theoretic expressions. Tech. Rep. 16, Computer Science Dept., Courant Institute, New York Univ., New York.
167. Sharir, M. 1979b. Algorithm derivation by transformations. Tech. Rep. 021, Computer Science Dept, Courant Institute, New York Univ., New York.
168. Sharir, M. 1981. Formal integration: A program transformation technique. Comput. Lang. 6, 35-46.
169. Standish, T. A., Harbiman, D. C., Kibler, D. F., AND Neighbors, J. M. 1976a. The Irvine program transformation catalogue. Dept, of Information and Computer Science, Univ. of California, Irvine, Calif.
170. Standish, T. A., Kibler, D. F., and Neighbors, J, M. 1976b. Improving and refining transformations by program manipulation. In Proceedings of Annual Conference, (Houston, Tex., Oct. 20-22). ACM, New York, pp. 509-516.
171. SteinbrOggen, R. 1980a. The use of nested scheme parameters in the system CIP. In GI-10. Jahrestagung Saarbrucken, R. Wilhelm, Ed. Informatik Fachberichte, 33. Springer-Verlag, New York. (Extended abstract.)
172. Steinbrcggen, R. 1980b. Pre-algorithmic specifications of the system CIP. Part 1. Rep, TUM-I80I6, Institut für Informatik, Technische Univ. Munchen, Munich, West Germany.
173. Steinbroggen, R. 1981. The composition of schemes for local propam transformation. In Proceedings of 3d Hungarian Computer Science Conference (Budapest, Jan.), M. Arato and L. Varga, Eds. Akademiai Kiado, Budapest, pp. 111-124.
174. Steinbroggen, R. 1982. Program development using transformational expressions. Rep. TUM-18206, Institut für Informatik, Technische Univ. Miinchen, Munich, West Germany.
175. Steinbroggen, R., and Partsch, H. 1984. Mathematical foundation of transformation systems. Tech. Rep., Institut für Informatik, Technische Univ. Miinchen, Munich, West Germany. To appear.
176. Thompson, D. H., Sunshine, C. A., Erickson, R. W., Gerhart, S. L., and Schwabe, D. 1981. Specification and verification of communication protocols in AFFIRM using state transition models. RR-81-88, Information Science Institute, Univ. of Southern California, Marina del Bey.
177. Townley, j, a. 1981. PDS user's manual. Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass.
178. Townley, J. A. 1982. The use of transformations to implement an algorithm. In Proceedings of International Symposium on Programming (Turin, Italy, Apr. 6-8). Lecture Notes in Computer Science, vol. 137. Springer-Verlag, New York, pp. 381-406.
179. Waldinger, R. j. 1977. Achieving several goals simultaneously. In Machine Representations of Knowledge, Machine Intelligence, vol. 8, E. W. Elcock and D. Michie, Eds. Ellis Horwood, Chichester, England, pp. 94-136.
180. Waters, R. C. 1982. The programmer's apprentice; Knowledge based program editing. IEEE Trans. Softw. Eng. SE-8, 1, 1-12.
181. WegbrEIT, B. 1971. The ECL programming system. In Proceedings of AFIPS Fall Joint Computer Conference (Las Vegas, Nev., Nov. 16-18), vol. 39. AFIPS Press, Reston, Va., pp. 253-262.
182. Wile, D. 1981a. Program developments as formal objects. USC/ISI Tech. Rep. Information Science Institute, Univ. of Southern California, Marina del Rey.
183. Wile, D. 1981b. POPART: Producer of parsers and related tools, system builder's manual. USC/ISI Tech. Rep., Information Science Institute, Univ. of Southern California, Marina del Rey.
184. Wile, D., Balzer, R., and Goldman, N. 1977. Automated derivation of program control structure from natural language program descriptions. In Proceedings of Symposium on Artificial InteUi-gence and Programming Languages (Rochester, N.Y., Aug. 15-17). SIGPLANNot. (ACM) 12, 8 (Aug.)-SIGART Newsl. (ACM) 64 (Aug.), 77-84.