Skip to main content

On a hierarchy of file types and a tower of their theories

  • Invited Lectures
  • Conference paper
  • First Online:
  • 135 Accesses

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

Abstract

We present here a general method of software development which uses both: algorithmic logic and object programming. The approach will be presented in the form of a case study.

We discuss a rich system of files wich contains files of various types: text files, direct access files and binary sequential files. By introducing certain hierarchy one can gain a clear insight into the properties of files. A data structure of plain files is factorized out as a common factor of all mentioned types. All types of files are fully axiomatized in corresponding algorithmic theories. These theories form a tower since all of them are extensions of the theory of plain files.

Finally, one can construct a hierarchy of types which reflects the structure of the tower. In this way one obtains quite complicated software together with the clear specification of its functions. We hope that the reader will see the other applications of the general method presented here.

The research was supported by Polish Ministry of National Education, grant RP.I.09 (1990) and by French Ministere d'Education Nationale grant for LITA Pau. (1991)

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kerningham, B.W., Ritchie, D.M., The C programming language, Prentice Hall, Englewood Cliffs, 1978, pp1–237

    Google Scholar 

  2. Kreczmar, A., et al., Report on Loglan'88 programming language, LNCS vol.414, Springer Verlag, Berlin Heidelberg, 1990, pp1–123

    Google Scholar 

  3. Loglan'82 report, PWN Warsaw, 1983, pp 1–147

    Google Scholar 

  4. Mirkowska,G., Salwicki,A., Algorithmic Logic, PWN Warsaw and D.Reidel Dordrecht, 1987, pp. 1–358

    Google Scholar 

  5. Petermann, U., File System-axiomatic specification and analysis of its realizability in the language Loglan, doctoral dissertation, Dep. Of Mathematics and Computer Science, University of Warsaw 1985

    Google Scholar 

  6. Silvester, Peter,P., The UnixTM System Guidebook, Springer Verlag Inc, New York 1984, pp. 1–244

    Google Scholar 

  7. Stapp, L., Axiomatic approach to the system of files, in Logics of programs and their applications, Proc. Poznan August 1980, LNCS v.148, Springer Verlag, Berlin Heidelberg 1983, pp. 270–294

    Google Scholar 

  8. Szalas,A., Warpechowska,J., Loglan, WNT, Warsaw, 1991, pp. 1–189

    Google Scholar 

  9. Wirth, N., Programming in Modula 2, Springer Verlag, Berlin Heidelberg 1983, pp. 1–179

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andrzej Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salwicki, A. (1991). On a hierarchy of file types and a tower of their theories. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_48

Download citation

  • DOI: https://doi.org/10.1007/3-540-54345-7_48

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47579-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics