Skip to main content
SpringerLink
Log in
Book cover

Künstliche Intelligenz pp 134–182Cite as

Programmverifikation

  • Conference paper

  • 134 Accesses

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

Zusammenfassung

Die Ziele des Kurses über Programmverifikation bestehen in der Herausarbeitung von Ansatzpunkten für Verifikationsmethoden zur Sicherung der Zuverlässigkeit von Software, die Darstellung grundlegender Konzepte und deren Integration in Entwicklungs- und Verifikationssysteme.

Die Einleitung gibt einen globalen Überblick, in Abschnitt 2 wird eine Einordnung der Verifikationsverfahren in die sonstigen Methoden des Software Engineering vorgenommen, und in Abschnitt 3 wird der Stellenwert der Verifikation diskutiert. Die beiden folgenden Abschnitte beschreiben grundlegende Konzepte zur Verifikation von Programmen und von Datenabstraktionen. Aus Platzgründen konzentriert der Text sich auf die axiomatische Methode und den State-Machine-Ansatz. Der 7. Abschnitt schließlich beschäftigt sich mit Systemen zur Verifikation und dabei insbesondere mit dem Gypsy Verification Environment.

This is a preview of subscription content, 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   49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. : Apt,K.R.: Ten years of Hoare’s logic: a survey-part I. ACM Toplas 3, 431–483 (1981)

    Google Scholar 

  2. : H.K. Berg, W.E. Boebert, W.R. Franta, T.G. Moher: Formal Methods of Program Verification and Specification, Prentice Hall, 1982

    Google Scholar 

  3. : B.S. Boyer, J.S. Moore: A Computational Logic, ACM Monograph Series, Academic Press, 1979

    Google Scholar 

  4. : B.S. Boyer, M. Kaufmann: A Prototype Theorem Prover for a higher order Functional Language, Burroughs Corp., Austin, Tex., Dec. 1984

    Google Scholar 

  5. B.S. Boyer, J.S. Moore: Program Verification, J. of Automated Reasoning, Vol. 1, No 1, 1985, pp 17–23

    MathSciNet  Google Scholar 

  6. : W.W. Bledsoe, P. Bruell: A man-machine theoremproving system, Advance Papers of Third Int. Joint Conf. on.Art. Intelligence, 5–1, 1974

    Google Scholar 

  7. : R. Cartwright, D. Oppen: The logic of aliasing, Acta Informatica 15, 1981, 365–384

    Google Scholar 

  8. : M.H. Cheheyl, M.G. Gasser, G.A. Huff, J.K. Millen: Verifying Security, in ACM Comp. Surveys, Vol. 13, No 3, Sept. 1981, pp 279–340

    Google Scholar 

  9. : Clarke, E.M.: Programming language constructs for which it is impossible to obtain good Hoare-like axioms, J. Ass. Compo Mach. 26, pp 129–147

    Google Scholar 

  10. : E.M. clarke, S.M. German, J.Y. Halpern: Effective Axiomatization of Hoare logiCS, J. Ass. Compo Mach., 30, 612–636

    Google Scholar 

  11. : A.J. Cohn: The equivalence of two semantic definitions: a case study-in LCF, SIAM J. Compo 12, 267–285, 1983

    Google Scholar 

  12. : S.A. Cook: Soundness and completeness of an axiom system for program verification, SIAM J. Compo 7, 70–90

    Google Scholar 

  13. : W. Damm, B. Josko: A sound and relatively complete Hoarelogic for a language with higher type procedures, Tech. Rep. Bericht, no. 77, RWTH Aachen, 1982

    Google Scholar 

  14. : J. de Bakker: Mathematical Theory of Program Correctness, Prentice Hall, 1980

    MATH  Google Scholar 

  15. : P.R. Eggert: Overview of the ‘Ina Jo’ specification language, Techn. Rep. SP 4082, System Development Corp., Santa Monica, Calif., Oct 1980

    Google Scholar 

  16. : A. Endres: Formale Analyse und Verifikation von Pro grammen, Dissertation Stuttgart 1976

    Google Scholar 

  17. : R.W. Floyd: Assigning meanings to programs, in: Mathematical Aspects of Computer Science, J.T. Schwartz (ed.), AMS, 1967, pp 19–32

    Book  Google Scholar 

  18. : D.I. Good, L.C. Ragland: Nucleus - a language of provable programs, in W. Hetzel (ed.), Program Test Methods, Prentice Hall, 1974

    Google Scholar 

  19. : D.I. Good, R.M. Cohen, L.W. Hunter: A report on the development of Gypsy, Techn. Rep. ICSCA-CMP-13, Univ. Tex. Austin,78

    Google Scholar 

  20. : D.I. Good, R.M. Cohen, C.G. Hoch, L.W. Hunter, D.F. Hare: Report on the language Gypsy, Version 2.0, Techn. Rep. ICSCACMP- 10, Univ. Tex. Austin, Sept. 1978

    Google Scholar 

  21. : J.A. Goguen, J.W. Thatcher, E.G. Wagner: Abstract data types as initial algebras and the correctness of data representation, in: Current Trends in Programming Methodology, Yeh (ed.), Vol. 4, pp 80–149,1978

    Google Scholar 

  22. : J.V. Guttag, J.J. Hornig: The algebraic specification of abstract data types, Acta Informatica 10, pp 27–52,1978

    Google Scholar 

  23. : J.Y. Halpern, A.R. Meyer, B.A. Trakhtenbrot: From denotational to operational and axiomatic semantics, in: Lect. Notes Compo Sci., no. 164, Springer 1983, pp 474–500

    Google Scholar 

  24. : D. Harel: First-order dynamic logic, Lect. Notes Compo Sci., no. 68, Springer, 1979

    Book  Google Scholar 

  25. : C.A.R. Hoare: An axiomatic basis of computer programming, Comm. ACM, 12, pp. 576–583,1969

    Google Scholar 

  26. : C.A.R. Hoare: Proof of a structured program: ‘The sieve of Eratosthenes’, Compo J., Vol. 15, pp. 321–325, 1972

    Google Scholar 

  27. : C.A.R. Hoare: Proof of correctness of data representations, Acta Informatica, vol. 1, pp. 271–281, 1972

    Google Scholar 

  28. : R. Kowalski: The relation between logic programming and logic specification, in: Mathematical LogiC and Programming Languages, Prentice Hall, pp. 11–24, 1985

    Google Scholar 

  29. : B.W. Lampson, J.J. Hornig, R.L. London, J.G. Mitchell, G.J. Popek: Report on the Programming Languaqe Euclid, Siqplan Notices, 12(2), Febr. 1977

    Google Scholar 

  30. Langmaack,Olderog 80: H. Langmaack,E.R. Olderog: Present-day Hoarelike systems for programming languages with procedures power, limits and most likely extensions, in: Automata, Languages and Programming, Lect. Notes Compo Sci. 83, 363–373, 1980

    Google Scholar 

  31. : K.N. Levitt, L. Robinson, B.A. Silverberg: The HOM Handbook, Vols. 1–3, Compo Sci. Lab., SRI International, Menlo Parc, Calif., June 1979

    Google Scholar 

  32. : R.J. Lipton: A necessary and sufficient condition for the existence of Hoare logics, Proc. 18th IEEE Symp. Found. Compo ScL, pp. 1–6, 1977

    Google Scholar 

  33. : B.H. Liskov, S.N. Zilles: Specification techniques for data abstractions, IEEE Trans. Softw. Eng., Vol. SE-1, No.1., March 1975

    Google Scholar 

  34. : J. Loeckx, K. Sieber: The Foundation of Program Verification, Wiley, 1984

    Google Scholar 

  35. : P. Lucas, K. Walk: On the formal description of PL/1, in Annual Review in Automatic Progr. 6, Pergamon,105–182, 1971

    Google Scholar 

  36. : R. Milner: Logic for computable functions: description of a machine implementation, Siqplan Notices, 7, 1–6, 1972

    Article  Google Scholar 

  37. : J. McHugh: Towards the Generation of efficient Code from verified Programs, Techn. Rep. 40, ICSCA Univ. Tex.,1984

    Google Scholar 

  38. : P. Naur: Proof of algorithms by general snapshots, BIT 6, pp. 310–316, 1966

    Google Scholar 

  39. Nökel,Rehbold 85: K. Nökel: Implementierung einer Reduktionsmaschine und Steuerung und Organisation eines Beweissystems fur eine Logik, Diplomarbeit, RWTH Aachen, 1985. Ebenso R. Rehbold: Implementierung eines Abstraktionsalgorithmus und Beweisalgorithmen fur eine Logik

    Google Scholar 

  40. : E.R. Olderog: Sound and complete Hoare-like calculi based on copy rules, Acta Informatica 16, pp. 161–197, 1981

    Google Scholar 

  41. : D.L. Parnas: A Technique for Software Module Specification with Examples, Comm. ACM, Vol. 15, May 1972

    Google Scholar 

  42. : D.L. Parnas: On the Criteria to be used in decomposing Systems into Modules, Comm. ACM, Vol 15, Dec. 1972

    Google Scholar 

  43. : O. Roubine, L. Robinson: SPECIAL Reference Manual, Techn. Rep. CSG-45, SRI, Menlo Parc, Calif., Jan. 1977

    Google Scholar 

  44. : D.S. Scott, C. Strachey: Towards a Mathematical Semantics for Computer Languages, Proc. Symp. Compo and Automata, Polytechn. Inst. Brooklyn Press, New York, 1971

    Google Scholar 

  45. : J.E. Stoy: Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, The MIT Press,1977

    Google Scholar 

  46. : R.M. Stallman: EMACS:The Extensible, Customizable Display Editor, MIT Art. Intell. Lab., Memo 519a, 1981

    Google Scholar 

  47. : P. Urzyczyn: A necessary and sufficient condition in order that a Herbrand interpretation is expressive relative to recursive programs, Inst. Mathern., Univ. Warsaw, 1983

    Google Scholar 

  48. : N. Wirth: Program development by stepwise refinement, Comm. ACM 14, pp. 221–227, April 1971

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Angewandte Mathematik, insbesondere Informatik, Rhein. Westf. Techn. Hochschule Aachen, Deutschland

    Volker Penner

Authors
  1. Volker Penner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Forschungsgruppe Expertensysteme, Gesellschaft für Mathematik und Datenverarbeitung mbH, Schloß Birlinghoven, Postfach 1240, 5205, Sankt Augustin 1, Deutschland

    Thomas Christaller

  2. Forschungsgruppe Mensch—Maschine—Kommunikation, Gesellschaft für Mathematik und Datenverarbeitung mbH, Schloß Birlinghoven, Postfach 1240, 5205, Sankt Augustin 1, Deutschland

    Hans-Werner Hein

  3. Fachbereich Informatik, Universität Kaiserslautern, Postfach 3049, 6750, Kaiserslautern, Deutschland

    Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Penner, V. (1988). Programmverifikation. In: Christaller, T., Hein, HW., Richter, M.M. (eds) Künstliche Intelligenz. Informatik-Fachberichte, vol 159. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-73405-2_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-73405-2_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18903-9

  • Online ISBN: 978-3-642-73405-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation