Non-deterministic data types: Models and implementations
The model theoretic basis for (abstract) data types is generalized from algebras to multi-algebras in order to cope with non-deterministic operations. A programming oriented definition and a model theoretic criterion (called simulation) for implementation of data types are given. To justify the criterion w.r.t. the definition, an abstract framework linking denotational semantics of programming languages and model theory of data types is set up. A set of constraints on a programming language semantics are derived which guarantee that simulation implies implementation. It is argued that any language supporting data abstraction does fulfill these constraints. As an example a simple but expressive language L is defined and it is formally proved that L does conform to these restrictions.
- scientific article; zbMATH DE number 827943
- scientific article; zbMATH DE number 4088907
- scientific article; zbMATH DE number 3876560
- Encapsulating non-determinacy in an abstract data type with determinate semantics
- On Models of a Nondeterministic Computation
- Deterministic and nondeterministic computation, and horn programs, on abstract data types
- Non-deterministic structures of computation
- scientific article; zbMATH DE number 7356679
- scientific article; zbMATH DE number 3854400
- A calculus of communicating systems
- Algebraic laws for nondeterminism and concurrency
- Behavioural correctness of data representations
- scientific article; zbMATH DE number 3814961 (Why is no real title available?)
- scientific article; zbMATH DE number 3819086 (Why is no real title available?)
- scientific article; zbMATH DE number 3821084 (Why is no real title available?)
- scientific article; zbMATH DE number 3898213 (Why is no real title available?)
- scientific article; zbMATH DE number 3898224 (Why is no real title available?)
- scientific article; zbMATH DE number 3956411 (Why is no real title available?)
- scientific article; zbMATH DE number 3660783 (Why is no real title available?)
- scientific article; zbMATH DE number 3714908 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3723898 (Why is no real title available?)
- scientific article; zbMATH DE number 3765116 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 3799587 (Why is no real title available?)
- scientific article; zbMATH DE number 3802794 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- Partial abstract types
- Partial algebras-survey of a unifying approach towards a two-valued model theory for partial algebras
- Proof of correctness of data representations
- Algebraic specification of documents
- The behavior-realization adjunction and generalized homomorphic relations
- Parallel composition and decomposition of specifications
- Specification and verification of object-oriented programs using supertype abstraction
- Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification
- scientific article; zbMATH DE number 4088907 (Why is no real title available?)
- scientific article; zbMATH DE number 3999266 (Why is no real title available?)
- scientific article; zbMATH DE number 827943 (Why is no real title available?)
- Generated models and the -rule: the nondeterministic case
- Prespecification in data refinement
- Typed homomorphic relations extended with subtypes
- Data types in subdefinite models
- Probabilistic datatypes
- A systematic study of models of abstract data types
- Splitting atoms safely
This page was built for publication: Non-deterministic data types: Models and implementations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058286)
