Skip to main content
SpringerLink
Log in

Formal reasoning about modules, reuse and their correctness

  • Conference paper
  • First Online:
Practical Reasoning (FAPR 1996)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1085))

Included in the following conference series:

Abstract

We present a formalisation of modules that are correct, and (correctly) reusable in the sense that composition of modules preserves both correctness and reusability. We also introduce a calculus for formally reasoning about the construction of such modules.

This work was done during the second author's visit to TH Darmstadt, supported by the European Union HCM project LPST, contract no. 93/414. He wishes to thank Prof Wolfgang Bibel for his invitation and hospitality.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bertoni, G. Mauri and P. Miglioli. On the power of model theory in specifying abstract data types and in capturing their recursiveness. Fundamenta Informaticae VI(2):127–170, 1983.

    Google Scholar 

  2. A. Brogi, P. Mancarella, D. Pedreschi and F. Turini. Modular logic programming. ACM TOPLAS 16(4):1361–1398, 1994.

    Article  Google Scholar 

  3. K.M. Bruce. A paradigmatic object-oriented programming language: Design, static typing and semantics. J. Functional Programming 4(2):127–206, 1994.

    Google Scholar 

  4. M. Bugliesi, E. Lamma and P. Mello. Modularity in logic programming. J. Logic Programming 19, 20:443–502, 1994. Special issue: Ten years of logic programming.

    Article  Google Scholar 

  5. C.C. Chang and H.J. Keisler. Model Theory. North-Holland, 1973.

    Google Scholar 

  6. J.A. Goguen and R.M. Burstall. Institutions: Abstract model theory for specification and programming. J. ACM 39(1):95–146, 1992.

    Article  Google Scholar 

  7. K.K. Lau and M. Ornaghi. On specification frameworks and deductive synthesis of logic programs. In L. Fribourg and F. Turini, editors, Proc. LOPSTR 94 and META 94, LNCS 883, pages 104–121, Springer-Verlag, 1994.

    Google Scholar 

  8. K.K. Lau, M. Ornaghi and S.-.Å. Tärnlund. The halting problem for deductive synthesis of logic programs. In P. van Hentenryck, editor, Proc. 11it th Int. Conf. on Logic Programming, pages 665–683, MIT Press, 1994.

    Google Scholar 

  9. K.K. Lau, M. Ornaghi and S.-.Å. Tärnlund. Steadfast logic programs. Submitted

    Google Scholar 

  10. J.W. Lloyd. Foundations of Logic Programming, Springer-Verlag, 1987.

    Google Scholar 

  11. B. Meyer. Eiffel the Language. Prentice Hall, 1992.

    Google Scholar 

  12. P. Miglioli, U. Moscato and M. Ornaghi. Abstract parametric classes and abstract data types defined by classical and constructive logical methods. J. Symb. Comp. 18:41–81, 1994.

    Article  Google Scholar 

  13. J. Palsberg and M.I. Schwartzbach. Object-Oriented Type Systems. Wiley, 1994

    Google Scholar 

  14. M. Wirsing. Algebraic specification. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science, pages 675–788. Elsevier, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachgebiet Intellektik, Fachbereich Informatik, Technische Hochschule Darmstadt, Alexanderstr. 10, D-64283, Darmstadt, Germany

    Christoph Kreitz

  2. Department of Computer Science, University of Manchester, M13 9PL, Manchester, UK

    Kung -Kiu Lau

  3. Dipartimento di Scienze dell'Informazione, Universita' degli studi di Milano, Via Comelico 39/41, Milano, Italy

    Mario Ornaghi

Authors
  1. Christoph Kreitz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kung -Kiu Lau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mario Ornaghi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dov M. Gabbay Hans Jürgen Ohlbach

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kreitz, C., Lau, K.K., Ornaghi, M. (1996). Formal reasoning about modules, reuse and their correctness. In: Gabbay, D.M., Ohlbach, H.J. (eds) Practical Reasoning. FAPR 1996. Lecture Notes in Computer Science, vol 1085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61313-7_88

Download citation

  • DOI: https://doi.org/10.1007/3-540-61313-7_88

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61313-8

  • Online ISBN: 978-3-540-68454-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation