Skip to main content

Correctness of generic modules

  • Conference paper
  • First Online:
Logical Foundations of Computer Science — Tver '92 (LFCS 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 620))

Included in the following conference series:

Abstract

Modularization is the central design paradigm for large software systems, and the correctness of modules is one of the basic building blocks for the verification of large systems. In this paper we investigate the correctness problem for generic modules. The export- and import interfaces of a generic module are parameterized first-order specifications, and its implementation is written in an imperative programming language. We define the semantics and the correctness of generic modules, and present a logical characterization of correctness in terms of Dynamic Logic. This characterization paves the way for automated verification of generic modules in the KIV system (Karlsruhe Interactive Verifier), a tactical theorem prover for Dynamic Logic.

This research was partly sponsored by the BMFT-project KORSO.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Antoniou, G.,Sperschneider, V., On The Verification of Modules, CSL 89, Springer LNCS 440, pp. 16–35

    Google Scholar 

  2. Blum, E.K., Ehrig, H., Parisi-Presicce, F., Algebraic Specification of Modules and Their Basic Interconnections, Journal of Computer and System Sciences 34 (1987), pp. 293–339

    Article  Google Scholar 

  3. Boyer, R., Moore, J, A Computational Logic, Academic Press, New York 1979

    Google Scholar 

  4. Bergstra, J., Klop, J., Proving Program Inclusion Using HOARE's Logic, Theoretical Computer Science 30 (1984), pp. 1–48

    Article  Google Scholar 

  5. R. Burstall, Program Proving as Hand Simulation with a little Induction, Information Processing 74, North-Holland Publishing Company (1974)

    Google Scholar 

  6. Chandy, K.M., Misra, J., Parallel Program Design, A Foundation. Addison Wesley 1988

    Google Scholar 

  7. Ehrig, H., Mahr, B., Fundamentals of Algebraic Specification 1, Equations and Initial Semantics, EATCS Monographs on Theoretical Computer Science, Vol. 6, Springer 1985

    Google Scholar 

  8. Ehrig, H., Mahr, B., Fundamentals of Algebraic Specification 2, Module Specifications and Constraints, EATCS Monographs on Theoretical Computer Science, Vol. 21, Springer 1990

    Google Scholar 

  9. Goguen, J., Meseguer, J., Universal Realization, Persistent Interconnection and Implementation of Abstract Modules, Proc. 9th ICALP, 1982, Springer LNCS 45, 265–281

    Google Scholar 

  10. Goguen, J., Thatcher, J., Wagner, E., An Initial Algebra Approach to the Specification, Correctness and Implementation of Abstract Data Types, Current Trends in Programming Methodology IV, Yeh, R. (Ed.), Prentice-Hall, Englewood Cliffs, 1978, pp. 80–149

    Google Scholar 

  11. Goldblatt, R., Axiomatising the Logic of Computer Programming, Springer LNCS 130

    Google Scholar 

  12. Gries, D. The Science of Programming, Springer-Verlag (1981)

    Google Scholar 

  13. Harel, D., First-Order Dynamic Logic, Springer, LNCS 68, 1979

    Google Scholar 

  14. Hoare, C.A.R., An Axiomatic Basis for Computer Programming, Comm. ACM 12 (1969)

    Google Scholar 

  15. Hoare, C.A.R., Proof of Correctness of Data Representations, Acta Informatica 1,4 (1972), pp. 271–281

    Article  Google Scholar 

  16. Heisel, M., Reif, W., Stephan, W., Implementing Verification Strategies in the KIV-System, Proc. 9th International Conference on Automated Deduction, E. Lusk, R. Overbeek (eds), Springer LNCS 310 (1988), pp. 131–140

    Google Scholar 

  17. Heisel, M., Reif, W., Stephan, W., A Dynamic Logic for Program Verification, Meyer, A., Taitslin, M., Logic at Botik 1989, Pereslavl-Zalessky, USSR, Springer LNCS 363, pp. 134–145

    Google Scholar 

  18. Heisel, M., Reif, W., Stephan, W., Tactical Theorem Proving in Program Verification, 10th International Conference on Automated Deduction, Kaiserslautern, FRG, July 1990, Springer LNCS 449, pp. 117–131

    Google Scholar 

  19. Heisel, M., Reif, W., Stephan, W., Formal Software Development in the KIV System, in Automating Software Design, Lowry McCartney (eds), AAAI press 1991, and Proc. Workshop on Automating Software Design, IJCAI-89, Kestrel Institute, Palo Alto (1989), pp. 115–124.

    Google Scholar 

  20. Padawitz, P., Horn Logic and Rewriting for Functional and Logic Program Design, Universität Passau, Fakultät für Mathematik und Informatik, MIP-9002, März 1990

    Google Scholar 

  21. Reif, W., Correctness of Specifications and Generic Modules, Dissertation, University of Karlsruhe, 1991 (in German)

    Google Scholar 

  22. Stolboushkin, A.P., Taitslin, M.A., Deterministic dynamic logic is strictly weaker than dynamic logic, Information and Control 57, pp. 48–55, 1983

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Anil Nerode Mikhail Taitslin

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reif, W. (1992). Correctness of generic modules. In: Nerode, A., Taitslin, M. (eds) Logical Foundations of Computer Science — Tver '92. LFCS 1992. Lecture Notes in Computer Science, vol 620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023893

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55707-4

  • Online ISBN: 978-3-540-47276-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics