Skip to main content
SpringerLink
Log in

The verification of modules

  • Published:
Formal Aspects of Computing

Abstract

We present a module concept with algebraic interfaces and imperative implementation. It is shown that under some natural conditions, module correctness may be expressed in Hoare logic as a partial correctness assertion. Also, we discuss questions of practical verification of modules using Hoare's calculus.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Antoniou, G.: On the Verification of Modules, Technical Report OSM P 125, Fachbereich Mathematik/Informatik, UniversitÄt Osnabrück, 1989.

  2. Antoniou, G.: Modules and Verification, IMA Conference on the Unified Computation Laboratory, Oxford, University Press, 1992.

  3. Bergstra, J.A. and Klop, J.W.: Proving Program Inclusion using Hoare's Logic, Theoretical Computer Science 30, 1–48, 1984.

    Google Scholar 

  4. Blum, E.K., Ehrig, H. and Parisi-Presicce, F.: Algebraic Specification of Modules and Their Basic Interconnections, JCSS 34, pp. 293–339, 1987.

    Google Scholar 

  5. Bergstra, J.A. and Tucker, J.V.: Expressiveness and the Completeness of Hoare's Logic, Journal of Computer and System Sciences 25, 267–284, 1982.

    Google Scholar 

  6. Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 1, Springer 1985.

  7. Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 2, Springer 1990.

  8. Hoare, C.A.R.: An axiomatic basis for computer programming, Comm. ACM 12 (1969), 567–580.

    Google Scholar 

  9. Hoetker, W.: über die praktische Verifikation von Modulen, Diplomarbeit, Fachbereich Mathematik/Informatik, UniversitÄt Osnabrück.

  10. Kfoury, A.J., and Urzyczyn, P.: Necessary and Sufficient Conditions for the Universality of Programming Formalisms, Acta Informatica 22, pp. 347–377, 1985.

    Google Scholar 

  11. Klaeren, H.A.: Algebraische Spezifikation — Eine Einführung, Springer Lehrbuch Informatik, 1983.

  12. Loeckx, J.: Algorithmic specifications: a specification method for abstract data types, ACM Transactions on Programming Languages and Systems, 9(4), 1987.

  13. Lockemann, P.C. and Mayr, H.C.: Rechnergestützte Informationssysteme, Springer, 1978.

  14. Loeckx, J. and Sieber, K.: The Foundations of Program Verification, Wiley 1984/87.

  15. McGettrick, A.D.: Program Verification using Ada, Cambridge University Press, 1982.

  16. Reif, W.: A Logic Theory of Module Correctness, Doctoral Thesis, University of Karlsruhe, Department of Computer Science 1990 (in preparation).

  17. Sage, A.P. and Palmer, J.D.: Software Systems Engineering, Wiley 1990.

  18. Sperschneider, V. and Antoniou, G.: Logic: A Foundation for Computer Science, Addison-Wesley 1991.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Osnabrueck, Albrechtstrasse 28, D-4500, Osnabrueck, Germany

    Grigoris Antoniou

Authors
  1. Grigoris Antoniou
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Grigoris Antoniou.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Antoniou, G. The verification of modules. Formal Aspects of Computing 6, 223–244 (1994). https://doi.org/10.1007/BF01221100

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01221100

Keywords

CR Classification

Search

Navigation