Skip to main content
SpringerLink
Log in

Computer-Unterstützter Algorithmenentwurf

  • Conference paper
Künstliche Intelligenz

Part of the book series: Informatik-Fachberichte ((2252,volume 59))

Zusammenfassung

Einige wesentliche Ideen, die in den letzten 15 Jahren für den Computer-unterstützten Algorithmenentwurf erarbeitet und z.T. in experimentellen Systemen verwirklicht wurden, werden an Hand von einfachen, aber ausführlichen Beispielen erklärt.

Unterstützt vom österr. Fonds zur Förderung der wissenschaftlichen Forschung (Projekt Nr. 4567).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. Aho A.H., Hopcroft J.E., Ullman J.D. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass. (1974).

    MATH  Google Scholar 

  2. Bauer F.L. A Philosophy of Programing. Lecture Notes, University of London (1973) (appeared in LN in Computer Science, Vol.46, Springer, Berlin, 1976).

    Google Scholar 

  3. Bauer F.L. Program Development by Stepwise Transformations - The Project CIP. In: Program Construction (F.L.Bauer, M.Broy ed.), Lecture Notes of an Internat. Summer School, Marktoberdorf, Lecture Notes in Computer Science, Vol.69, Springer, Berlin (1979).

    Chapter  Google Scholar 

  4. Bauer F.L., Broy M., Gnatz R., Hesse W., Krieg-Brückner B., Partsch H., Pepper P., Wössner H. Towards a Wide Spectrum Language to Support Program Specification and Program Development. ACM SIGPLAN Notices, Vol.13/12, 12–24, (also in: Program Construction, F.L. Bauer, M.Broy ed., LN in Computer Science, Vol.69, Springer, 543–552 (1978).

    Google Scholar 

  5. Bauer F.L., Wössner H. Algorithmic Language and Program Development. Prentice Hall International, London (1979).

    Google Scholar 

  6. Bibel W. Syntax-Directed, Semantics-Supported Program-Synthesis. Artificial Intelligence 14, 243–261 (1980).

    Article  Google Scholar 

  7. Bibel W., Hornig K.M. LOPS- A System Based on a Strategical Approach to Program Synthesis. In: Automatic Program Construction Techniques, A. Biermann, G. Guiho, I. Kodratoff ed., MacMillan, im Druck.

    Google Scholar 

  8. Biermann A., Guiho G., Kodratoff I. (eds.) Automatic Program Construction Techniques. MacMillan, im Druck.

    Google Scholar 

  9. Boyer R.S., Moore J.S. A Computational Logic. Academic Press, New York, London (1979).

    MATH  Google Scholar 

  10. Buchberger B. Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gl ei chungssystems. Aequationes mathematicae, Vol.4/3, 374–383 (1970). (Diss., Univ. Innsbruck, 1965).

    Google Scholar 

  11. Buchberger B. A Criterion for Detecting Unnecessary Reductions in the Construction of Gröbner-Bases. Invited paper: EUROSAM 79, Marseille, Lecture Notes in Comput. Scie., Vol.72, 3–21 (1979).

    Google Scholar 

  12. Buchberger B. Eine Fallstudie in systematischer Algorithmenentwicklung: Algorithmus für ein Nimmspiel. Univ. Linz, Inst. f. Math., Bericht Nr. 162 (1980).

    Google Scholar 

  13. Buchberger B. Beschreibung des Forschungsprojektes “Programmverifikation: Teilprojekt Simplifikation”. Univ. Linz, Inst. f. Math., Projekt-Proposal (1981).

    Google Scholar 

  14. Buchberger B., Lichtenberger F. Mathematik für Informatiker I. (Die Methode der Mathematik). Springer, Heidelberg (1980).

    MATH  Google Scholar 

  15. Buchberger B., Loos R. Algebraic Simplification. In: Computer Algebra (Buchberger B., Collins G., Loos R. eds.), Springer, Wien, erscheint demnächst.

    Google Scholar 

  16. Burstall R.M., Darlington J. A Transformation System for Developing Recursive Programs. J. ACM, Vol.24/1, Jan. 1977.

    Google Scholar 

  17. Darlington J., Burstall R.M. A System which Automatically Improves Programs. Acta Informatica, Vol.6, pp.41–60 (1976).

    Article  MATH  Google Scholar 

  18. Dijkstra E.W. A Discipline of Programming. Prentice Hall, Englewood Cliffs, N.J. (1976).

    MATH  Google Scholar 

  19. Floyd R.W. Assigning Meanings to Programs. Proc. of Symp. in Applied Mathematics, Vol.19, pp.19–32 (J.T. Schwartz ed., Mathematical Aspects of Computer Science, American Mathematical Society, Providence, R.I.) (1967).

    Google Scholar 

  20. Gerhart S.L., Musser D.R., Thompson D.H., Baker D.A., Bates R.L., Erickson R.W., London R.L., Taylor D.G., Wile D.S. An Overview of AFFIRM: A Specification and Verification System. Proc. of the IFIP Congress 1980 (S.H. Lavington ed.), pp.343–347 (1980).

    Google Scholar 

  21. Goad C.A. Proofs of Descriptions of Computation. Proc. 5th Conf. on Automated Deductions, Springer LN Comput. Sci. 87, 39–52 (1980).

    Google Scholar 

  22. Goad C.A. Automatic Construction of Special Purpose Programs. Proc. 6th Conf. on Automated Deductions, to appear.

    Google Scholar 

  23. Gordon M.J., Milner A.J., Wadsworth C.P. Edinburgh LCF. Lecture Notes in Comp. Science Vol.78, Springer, Berlin (1979).

    Google Scholar 

  24. Guttag J.V., Horning J.J. The Algebraic Specification of Abstract Data Types. Acta Informatica, Vol.10, pp.27–52 (1978).

    Article  MathSciNet  MATH  Google Scholar 

  25. Henke F.W., Luckham D.C. Automatic Program Verification III: A Methodology for Verifying Programs. Stanford Artificial Intelligence Laboratory, Memo AIM-255 (1974).

    Google Scholar 

  26. Hesse W. Methoden und Werkzeuge für Software-Entwicklung: Ein Marsch durch die Technologie-Landschaft. Informatik-Spektrum, 4/4, 229–245 (1981).

    Google Scholar 

  27. Hoare C.A.R. An Axiomatic Basis for Computer Programming. Communications of the ACM, Vol.12/10, pp.576–580 (1969).

    Article  Google Scholar 

  28. Knuth D.E., Bendix P.B. Simple Word Problems in Universal Algebras. In: Leech (ed.), Computational Problems in Abstract Algebra, Proc. of Symp., Oxford 1967, Pergamon Press, New York, pp. 263–297 (1970).

    Google Scholar 

  29. Kowalski R. Logic for Problem Solving. North Holland, New York, Oxford (1979).

    MATH  Google Scholar 

  30. Lichtenberger F. PL/ADT: Ein System zur Verwendung algebraisch spezifizierter abstrakter Datentypen in PL/I. Diss., Univ. Linz, Inst. f. Mathematik (1980).

    Google Scholar 

  31. Luckham D.C., German S.M., v.Henke F.W., Karp R.A., Milne P.W., Oppen D.C., Polak W., Scherlis W.L. Stanford Pascal Verifier User Manual. Stanford, Computer Science Department, Report No. STAN-CS-79-731 (1979).

    Google Scholar 

  32. Manna Z. Mathematical Theory of Computation. McGraw-Hill, New York (1974).

    MATH  Google Scholar 

  33. Manna Z., Waldinger R. Knowledge and Reasoning in Program Synthesis. Artif. Intelligence 6/2, 175–208 (1975).

    Article  MathSciNet  Google Scholar 

  34. Manna Z., Waldinger R. Synthesis: Dreams ===> Programs. SRI International, Menlo Park, Calif., Techn. Note No. 156 (1977).

    Google Scholar 

  35. Manna Z., Waldinger R. The Logic of Computer Programing. IEEE Trans. on Software Engin., SE-4/3, 199–229 (1978).

    Article  MathSciNet  Google Scholar 

  36. Manna Z., Waldinger R. A Deductive Approach to Program Synthesis. ACM TOPLAS 2/1, 92–121 (1980).

    Google Scholar 

  37. Musser D.R. Abstract Data Type Specification in the AFFIRM System. Proc. of the Conf. on Specification of Reliable Software, Boston, April 3–5, 1979, pp.47–57 (1979). IEEE Transact. on Software Eng. Vol. SE-6, No. 1, Jan. 1980.

    Google Scholar 

  38. Musser D.R. On Proving Inductive Properties of Abstract Data Types. Seventh ACM Symp. on Principles of Programming Languages (1980).

    Google Scholar 

  39. Partsch H., Pepper P. A Family of Rules for Recursion Removal Related to the Towers of Hanoi Problem. Information Processing Letters, Vol.5, 174–177 (1976).

    Article  MathSciNet  MATH  Google Scholar 

  40. Polak W. Program Verification at Stanford: Past, Present, Future. Internal Report, Stanford University, Computer Systems Laboratory (1981).

    Google Scholar 

  41. Polya G. How to Solve It. (Deutsche Übersetzung: Schule des Denkens. Francke Verlag, Bern (1967)).

    Google Scholar 

  42. Prawitz D. Natural Deduction. Almqvist&Wiksell, Stockholm (1965).

    MATH  Google Scholar 

  43. Raulefs P., Siekmann J. Programm-Verifikation: Darstellung eines Forschungsvorhabens. Univ. Bonn, Univ. Karlsruhe, Inst. f. Informatik, Forschungs-Proposal (1980).

    Google Scholar 

  44. Rechenberg P. Programmieren in PL/I. Oldenburg, München (1978).

    Google Scholar 

  45. Rechenberg P. Persönliche Mitteilung (1980).

    Google Scholar 

  46. Robson J. The Height of Binary Search Trees. The Australian Comput. J. 11, 151–153 (1979).

    MathSciNet  Google Scholar 

  47. Smith D.R. A Survey of the Synthesis of LISP Programs from Examples. Proc. Int. Workshop on Progr. Constr., Chateau de Bonas, Sept. 1980.

    Google Scholar 

  48. Suzuki N. Verifying Programs by Algebraic and Logical Reduction. Proc.of the International Conf. on Reliable Software, Los Angeles, California, pp.473–481 (1975).

    Google Scholar 

  49. Wegbreit B. Heuristic Methods for Mechanically Deriving Inductive Assertions. Third International Joint Conference on Artificial Intelligence, Stanford, California, pp.524–536 (1973).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universität Linz, Austria

    B. Buchberger

Authors
  1. B. Buchberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik der Technischen Universität, Postfach 202420, 8000, München 2, Germany

    Wolfgang Bibel

  2. Universität Karlsruhe, Institut für Informatik 1, Postfach 6380, 7500, Karlsruhe 1, Germany

    Jörg H. Siekmann

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buchberger, B. (1982). Computer-Unterstützter Algorithmenentwurf. In: Bibel, W., Siekmann, J.H. (eds) Künstliche Intelligenz. Informatik-Fachberichte, vol 59. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-68828-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-68828-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11974-6

  • Online ISBN: 978-3-642-68828-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation