H. Partsch
- AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass. Google Scholar
- ALBERGA, C. N., BROWN, A. L., LEEMAN, G. B., JR., MIK~LSONS, M., AND WEOMAN, M. N. 1981. A program development tool. In Proceedings of 8th A CM Symposium on Principles of Programming Languages (Williamsburg, Va., Jan. 26-28). ACM, New York, pp. 92-104. Google Scholar
- ARSAC, J. 1974. Languages sans etiquettes et transformations de programmes. In Proceedings o/2d International Colloquium on Automata, Languages, and Programming. Lecture Notes in Computer Science, vol. 14. Springer-Verlag, New York. Google Scholar
- ARSAC, J. 1977a. La Construction de Programmes Structures. Dunod, Paris.Google Scholar
- ARSAC, J. 1977b. Emploi de mi~thodes constructives en programmation. Un dossier: la fonction d'Ackermann. RAIRO Theor. Comput. Sci. 11, 2, 91- 112.Google Scholar
- ARSAC, J. 1978. An interactive program manipulation system for non naive users. LITP Res. Rep. 78-10, Institut de Programmation, Paris.Google Scholar
- ARSAC, J. 1979. Syntactic source to source transforms and program manipulation. Commun. ACM 22, 1 (Jan.), 43-54. Google Scholar
- ARSAC, J., AND KODRAVOrg, Y. 1979. Some methods for transformation of recursive procedures into iterative ones. LITP Res. Rep. 79-2, institut de Programmation, Paris.Google Scholar
- ARSAC, J., AND KODRATOFF, Y. 1982. Some techniques for recursion removal from recursive functions. A CM Trans. Program. Lang. Syst. 4, 2 (Apr.), 295-322. Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- BALZER, R. 1981a. Final report on GIST. Information Science Institute, Univ. of Southern California, Marina del Rey.Google Scholar
- BALZER, R. 1981b. Transformational implementation: An example. IEEE Trans. Softw. Eng. SE- 7, 1, 3-14.Google Scholar
- BALZER, R., GOLDMAN, N., AND WILE, D. 1976. On the transformational implementation approach to programming. In Proceedings o{ 2nd International Conference on Software Engineering (San Francisco, Oct. 13-15). IEEE, New York, pp. 337- 344. Google Scholar
- BALZER, R., GOLDMAN, N., AND WILE, D. 1980. Informality in program specifications. IEEE Trans. Softw. Eng. SE-4, 2, 94-103.Google Scholar
- 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. Google Scholar
- 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. Google Scholar
- BARSTOW, D. R. 1977b. A knowledge base of organization for rules about programming. SIGART Newsl. (ACM) 63, (June), 18-22. Google Scholar
- BARSTOW, D. R. 1977c. A knowledge-based system for automated program construction. Proceedings of the 5th International Join~ Conference on Artificial Intelligence (Cambridge, Mass.). M.I.T., Cambridge, Mass., pp. 382-388.Google Scholar
- BARS?OW, D. R. 1979a. An experiment in knowledge-based automatic programming. Artif lnte!{ 12, 73-119.Google Scholar
- B^RSTOW, D. R. 1979b. The roles of knowledge and deduction in program synthesis. In Proceedings of the 6th International Joint Conference on Arti{icial Intelligence (Tokyo, Aug. 20-23). International Joint Council on Artificial {nte{{igence, Inc., Stanford, Calif., pp. 37-43.Google Scholar
- BARSTOW, D. R. 1979c. On convergence toward a data base of programming rules. Paper distributed at 2ad Program Trans{ormation Workshop (Cambridge, Mass., Sept.).Google Scholar
- BAaSTOW, D. R., AND KANT, E. 1976. Observations on the interaction between coding and efficiency knowledge in the PSi program synthesis system. In Proceedings o/the 2nd International Conference on Software Engineering (San Francisco, Oct. 13-15). IEEE, New York, pp. 19-31. Google Scholar
- BAUER, F. L. 1976. Programming as an evolutionary process. In Language Hierarchies and Inter{aces, F. L. Bauer and K. Samelson, Eds. Lecture Notes in Computer Science, vol. 46. Springer-Verlag, New York, pp. 153-182. Google Scholar
- BAUER, F. L., ANO WOSSNER, H. 1982. Algorithmic Language and Program Development. Springer- Verlag, New York. Google Scholar
- BAUER, F. L., PARTSCH, H., PEPPER, P., AND WOSSNSR, H. 1977. Notes on the project CIP: Outline of a transformation system. TUM-INFO- 7729, Institut ftir Informatik, Technische Univ. Miinchen, Munich, West Germany.Google Scholar
- BAUER, F. L., BROY, M., GNATZ, R., HESSE, W., KRIEG-BROCKNER, B., PART$CH, H., PEPPER, P., AND W6SSNER, H. 1978. Towards a wide spectrum language to support program specification and program development. SIGPLAN Not. (ACM) 13, 12 (Dec.), 15-24. Google Scholar
- BAUER, F. L., BROY, M., DOSCH, W., GEISELBRECH- TINGER, F., HESSE, W., GNATZ, 'R., KRIEG- BROCKNER, B., LAUT, A., MATZNER, T., MOLLER, B., PARTSCH, H., PEPPER, P., SAMEL- SON, K., WmS{NG, M., ANO W0SSNEa, H. 1981a. Report on a wide spectrum language for program specification and development. TUM- 18104, Institut for Informatik, Technische Univ. Mtinchen, Munich, West Germany.Google Scholar
- BAUER, F. L., BROY, M., DOSCH, W., GNATZ, R., KmF. G-BROCKNF. a, B., LAUT, A., LUCKMANN, M., MATZNER, T., MOLLER, B., PARTSCH, H., PEPPER P2, SAMELSON, K., STEINBR1DGGEN, R., WmSING, M., AND WOSSNEa, H. 1981b. Programming in a wide spectrum language: A collection of examples. Sci. Comput. Program. 1, 73- 114.Google Scholar
- BECKMANN, L., HARALDSSON, A., OSKARSSON, 0., AND SANDEWALL, E. 1976. A partial evaluator and its use as a programming tool. Artif Intell. 7, 319-357.Google Scholar
- BIDOIT, M., GRESSE, C., AND GUIHO, G. 1979. A system which synthesizes array'manipulating programs from specifications. In Proceedings o{ 6th International Joint Conference on Artificial Intelligence (Tokyo, Aug. 20-23). International Joint Council on Artificial Intelligence, Inc., Stanford, Calif., pp. 63-65.Google Scholar
- BXERMANN, A. W. 1976. Approaches to automatic programming. In Advances in Computers, vol. 15. Academic Press, New York, pp. 1-63.Google Scholar
- BraD, R. S. 1980. Tabulation techniques for recursive programs. ACM Comput. Surv. 12, 4 (Dec.), 403-417. Google Scholar
- BOYLE, J. M. 1970. A transformational component for programming language grammar. Pep. ANL- 7690, Argonne National Laboratory, Argonne, Ill.Google Scholar
- 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.Google Scholar
- BOYLE, J. M. 1978. Extending reliability: Transformational tailoring of abstract mathematical software. In Proceedings o/Programming Environment for Mathematical So{tware (Pasadena, Calif., Oct. 18-20). ACM, New York, pp. 27-30. Google Scholar
- 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.Google Scholar
- BOYLE, J. M. 1981. Practical applications of program transformation. Unpublished manuscript.Google Scholar
- 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-Holland, New York, pp. 542-546.Google Scholar
- 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.Google Scholar
- BRASS, B., ERHARD, F., HORSCH, A., RIETHMAYER, H.-O., ^No STE{NBRO(}(~EN, R. 1982. CIP-S: An instrument for program transformation and rule generation. TUM-I8211, lnstitut ffir Informatik, Technische Univ. M/inchen, Munich, West Germany.Google Scholar
- 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-Holland, New York, pp. 101-106.Google Scholar
- BRoY, M., PEeeEa, P., AND Wms}NG, M. 1982. On the algebraic definition of programming Innguages. TUM-I8204, Institut for lnformatik, Technishe Univ. M'tmchen, Munich, West Germany.Google Scholar
- BURSTALL, R. M. 1977. Design considerations for a functional programming language. In Proceedings of Infotech State of the Art Conference (Copenhagen). Infotech Ltd., Maidenhead, UK.Google Scholar
- BURSTALL, R. M., AND DARLINGTON, J. 1975. Some transformations for developing recursive programs. In Proceedings o{ International Conference on Reliable Software (Los Angeles). IEEE, New York, pp. 465-472. Google Scholar
- BURSTALL, R. M., AND DARLINGTON, J. 1977. A transformation system for developing recursive programs. J. ACM 24, 1 (Jan.), 44-67. Google Scholar
- BURSTALL, R. M., AND FEATHER, M. S. 1978. Program development by transformation: An overview. In Les {ondements de la progratnmation. Proceedings of Toulo~ CREST Course on Programrning, M. Armirchahy and D. Neel, Eds. IR1A-SEFI, Le Chesnay, France.Google Scholar
- BURSTALL, R. M., McQuEEN, D. B., ANO SANNELLA, D. T. 1980. HOPE: An experimental applicative language. Internal Rep., Dept. of Computer Science, Edinburgh Univ., Scotland.Google Scholar
- CHEATHAM, T. E., JR. 1981. Overview of the Haryard program development system. In Software Engineering Environments, H. H/inke, Ed.Google Scholar
- CHEATHAM, T. E., JR., XND WEGBI~E{T, B. 1972. A laboratory for the study of automatic programruing, In Proceedings o{AFIPS Spring Joint Compurer Conference (Atlantic City, N.J., May 16- 18), vol. 40. AFIPS Press, Reston, Vs., pp. 11-21. Google Scholar
- CHEATHAM, T. E., JR., HOLLOWAY, G. H., ANO TOWNLEY, J.,A. 1979a. Symbolic evaluation and the analysis of programs. IEEE Trans. Soft. Eng. SE-5, 4, 402-417.Google Scholar
- CHEATHAM, T. E., JR., TOWNLEY, J. A., AND HOL- LOWAY, G. H. 1979b. A system for program refinement. In Proceedings of 4th International Conference on Software Engineering (Munich, West Germany, Sept. 17-19). IEEE, New York, pp. 53-62. Google Scholar
- 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, Google Scholar
- CHVSHO, T. 1980. A good~ogram = a structured program + optimization commands. In Informstion Processing 80, $. H. Lavington, Ed. Elsevier North-Holland, New York, pp. 269-274.Google Scholar
- COHEN, D., SWARTOUT, W., AND BALZER, R. 1982. Using symbolic execution to characterize behavior. SIGSOFT Soft. Eng. Notes (ACM) 7, 5 (Dec.) 25-32. Google Scholar
- COUSIN~U, G. 1976. Transformations de programmes iteratifs. In Programmation, B. Robinet, Ed. Dunod, Paris. pp. 53-74.Google Scholar
- DARLINGTON, J. 1972. A semantic approach to automatic program improvement. Ph.D. dissertalion, Dept. of Machine Intelligence, Univ. of Edinburgh, Scotland.Google Scholar
- 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.Google Scholar
- DARLINGTON, J. 1978. A synthesis of several sort programs. Acts Inf. 11, 1, 1-30.Google Scholar
- DM~LIN6TON, J. 1979. Program transformation: An introduction and survey. Comput. Bull. (Dec.), 22-24.Google Scholar
- DARLINGTON, J. 1981a. An experimental program transformation and synthesis system. Artif. Intell. 16, 1-46.Google Scholar
- DARLIN(~TON, 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.Google Scholar
- DARL{NCTON, J., AND BURSTALL, R. M. 1973. A system which automatically improves programs. In Proceedings of 3d International Joint Conference on Artificial Intelligence (Stanford, Calif.). SRI, Menlo Park, Calif., pp. 479-485.Google Scholar
- DARLINGTON, J., AND BORSTALL, R. M. 1976. A system which automatically improves programs. Acta Inf. 6, 41-60.Google Scholar
- DARLINGTON, J., AND FEATHER, M. 1979. A transformational approach to modification. Paper presented at the 25th meeting of IFIP WG 2.1 (Summit, N.J., Apr.). Available from authors.Google Scholar
- DAvis, R., AND KING, J. 1975. An overview of production, systems. STAN-CS-75-524,-Dept. of Computer Science, Stanford Univ., Stanford, Calif.Google Scholar
- DE~, E. 1980. 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.Google Scholar
- DESK, E. 1981. A transformational derivation of a parsing algorithm in a high-level language. IEEE Trans. So/tw. Eng. SE-7, 1, 23-31.Google Scholar
- oE RIW~:RES, J. 1980. The design of an interactive program manipulation system. Master's thesis, Dept. of Computer Science, Univ. of Toronto, Canada.Google Scholar
- DERSHOWlTZ, N. 1980. The evolution of programs. Ph.D. dissertation, Dept. of Applied Mathematies, Weizmann Institute of Science, Rehovot, israel; available as Rep. R-80-1017, Dept. of Compurer Science, Univ. of Illinois, Urbana I11.Google Scholar
- DERSHOWXTZ, 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. Google Scholar
- DERSHOWITZ, N., A~O MANNA, Z. 1975. On automating structured programming. In Proceedings of International Symposium on Proving and Iraproving Programs (Arc-et-Senan, France, July 1- 3). IRIA, Le Chesnay, France.Google Scholar
- DERSHOWITZ, N., ANO MANNA, Z. 1977. The evolution of programs: Automatic program modification. IEEE Trans. Softw. Eng. SE~3, 6, 377-385.Google Scholar
- DEWAR, R. B. K., G~v, A., Ltu, S-C., A~D SCHWARTZ, g. W. 1979a. Programming by refinement as exemplified by the SETL representation sublanguage. A CM Trans. Program. Lang. Syst. 1, 1 (July), 27-49. Google Scholar
- D~WAR, 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.Google Scholar
- DIJKSTRA, E. W. 1976a. Why naive transformation systems are unlikely to work. EWD-636, privately circulated manuscript.Google Scholar
- DIJKSTHA, E. W. 1976b. A Discipline of Programruing. Prentice-Hall, Englewood Cliffs, N.J. Google Scholar
- 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, IRiA, Le Chesnay, France.Google Scholar
- DONZEAU-GOUGE, V., HUET, G., KAHN, G., AND L^NG, B. 1980. Programming environments based on structured editors: The MENTOR Experience. Res. Rep. 26, INRIA, Le Chesnay, France.Google Scholar
- ECL 1974. ECL programmer's manual. TR-23-74, Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass.Google Scholar
- ERHARO, F. 1981. Programmtransformation im CIP System. Notizen zum interaktiven Programmieren 6, GI Fachausschuss 2, GI, Bonn, West Germany.Google Scholar
- EmCKSON, R. W., Ed. 1981. AFFIRM collected papets. Information Science Institute, Univ. Southern California, Marina del Rey.Google Scholar
- ERSHOV, A. P. 1978. On the essence of compilation. In Proceedings of IFIP Working Conference on Formal Description o/Programming Concepts (St. Andrews, Canada, 1977), E. J. Neuhold, Ed. Elsevier North-Holland, New York, pp. 391--420.Google Scholar
- ERSUOV, A. P. 1982. Mixed computation: Potential applications and problems for study. Theor. Comput. Sci. 18, 41-67.Google Scholar
- FEATHr. R, M. S. 1978a. ZAP program transformation system: Primer and user manual. Res. Rep. 54, Dept. of Artificial Intelligence, Univ. of Edinburgh, Scotland.Google Scholar
- FEATHER, M. S. 1978b. Program transformation applied to the telegram problem. In Program Transformations, B. Robinet, Ed. Dunod, Paris, pp. 173-186.Google Scholar
- FF_~THEa, M. S. 1979. A program transformation system. Ph.D. dissertation, Univ. of Edinburgh, Scotland.Google Scholar
- FEATHER, M. 1982a. Mappings for rapid prototyping. SIGSOFT So{tw. Eng. Notes 7, 5 (Dec.) 17- 24. Google Scholar
- FEATHER, M. S. 1982b. A system for assisting program transformation. A CM Trans. Program. Lang. Syst. 4, I (Jan.) 1-20. Google Scholar
- FICKAS, S. F. 1982. Automating the transformational development of software. Ph.D. dissertation, Univ. of California, Irvine. Google Scholar
- GERH~?, S. L. 1980. Complete and recursion induction in current AFFIRM. Affirm-Memo-33- SLG, Information Science Institute, Univ. Southern California, Marina del Rey.Google Scholar
- GERUART, S. L., AND WILR, D.S.'1979. The DELTA experiment: Specification and verification of a multiple-user file updating module. In Proceedings of Specifications of Reliable Software Con{erence (Cambridge, Mass., Apr.). IEEE, New York, pp. 198-211.Google Scholar
- GERRART, S. L., MUSSER, D. R., THOMPSOn, D. H., BAKER, D. A., BATES, R. L., ERICKSON, R. W., LO~OON, R. L., TAYLOR, D. G., ANO W~re, 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.Google Scholar
- GOAD, C. 1982. Automatic construction of special purpose programs. Rep. STAN-CS-82-897, Dept. of Computer Science, Stanford Univ., Stanford, Calif.Google Scholar
- GOLDMAN, N., AND WILE, D. 1980. A relational data base foundation for process specification. In En- City Relationship Approach to Systems Analysis and Design, P. P. S. Chen, Ed. Elsevier North- Holland, New York. Google Scholar
- GORDON, M. J., MILNER, R., AND WADSWORTH, C. 1977. Edinburgh LCF. Rep. CSR-11-77, Dept. of Computer Science, Edinburgh Univ., Scotland.Google Scholar
- GRrE~, C. 1976. The design of the PSi program synthesis system. In Proceedings o/2d lnternational Conference on So{tware Engineering (San Francisco, Calif., Oct. 13-15). IEEE, New York, pp. 4-18. Google Scholar
- GREEN, C. 1977. A summary of the PSI program synthesis system. In Proceedings o{ 5th International Joint Conference on Artificial Intelligence (Cambridge, Mass.). M. I. T., Cambridge, Mass., pp. 380-381.Google Scholar
- GR~.EN, 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.Google Scholar
- GREr~, C., ANO BARSTOW, D. 1975. Some rules for the automatic synthesis of programs. In Advance Papers o{ the 4th International Joint Conference on Artificial InteUigence (Tbilisi, Georgia, USSR, Sept. 3-8). International Joint Council on Artificial Intelligence, Inc., Stanford, Calif.Google Scholar
- 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.Google Scholar
- GREEN, C., AND BARSTOW, D. 1978. On program synthesis knowledge. Arti{. InteU. 10, 241-279.Google Scholar
- GREEN, C., GABRIEL, R. P., KANT, E., KEDZIERSKI, B. J., McCoNE, B. R., PHILLIPS, J. V., TAPPEL, S. T., ANO WESTFOLO, 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.Google Scholar
- GREEN, C., PHILIPS, J., WESTFOLD, S., PRESSBUR- GER, 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, Paid Alto, Calif.Google Scholar
- Gumo, G., GRESSE, C., AND BIOOiT, M. 1980. Conception et certification de programmes a partir d'une dL~mposition par les donates. RAIRO Inf. 14, 4, 319-351.Google Scholar
- HARALOSSON, A. 1974. PCDB--A procedure generator for a predicate calculus data base. In Information Processing 74. Elsevier North-Holland, New York, pp. 375-379.Google Scholar
- HARALDSSON, A. 1977. A program manipulation system based on partial evaluation. Ph.D. dissertation, Dept. of Mathematics, Linkoping Univ., Sweden.Google Scholar
- HARALOSSOS, A. 1978. A partial evaluator and its use for compiling iterative statements in LISP. In Proceedings of 5th Annual Symposium on Principtes of Programming Languages (Tucson, Ariz., Jan. 23-25). ACM, New York, pp. 195-202. Google Scholar
- HESSE, W. 1981. Methoden und Werkzeuge zur Software-Entwicklung: Einordnu ng und Oberblick. In Werkzeuge der Programmiertechnik, G. Coos, Ed., Informatik-Fachberichte, vol. 43. Springer, New York, pp. 113-153. Google Scholar
- HEWITT, C. 1971. Deseiption 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.Google Scholar
- HtJET, G., AND LANe, B. 1978. Proving and applying program transformations expressed with secondorder patterns. Acta Inf. 1 t, 31-55.Google Scholar
- HCmm, H., Ed. 1981. Software Engineering Environments. Elsevier North-Holland, New York.Google Scholar
- IGARASHI, S., LONDON, R. L., AND LUCKHAM, D. C. 1975. Automatic program verification h Logical basis and its implementation. Acts Inf. 4, 145- 182.Google Scholar
- KANT, E. 1977. The selection of efficient implemen. tations 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.)/ SIGART Newsl. (ACM) 64 (Aug.), 140-156. Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- KIBLER, D. F. 1978. Power, efficiency, and correctness of transformation systems. Ph.D. dissertation, Univ. of California, {rvine. Google Scholar
- 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.)/SIGART Newsk (ACM) 64 (Aug.), 163-173. Google Scholar
- KNUTH, D. E. 1974. Structured programming with goto statements. ACM Comput. Surv. 6, 4 (Dec.), 261-301. Google Scholar
- KOENIC,, 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-818.Google Scholar
- KOTr, L. 1978. About a transformation system: A theoretical study. In Program Transformations, B. Robinet, Ed. Dunot, Paris.Google Scholar
- KoTr, L. 1982. Unfold/fold program transformations. Res. Rep. 155, INRIA Centre de Rennes, France.Google Scholar
- LEE, S., ERW~SON, R. W., AND GERHART, S. L. 1981. Finding a design error in a distributed system: A case study. In Proceedings of IEEE Symposium on Reliability in Distributed Software and Database Systems (Pittsburgh, Pa., July 21- 22). IEEE Computer Society, Los Alamitos, Calif.Google Scholar
- LONDON, P., aND FEATHER, M. 1982. Implementing specification freedoms. Res. Rep. 81-100, Information Science Institute, Univ. of Southern California, Marina del Rey.Google Scholar
- LOVEMAN, D. B. 1977. Program improvement by source-to-source transformation. J. ACM 24, 1 (Jan.) 121-145. Google Scholar
- LOVEMAN, I)., AND FANEUF, 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. Google Scholar
- Low, J. R. 1978. Automatic data structure selection: An example and overview. Commun. ACM 21, 5 (May) 376-385. Google Scholar
- LUCKMANN, M. 1979. CIP-Baummodul (Benutzeranleitung). Report, Institut for Informatik, Technische Univ. Miinchen, Munich, West Germany.Google Scholar
- MAHER, B., AND gLEEMAN, D. H. 1983. Automatic program improvement: Variable usage transformations. ACM Trans. Program. Lang. Syst. 5, 2 (Apr,) 236-264. Google Scholar
- MANNA, Z., AND WALDINGER, R. 1975. Knowledge and reasoning in program synthesis. Artif. Intell. 6, 2, 175-208.Google Scholar
- 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.)/ SIGART Newsl. (ACM) 64 (Aug.), 29-36. Google Scholar
- 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, Mass., Aug. 22-25). M. I. T., Cambridge, Mass., pp. 405- 411.Google Scholar
- MANNA, Z., AND WALDINGER, R. 19780. 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. Google Scholar
- MANNA, Z., AND WALDINGER, R. 1978b. DEDALUS--The DEDuctive Algorithm Ur-synthesizer. In Proceedings of National Computer Conference (Anaheim, Calif., June 5-8), vol. 47. AFIPS Press, Reston, Va., pp. 683-690.Google Scholar
- MANNA, Z., AND WALDINGER, R. 1979. Synthesis: Dreams ~ Programs. IEEE Trans. So{tw. Eng. SE.5, 4, 294-328.Google Scholar
- MANNA, Z., A~D WALDINC, ER, R. 1980. A deductive approch to program synthesis. A CM. Trans. Program. Lang. Syst. 2, I (Jan.), 90-121. Google Scholar
- MANNA, Z., AND WALDINGER, R. 1981. Deductive synthesis of the unification algorithm. Sc~ Comput. Program. I, 5-48.Google Scholar
- 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). $IGPLAN Not. (ACM) 12, 8 (Aug.)-SIGART Newel. (ACM) 64 (Aug.), 130- 139. Google Scholar
- 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. Google Scholar
- M~Li:SE, B. 1981. MENTOR: L'environnement PASCAL. Tech. Rep. 5, INRIA Centre de Roquencourt, Le Chesnay, France.Google Scholar
- MICftIE, D., ED. 1979. Expert Systems in the Micro Electronic' Age. University Press, Edinburgh, Scotland.Google Scholar
- MICHIE, D.ED. 1982. Introductory Readings in Expert Systems. Gordon and Breach, New York. Google Scholar
- MOLLER, B., PARTSCH, H., AND PEPPER, P. 1983. Programming with transformations: An overview of the Munich CIP project. Submitted for publication.Google Scholar
- MOOR, I. W., AND DARLINGTON, J. 1981. Formal synthesis of an efficient implementation for an abstract data type. Unpublished manuscript.Google Scholar
- 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. Google Scholar
- MUSSER, D. R. 1979. Abstract data type specification in the AFFIRM system. In Proceedings o! Specifications of Reliable Software (Cambridge, Mass., Apr. 3-5). IEEE, New York, pp. 47-57.Google Scholar
- NEIGHBORS, J, M. 1980. Software construction using components. Ph.D. dissertation, Tech. Rep. 160, Univ. of Calif., lrvine. Google Scholar
- PAIOF., R. 1981. Expression continuity and formal differentiation of algorithms. Rep. LCSR-TR-9, Laboratory for Computing Science Research, Rutgers Univ., New Brunswick, N.J.Google Scholar
- P~or, 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, Eds. Plenum Press, New York.Google Scholar
- PAfGE, R. 1983. Transformational programming-- Application to algorithms and systems. In Proceedings of l Oth A CM Symposium on Principles of Programming Languages (Austin, Tex., Jan. 24-26). ACM, New York, pp, 73-87. Google Scholar
- PAIGE, R., AND KOENIG, S. 1982. Finite differencing of computable expressions. ACM. Trans. Program. Lang. Syst. 4, 3 (July), 402-454. Google Scholar
- PAIOE, R., A~D SCHWARTZ, J. T. 1977. Expression continuity and the formal differentiation of algorithms. In Proceedings of 4th A CM Symposium on Principles of Programming Languages (Los Angeles, Calif., Jan. 17-19). ACM, New York, pp. 58-63. Google Scholar
- PARTSCn, 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.Google Scholar
- PARTSCH, H., AND STEINBROGGEN, R. 1981. A comprehensive survey on program transformation systems. Rep. TUM I8108, Institut ~r Informatik, Technische Univ. Miinchen, Munich, West Germany.Google Scholar
- PErPER, 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. Google Scholar
- PEPrSa, P., Ev. 1984. Program Transformation and Programming Environments. Lecture Notes in Computer Science. Springer-Verlag, New York. To be published. Google Scholar
- RICH, C., AND SHROBE, H. E. 1978. Initial report on a LISP programmer's apprentice. IEEE Trans. Softw. Eng. SE-4, 6.Google Scholar
- R~cH, C., S~mon~., H. E., WA?ERS, R. C. 1979. Overview of the programmer's apprentice. In Proceedings of 6th International Joint Conference on Artificial Intelligence (Tokyo, Aug. 20-23).Google Scholar
- RIETItMAYER, H.-O. 1981. Die Entwicklung der Bedienungskomponente des CIP Systems. Notizen zur interaktiven Programmierung 6, GI-Fachausschuss 2, GI, Bonn, West Germany.Google Scholar
- RUTTER, P. E. 1977. Improving programs by sourceto-source transformations. Ph.D. dissertation, Univ. of Illinois, Urbana. Google Scholar
- SCHONBERG, E., SCHWARTZ, J. T., AND SHARIR, 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. Google Scholar
- SCHON~O, E., SCHWARTZ, J. T., A~D S~ARm, M. 1981. An automatic technique for selection of data representations in SETL programs. ACM Trans. Program. Lang. Syst. 3, 2 (Apr.), 126-143. Google Scholar
- SCHWARTZ, J. T. 1975a. On programming: An interim report of the SETL project. Courant Institute, New York Univ., New York.Google Scholar
- SC,WARTZ, J. T. 1975b. Automatic data structure choice in a language of very high level. Commun. ACM 18, 722-728. Google Scholar
- SCHWARTZ, J. T. 1977. Correct program technology. Courant Computer Rep. 12, Courant Institute, New York Univ., New York.Google Scholar
- SuAmR, M. 1979a. Some observations concerning formal differentiation of set-theoretic expressions. Tech. Rep. 16, Computer Science Dept., Courant Institute, New York Univ., New York.Google Scholar
- SHARIR, M. 1979b. Algorithm derivation by transformations. Tech. Rep. 021, Computer Science Dept., Courant Institute, New York Univ., New York.Google Scholar
- SHARIR, M. 1981. Formal integration: A program transformation technique. Comput. Lang. 6, 35- 46.Google Scholar
- STANDISH, T. A., HARmMAN, D. C., KIe~.Ea, D. F., AND NE{GItBORS, J. M. 1976a. The Irvine program transformation catalogue. Dept. of Infor. marion and Computer Science, Univ. of Califor. nia, Irvine, Calif.Google Scholar
- STANDISH, T. A., KIBLER, D. F., AND NEIGHBORS, J. M. 1976b. Improving and refining transformations by program manipulation. In Proceedings o{ Annual Con{erence, (Houston, Tex., Oct. 20-22). ACM, New York, pp. 509-516. Google Scholar
- STEINBRI~GGEN, R. 1980a. The use of nested scheme parameters in the system CIP. In GI-IO. Jahrestagung Saarbr'ucken, R. Wilhelm, Ed. Informatik Fachberichte, 33. Springer-Verlag, New York. (Extended abstract.) Google Scholar
- STEINBR{)GGEN, R. 1980b. Pre.algorithmic specifications of the system CIP. Part 1. Pep. TUM- I8016, Institut f/Jr Informatik, Technische Univ. Miinchen, Munich, West Germany.Google Scholar
- STEINBROGGEN, R. 1981. The composition of schemes for local program transformation. In Proceedings of 3d Hungarian Computer Science Conference (Budapest, Jan.), M. Arato and L. Varga, Eds. Akademiai Kiado, Budapest, pp. 111- 124.Google Scholar
- STEINBROGGEN, R. 1982. Program development using transformational expressions. Rep. TUM- I8206, Institut flit Informatik, Technische Univ. M(inchen, Munich, West Germany.Google Scholar
- STEINBBOGGEN, R., AND PARTSCH, H. 1984. Mathematical foundation of transformation systems. Tech. Rep., Institut f(ir Informatik, Technische Univ. Miinchen, Munich, West Germany. To appear.Google Scholar
- 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 Iustitute, Univ. of Southern California, Marina del Rey.Google Scholar
- TOWNLEY, J. A. 1981. PDS user's manual. Center for Research in Computing Technology, Harvard Univ., Cambridge, MasS.Google Scholar
- 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. $pringer-Veriag, New York, pp. 381-406. Google Scholar
- 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.Google Scholar
- WATERS, R. C. 1982. The programmer's apprentice: Knowledge based program editing. IEEE Trans. Softw. Eng. SE-8, 1, 1-12.Google Scholar
- W~C~eREIT, 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.Google Scholar
- WILE, D. 198Ia. Program developments as formal objects. USC/ISI Tech. Rep. Information Science Institute, Univ. of Southern California, Marina del Rey.Google Scholar
- WILE, D. 1981b. POPART: Producer of parsers and related tools, system builder's manual. USC/ISI Tech. Rep., Information Science Institute, Univ. of S~)uthern California, Marina del Rey.Google Scholar
- WILE, D., }}ALGER, R., AND GOLDMAN, N. 1977. Automated derivation of program control structure from natural language program descriptions. In Proceedings of Symposium on Artificial Intelligence and Programming Languages (Rochester, N.Y., Aug. 15-17). SIGPLAN Not. (ACM) 12, 8 (Aug.)-SIGART Newsl. (ACM) 64 (Aug.), 77-84. Google Scholar
Recommendations
Un programme universel de dépouillement intelligent de documents librement structurés
RIAO '04: Coupling approaches, coupling media and coupling languages for information retrievalLa Chaîne de Traitement LADS permet de traiter tout type de document librement structuré pour en extraire tout type de données. Le langage DSL permet la Description de la Structure Logique du type de document de l'application paramétrée, ainsi que la ...
Comments