Advertisement

Literatur

  • Maritta Heisel
Chapter
Part of the DUV: Datenverarbeitung book series (DUVD)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. [Backhouse 1989]
    Backhouse, R. 1989. Do-it-Yourself Type Theory. Formal Aspects of Computing 1: 19–84.CrossRefzbMATHGoogle Scholar
  2. [Bibel 1980]
    Bibel, W. 1980. Syntax-Directed, Semantics-Supported Program Synthesis. Artificial Intelligence 14: 243–261.CrossRefGoogle Scholar
  3. [Bibel und Hörnig 1984]
    Bibel, W. und Hörnig, K. 1984. LOPS — A System Based on a Strategical Approach to Program Synthesis. In Automatic Program Construction Techniques, eds. A. Biermann, G. Guiho und Y. Kodratoff, 69–90. New York: Macmillan Publishing Company.Google Scholar
  4. [Bird 1989]
    Bird, R. 1989. Lectures on Constructive Functional Programming. In Constructive Methods in Computing Science, ed. M. Broy, 151–218. Berlin: Springer-Verlag.CrossRefGoogle Scholar
  5. Biundo 1988] Biundo, S. 1988. Automated Synthesis of Recursive Algorithms as a Theorem Proving Tool. In Proceedings of the 8-th European Conference on Artificial Intelligence.Google Scholar
  6. [Bjorner und Jones 1982]
    Bjorner, D. und Jones, C. 1982. Formal Spec- ification and Software Development. London: Prentice-Hall.Google Scholar
  7. [Boehm 1986]
    Boehm, B. W. 1986. A Spiral Model of Software Development and Enhancement. ACM SIGSOFT Software Engineering Notes 11 (4): 22–42.CrossRefGoogle Scholar
  8. [Broy 1984]
    Broy, M. 1984. Algebraic Methods for Program Construction: The Project CIP. In Program Trasnsformation and Programming Environments, ed. P. Pepper, 199–222. Berlin: Springer-Verlag.CrossRefGoogle Scholar
  9. [Burstall und Darlington 1977]
    Burstall, R. und Darlington. J. 1977. A Transformation System for Developing Recursive Programs. Journal of the ACM 24: 44–67.CrossRefzbMATHMathSciNetGoogle Scholar
  10. [Clarke 1979]
    Clarke, E. 1979. Programming Language Constructs for which it is Impossible to Obtain Good Hoare Axiom Systems. Journal of the ACM 26: 129–147.CrossRefzbMATHGoogle Scholar
  11. [Constable et al. 1986]
    Constable, R. et al. 1986. Implementing Mathematics with the Nurpl Proof Development System. Englewood Cliffs: Prentice-Hall.Google Scholar
  12. [Dahl, Dijkstra und Hoare 1981] Dahl, O., Dijkstra, E. und Hoare, A. 1981. Structured Programming. London: Academic Press. [Dershowitz 1983]
    Dershowitz, N. 1983. The evolution of programs. Boston: Birkhäuser.CrossRefzbMATHGoogle Scholar
  13. [Drexler 1990]
    Drexler, R. 1990. Programmsynthese durch sukzessive Entwickung von Schleifeninvarianten. Diplomarbeit, Fakultät für Informatik, Universität Karlsruhe.Google Scholar
  14. [Dijkstra 1976]
    Dijkstra, E.W. 1976. A Discipline of Programming. Englewood Cliffs: Prentice-Hall.zbMATHGoogle Scholar
  15. [Dijkstra 1988]
    Dijkstra, E.W. Vorlesung vom 4.8. 1988, International Summer School, Marktoberdorf 1988, nicht veröffentlicht.Google Scholar
  16. [Dijkstra 1990]
    Dijkstra, E.W. ed. 1990. Formal Development of Programs and Proofs. Reading: Addision-Wesley.zbMATHGoogle Scholar
  17. [Ehrig und Mahr 1985]
    Ehrig, H. und Mahr, B. 1985. Fundamentals of Algebraic Specification 1. Berlin: Springer-Verlag.CrossRefzbMATHGoogle Scholar
  18. [Gelfort 1989]
    Gelfort, M. 1989. Implementierung einer Strategie zur Programmentwicklung. Studienarbeit, Fakultät für Informatik, Universität Karlsruhe.Google Scholar
  19. [Gelfort 1990]
    Gelfort, M. 1990. Ein Synthesesystem für Divid-and-Conquer Algorithmen. Diplomarbeit, Fakultät für Informatik, Universität Karlsruhe.Google Scholar
  20. [Gordon, Milner, und Wadsworth 1979]
    Gordon, M., Milner, R. und Wadsworth,C. 1979. Edinburgh LCF. Berlin: Springer Lecture Notes in Computer Science 78.Google Scholar
  21. [Goldblatt 1982]
    Goldblatt, R. 1982. Axiomatising the Logic of Computer Programming. Berlin: Springer Lecture Notes in Computer Science 130.zbMATHGoogle Scholar
  22. [Gries 1981]
    Gries, D. 1981. The Science of Programming. Berlin: Springer-Verlag.CrossRefzbMATHGoogle Scholar
  23. [Harel 1984]
    Harel, D. 1984. Dynamic Logic. In Handbook of Philosophical Logic, Vol. 2, eds. D. Gabbay und F.Guenther, 496–604. Dordrecht: Reidel.Google Scholar
  24. [Heisel 1989]
    Heisel, M. 1989. A Formalization and Implementation of Gries’s Program Development Method within the KIV Environment, Interner Bericht 3/89, Fakultät für Informatik, Universität Karlsruhe.Google Scholar
  25. [Heisel 1992]
    Heisel, M. 1992. Formalizing and Implementing Gries’s Program Development Method in Dynamic Logic. Science of Computer Programming 18: 107–137.CrossRefzbMATHMathSciNetGoogle Scholar
  26. [Heisel, Reif und Stephan 1986]
    Heisel, M., Reif, W. und Stephan, W. 1986. A Functional Language to Construct Proofs, Interner Bericht 1/86, Fakultät für Informatik, Universität Karlsruhe.Google Scholar
  27. [Heisel, Reif und Stephan 1987]
    Heisel, M., Reif, W. und Stephan, W. 1987. Program Verification by Symbolic Execution and Induction. In Proceedings of the 11-th German Workshop on Artificial Intelligence, 201–210. Berlin: Springer Informatik Fachberichte 152.Google Scholar
  28. [Heisel, Reif und Stephan 1988a]
    Heisel, M., Reif, W. und Stephan, W. 1988. Program Verification Using Dynamic Logic. In Proceedings of the first Workshop on Computer Science Logic, 102–117. Berlin: Springer Lecture Notes in Computer Science 329.Google Scholar
  29. [Heisel, Reif und Stephan 1988b]
    Heisel, M., Reif, W. und Stephan, W. 1988. Implementing Verification Strategies in the KIV System. In Proceedings of the 9-th International Conference on Automated Deduction, 131–140. Berlin: Springer Lecture Notes in Computer Science 310.Google Scholar
  30. [Heisel, Reif und Stephan 1989]
    Heisel, M., Reif, W. und Stephan, W. 1989. Machine-Assisted Program Construction and Modification. In In Proceedings of the 13-th German Workshop on Artificial Intelligence, 338–347. Berlin: Springer Informatik Fachberichte 216.Google Scholar
  31. [Heisel, Reif und Stephan 1990]
    Heisel, M., Reif, W. und Stephan, W. 1990. Tactical Theorem Proving in Program Verification. In Proceedings of the 10-th International Conference on Automated Deduction, 115–131. Berlin: Springer Lecture Notes in Artificial Intelligence 449.Google Scholar
  32. [Heisel, Reif und Stephan 1991]
    Heisel, M., Reif, W. und Stephan, W. 1991. Formal Software Development in the KIV System. In Automating Software Design, eds. Michael Lowry und Robert McCartney, 547–574. Menlo Park: AAAI Press.Google Scholar
  33. [Heisel und Santen 1990]
    Heisel, M., und Santen, T. 1990. Formal Program Development by Goal Splitting and Backward Loop Formation, Interner Bericht 32/90, Fakultät für Informatik, Universität Karlsruhe.Google Scholar
  34. [Hoare 1969]
    Hoare, A. An Axiomatic Basis for Computer Programming. Journal of the ACM 12: 576–580.Google Scholar
  35. [Jackson 1983]
    Jackson, M. 1983. System Development. Englewood Cliffs: Prentice- Hall.zbMATHGoogle Scholar
  36. [Katzan 1976]
    Katzan, H. 1976. Systems Design and Documentation. New York: Van Nordstrand Reinhold Company.Google Scholar
  37. [Knuth 1973]
    Knuth, D.E. 1973. The Art of Computer Programming. 3 Vols. Reading: Addison-Wesley.Google Scholar
  38. [Knuth und Bendix 1970]
    Knuth, D. und Bendix, P. 1970. Simple Word Problems in Universal Algebras. In Computational Problems in Abstract Algebra, ed. Knuth, D. und Bendix, P, 263–297. Pergamon Press.Google Scholar
  39. [Lowry und Duran 1989]
    Lowry, M. und Duran, R. 1989. Knowledge Based Software Engineering. In Handbook of Artificial Intelligence, Vol IV, ed. A. Barr, P. Cohen und E. Feigenbaum, 241321. Reading: Addison Wesley.Google Scholar
  40. [Manna und Waldinger 1980]
    Manna, Z. und Waldinger, R. 1980. A Deductive Approach to Program Synthesis. ACM Transactions on Programming Languages and Systems 2: 90–121.CrossRefzbMATHGoogle Scholar
  41. [Martin-Löf 1984]
    Martin-Löf, P. 1984. Intuitionistic Type Theory. Neapel: Bibliopolis.zbMATHGoogle Scholar
  42. [Mayrhauser 1990]
    Mayrhauser, A. von 1990. Software Engineering. San Diego: Academic Press.zbMATHGoogle Scholar
  43. [Möller 1990]
    Möller, B. 1990. A Survey of the Project CIP — Computer-Aided, Intuition-Guided Programming. In Sichere Software, ed. H. Kersten, 280–298. Heidelberg: Hüthig Buch Verlag.Google Scholar
  44. [Morris and Wegbreit 1977]
    Morris, J. H.; and Wegbreit, B. 1977. Subgoal Induction. Communications of the ACM 20: 209–222.CrossRefzbMATHMathSciNetGoogle Scholar
  45. [Müller 1990]
    Müller, H. 1990. Formalisierung einer Programmsynthese-Methode von Manna und Waldinger in dynamischer Logik und Implementierung auf dem KIV-System. Diplomarbeit, Fakultät für Informatik, Universität Karlsruhe.Google Scholar
  46. [Nordström 1981]
    Nordström B. 1981. Programming in Constructive Set Theory: Some Examples. In Proceedings of the ACM Conference on Functional Programming Languages and Computer Architecture, 141–153.Google Scholar
  47. [Paige und Koenig 1982]
    Paige, R. und Koenig, S. 1982. Finite Differencing of Computable Expressions. ACM Transactions on Programming Languages and Systems 4: 402–453.CrossRefzbMATHGoogle Scholar
  48. [Reddy 1989]
    Reddy, R. 1989. Rewriting Techniques for Program Synthesis. In Proceedings Rewriting Techniques and Applications, ed. N. Dershowitz, 388–403. Berlin: Springer Lecture Notes in Computer Science 355.Google Scholar
  49. [Reif 1984]
    Reif, W. 1984. Vollständigkeit einer modifizierten Goldblatt-Logik und Approximation der Omegaregel durch Induktion. Diplomarbeit, Fakultät für Informatik, Universität Karlsruhe.Google Scholar
  50. [Reif 1987]
    Reif, W. 1987. A Modal Logic with Countably Many Modal Operators. Internes Arbeitspapier.Google Scholar
  51. Richter 1978] Richter, M. Logikkalküle. Stuttgart: Teubner.Google Scholar
  52. [Ross and Schoman 1973]
    Ross, D. und Schoman, K. 1973. Structured Analysis for Requirements Definition. IEEE Transactions on Software Engineering SE-3:6–15.Google Scholar
  53. [Santen 1990]
    Santen, T. 1990. Programmsynthese nach Dershowitz. Studienarbeit, Fakultät für Informatik, Universität Karlsruhe.Google Scholar
  54. [Smith 1985]
    Smith, D. R. 1985. Top-down synthesis of divide-and-conquer algorithms. Artificial Intelligence 27: 43–96.CrossRefzbMATHMathSciNetGoogle Scholar
  55. [Smith 1990]
    Smith, D. R. 1990. KIDS — A Semi-Automatic Program Development System. IEEE Transactions on Software Engineering 16: 1024–1043.CrossRefGoogle Scholar
  56. [Spivey 1988]
    Spivey, M. 1988. Understanding Z. Cambridge: Cambridge University Press.zbMATHGoogle Scholar
  57. [Stephan 1989]
    Stephan, W. 1989. Axiomatisierung Rekursiver Prozeduren in der Dynamischen Logik. Habilitationsschrift, Fakultät für Informatik, Universität Karlsruhe.Google Scholar

Copyright information

© Springer Fachmedien Wiesbaden 1992

Authors and Affiliations

  • Maritta Heisel

There are no affiliations available

Personalised recommendations