Skip to main content
SpringerLink
Log in
Book cover

Workshop on the Specification of Abstract Data Types

ADT 1987: Recent Trends in Data Type Specification pp 170–183Cite as

Observing nondeterministic data types

  • Conference paper
  • First Online:

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

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. S. Abramsky: On Semantic Foundations of Applicative Multiprogramming, in Proc. 10th ICALP, LNCS 154, pp. 1–14, 1983

    Google Scholar 

  2. K. Bothe: A Comparative Study of Abstract Data Type Concepts, Elektronische Informationsverarbeitung und Kybernetik 17 (1981), 237–257

    Google Scholar 

  3. S.D. Brookes, W.C. Rounds: Behavioural Equivalence Relations Induced by Programming Logics, in Proc. 10th ICALP, LNCS 154, 1983

    Google Scholar 

  4. M. Broy: A Theory for Nondeterminism, Parallelism, Communication, and Concurrency, TCS 45 (1986), pp. 1–61

    Google Scholar 

  5. M. Broy: Extensional Behaviour of Concurrent, Nondeterministic, Communicating Systems, in Control Flow and Data Flow: Concepts of Distributed Programming (M. Broy, ed.), Springer Verlag, 1985

    Google Scholar 

  6. R. de Nicola, M.C.B. Hennessy: Testing Equivalences for Processes, in Proc. 10th ICALP, LNCS 154, pp. 548–560, 1983. Full version in TCS 34, pp.83–133, 1984

    Google Scholar 

  7. V. Giarratana, F. Gimona, U. Montanari: Observability Concepts in Abstract Data Type Specifications, in: 5th MFCS, LNCS 45, 1976

    Google Scholar 

  8. J.A. Goguen, J. Meseguer: Universal Realization, Persistent Interconnection and Implementation of Abstract Modules, in: Proc. ICALP '82, LNCS 140, 1982

    Google Scholar 

  9. J. He, C.A.R. Hoare, J.W. Sanders: Data Refinement Refined, Proc. ESOP'86, LNCS 213, 1986

    Google Scholar 

  10. C.A.R. Hoare: Proof of Correctness of Data Representation, Acta Informatica 1, 1972

    Google Scholar 

  11. C.A.R. Hoare: Data Refinement in a Categorical Setting, Manuscript, June 1987

    Google Scholar 

  12. C.B. Jones: Systematic Software Development Using VDM, Prentice-Hall International, 1986

    Google Scholar 

  13. M.C.B. Hennessy: Powerdomains and Nondeterministic Recursive Definitions, LNCS 137, pp. 178–193, 1982

    Google Scholar 

  14. S. Kamin: Final Data Types and their Specification, TOPLAS 5, 1, 1983

    Google Scholar 

  15. K.G. Larsen: Context-Dependent Bisimulations Between Processes, PhD Thesis, Tech. Rep. CST-37-86, Dept. of Comp. Sci., Univ. of Edinburgh, 1986

    Google Scholar 

  16. J.W. Lloyd: Foundations of Logic Programming, Springer Verlag, 1984

    Google Scholar 

  17. J.C. Mitchell: Representation Independence and Data Abstraction (Preliminary Version), in Proc. 13th POPL (1986), pp. 263–286

    Google Scholar 

  18. T. Nipkow: Nondeterministic Data Types: Models and Implementations, Acta Informatica 22, pp. 629–661, 1986

    Google Scholar 

  19. T. Nipkow: Are Homomorphisms Sufficient for Behavioural Implementations of Deterministic and Nondeterministic Data Types?, in Proc. 4th STACS, LNCS 247, pp. 260–271, 1987

    Google Scholar 

  20. T. Nipkow: Behavioural Implementations Concepts for Nondeterministic Data Types, PhD Thesis, Tech. Rep. UMCS-87-5-3, Dept. of Comp. Sci., The Univ. of Manchester, 1987

    Google Scholar 

  21. H. Reichel: Behavioural Equivalence: A Unifying Concept for Initial and Final Specification Methods, in: Proc. 3rd Hung. Comp. Sci. Conf., (M. Arato, L. Varga, eds.), Budapest, 1981, 27–39

    Google Scholar 

  22. D. Sannella, A. Tarlecki: On Observational Equivalence and Algebraic Specification, Proc. CAAP'85, LNCS 185, 308–322

    Google Scholar 

  23. O. Schoett: Ein Modulkonzept in der Theorie Abstrakter Datentypen, Report IfI-HH-B-81/81, Universität Hamburg, Fachbereich Informatik, 1981

    Google Scholar 

  24. O. Schoett: Data Abstraction and the Correctness of Modular Programming, PhD Thesis, Tech. Rep. CST-42-87, Dept. of Comp. Sci., Univ. of Edinburgh, 1987

    Google Scholar 

  25. M.B. Smyth: Power Domains, JCCS 2, pp. 23–36, 1978

    Google Scholar 

  26. M.H. van Emden, R.A. Kowalski: The Semantics of Predicate Logic as a Programming Language, JACM 23, 4, pp. 733–742, 1976

    Google Scholar 

  27. J. Vuillemin: Correct and Optimal Implementation of Recursion in a Simple Programming Language, JCSS 9 (1974), 332–354

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, 02139, Cambridge, MA

    Tobias Nipkow

Authors
  1. Tobias Nipkow
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

D. Sannella A. Tarlecki

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nipkow, T. (1988). Observing nondeterministic data types. In: Sannella, D., Tarlecki, A. (eds) Recent Trends in Data Type Specification. ADT 1987. Lecture Notes in Computer Science, vol 332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50325-0_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-50325-0_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50325-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation