Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1982: Automata, Languages and Programming pp 458–472Cite as

Algorithmic theories of data structures

  • Conference paper
  • First Online:

  • 476 Accesses

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

Abstract

We are arguing that main problems of data structures i.e.

  • specification,

  • implementation,

  • verification,

can be approached and solved by developping and studying theories of data structures which are based on algorithmic logic AL. we propose to specify a data structure by a proper set of algorithmic axioms. Then verification of a corresponding property of a program consists in proving the formula which expresses the property. The proof making use of axioms of the data structure.

We present a case study of the algorithmic theory of priority queues ATPQ. we show that the axiomatization of ATPQ is proper by proving the representation theorem, Namely, every model of the theory is isomorphic with the two-sorted model of a linearly ordered set of elements and the family of all finite subsets of the given set of elements, Next, we prove the correctness of an implementation of priority queues in binary search trees. We relate theoretical results to corresponding modules of software written in LOGLAN programming language. Remarks on dynamization of abstract theories of data structures by adding notion of reference, also axiomatizable in AL, are given. Finally, we compare our approach with others known in the literature.

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   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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.

References

  1. Aho,A., Hopcroft,J., ullman,J., The design and analysis of computer algorithms, Addiaon-Wesley, 1974

    Google Scholar 

  2. Banachowski,L., On proving program correctness by means of stepwise refinement method, to appear in Proc. Symp. Algorithmic Logic and LOGLAN in Lecture Notes in Computer Science

    Google Scholar 

  3. Bartol,W.M.,et al., Report on the LOGLAN programming language Müldner, T., ed University of Warsaw 1981

    Google Scholar 

  4. Dańko,W., A criterion of undecidability of algorithmic theories, in Proc. MFCS'80 P.Dembinski ed. LNCS Springer Vlg vol.88

    Google Scholar 

  5. Engeler,E., Algorithmic properties of structures, Math. Systems Theory 1 (1967), 183–195

    Article  MathSciNet  Google Scholar 

  6. Goguen,J. A.,Thatcher,J.W., Wagner,E.G., An initial algebra approach to the specification, correctness and implementation of abstarct data types, IBM Rep. RC 6487(1977)

    Google Scholar 

  7. Guttag,J., Abstract data types... CACM 20 (1977), 396–404

    Article  Google Scholar 

  8. Hoare,C.A.R., Proof of correctness of data representation, Acta Informatica 1 (1972), 271–281

    Article  Google Scholar 

  9. Kfoury.D., Comparing algebraic structures up to algorithmic equivalence in Proc 1-st ICALP'72. North-Holland 1972

    Google Scholar 

  10. Kreczmar,A., Programmability in fields, Fundamenta Informaticae 1 (1977), 195–220

    MathSciNet  MATH  Google Scholar 

  11. Knuth,D., The art of computer programming, vol.3 Addison-Wesley 73

    Google Scholar 

  12. Liskov,B.M., Zilles,S.N., Programming with abstract data types Proc ACM SIGPLAN Symp. on Very High Level languages, SIGPLAN Notices 4 (1974), 50–59

    Article  Google Scholar 

  13. Mazur,S., Computable analysis, Dissertationes Mathematicae 33 (1963 PWN)Publ. Warsaw

    Google Scholar 

  14. Mirkowska, G., Algorithmic logic and its applications in the theory of programs, Fundamenta Informaticae 1 (1977), 1–17, 147–167

    MathSciNet  MATH  Google Scholar 

  15. Mirkowska, G.,Algorithmic logic with nondeterministic programs, Fundamenta informaticae 1 (1980), 45–64

    MathSciNet  MATH  Google Scholar 

  16. OKtaba.H., un algorithmic theory of reference, Ph.D. Thesis university of Warsaw 1981

    Google Scholar 

  17. Salwicki, A., On algorithmic theory of stacks in Proc.MFCS78 J.Winkowski ed. Lecture Notes in Comp.Sci. v. 64, 452–461

    Google Scholar 

  18. Salwicki,A., On the algorithmic theory of dictionaries, in Proc Logic of Programs E. Engeler ed. LNCS vol.125, 145–168

    Google Scholar 

  19. Scott,D., Data types as lattices, SIAM J.Comp. 5(1976), 522–587

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of informatics, University of Warsaw, p.o.box 1210, PL-00-901, Warsaw PKiN, Poland

    Andrzej Salwicki

Authors
  1. Andrzej Salwicki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salwicki, A. (1982). Algorithmic theories of data structures. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012792

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11576-2

  • Online ISBN: 978-3-540-39308-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation