Computer-unterstützter Algorithmenentwurf

Einige wesentliche Ideen, die in den letzten 15 Jahren fur den Computer-unterstutzten Algorithmenentwurf erarbeitet und z.T. in experimentellen Systemen verwirklicht wurden, werden an Hand von einfachen, aber ausfuhrlichen Beispielen erklart.

[1]  John Michael Robson,et al.  The Height of Binary Search Trees , 1979, Aust. Comput. J..

[2]  David R. Musser,et al.  Abstract Data Type Specification in the Affirm System , 1980, IEEE Transactions on Software Engineering.

[3]  Friedrich L. Bauer,et al.  Algorithmic Language and Program Development , 1982, Texts and Monographs in Computer Science.

[4]  John Darlington,et al.  A Transformation System for Developing Recursive Programs , 1977, J. ACM.

[5]  David R. Musser,et al.  An Overview of AFFIRM: A Specification and Verification System , 1980, IFIP Congress.

[6]  David R. Musser,et al.  On proving inductive properties of abstract data types , 1980, POPL '80.

[7]  Robert A. Kowalski,et al.  Logic for problem solving , 1982, The computer science library : Artificial intelligence series.

[8]  Helmuth Partsch,et al.  A Family of Rules for Recursion Removal , 1976, Inf. Process. Lett..

[9]  Chris Goad,et al.  Automatic Construction of Special Purpose Programs , 1982, CADE.

[10]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[11]  B. Krieg-Brückner,et al.  Towards a wide spectrum language to support program specification and program development , 1978, SIGP.

[12]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[13]  David C. Luckham,et al.  Automatic program verification III: a methodology for verifying programs. , 1974 .

[14]  Steven M. German,et al.  Stanford Pascal Verifier user manual , 1979 .

[15]  John Darlington,et al.  A system which automatically improves programs , 1973, Acta Informatica.

[16]  Zohar Manna,et al.  Synthesis: Dreams - Programs , 1979, IEEE Trans. Software Eng..

[17]  Robert S. Boyer,et al.  Computational Logic , 1990, ESPRIT Basic Research Series.

[18]  Zohar Manna,et al.  A Deductive Approach to Program Synthesis , 1979, TOPL.

[19]  Wolfgang Hesse.  Methoden und Werkzeuge zur Software-Entwicklung - Ein Marsch durch die Technologie-Landschaft , 1981, Inform. Spektrum.

[20]  Ben Wegbreit,et al.  Heuristic Methods for Mechanically Deriving Inductive Assertions , 1973, IJCAI.

[21]  D. McIlroy.  Algebraic Simplification , 1966, CACM.

[22]  Friedrich L. Bauer,et al.  Program Development by Stepwise Transformations - The Project CIP. Appendix: Programming Languages under Educational and under Professional Aspects , 1978, Program Construction.

[23]  H. Brown,et al.  Computational Problems in Abstract Algebra , 1971 .

[24]  Bruno Buchberger,et al.  A criterion for detecting unnecessary reductions in the construction of Groebner bases , 1979, EUROSAM.

[25]  Norihisa Suzuki.  Verifying programs by algebraic and logical reduction , 1975 .

[26]  Zohar Manna,et al.  Knowledge and Reasoning in Program Synthesis , 1974, IJCAI.

[27]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[28]  Wolfgang Bibel,et al.  Syntax-Directed, Semantics-Supported Program Synthesis , 1979, Artif. Intell..

[29]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[30]  Zohar Manna,et al.  The Logic of Computer Programming , 1978, IEEE Transactions on Software Engineering.