Observing Non-Deterministic Data Types

[1]  K. Larsen Context-dependent bisimulation between processes , 1986 .

[2]  J. Lloyd Foundations of Logic Programming , 1984, Symbolic Computation.

[3]  Oliver Schoett,et al.  Data abstraction and the correctness of modular programming , 1986 .

[4]  Ugo Montanari,et al.  Observability Concepts in Abstract Data Type Specifications , 1976, MFCS.

[5]  C. A. R. Hoare,et al.  Proof of correctness of data representation , 1975, Language Hierarchies and Interfaces.

[6]  Cliff B. Jones,et al.  Systematic software development using VDM , 1986, Prentice Hall International Series in Computer Science.

[7]  Matthew Hennessy,et al.  Powerdomains and nondeterministic recursive definitions , 1982, Symposium on Programming.

[8]  John C. Mitchell,et al.  Representation independence and data abstraction , 1986, POPL '86.

[9]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[10]  Jean Vuillemin Correct and Optimal Implementations of Recursion in a Simple Programming Language , 1974, J. Comput. Syst. Sci..

[11]  M. Broy,et al.  Extensional behaviour of concurrent, nondeterministic, communicating systems , 1986 .

[12]  Tony Hoare,et al.  Data Refinement in a Categorical Setting , 1987 .

[13]  José Meseguer,et al.  Universal Realization, Persistent Interconnection and Implementation of Abstract Modules , 1982, ICALP.

[14]  C. A. R. Hoare,et al.  Data Refinement Refined , 1986, ESOP.

[15]  Gregor von Bochmann,et al.  On the Construction of Submodule Specifications and Communication Protocols , 1983, TOPL.

[16]  Tobias Nipkow Are Homomorphisms Sufficient for Behavioural Implementations of Deterministic and Nondeterministic Data Types? , 1987, STACS.

[17]  Rocco De Nicola,et al.  Testing Equivalence for Processes , 1983, ICALP.

[18]  Samson Abramsky,et al.  On Semantic Foundations for Applicative Multiprogramming , 1983, ICALP.

[19]  Samuel N. Kamin Final Data Types and Their Specification , 1983, TOPL.

[20]  Klaus Bothe A Comparative Study of Abstract Data Type Concepts , 1981, J. Inf. Process. Cybern..

[21]  Stephen D. Brookes,et al.  Behavioural Equivalence Relations Induced by Programming Logics , 1983, ICALP.

[22]  Manfred Broy,et al.  A Theory for Nondeterminism, Parallelism, Communication, and Concurrency , 1986, Theor. Comput. Sci..

[23]  Donald Sannella,et al.  On Observational Equivalence and Algebraic Specification , 1985, TAPSOFT, Vol.1.