Non-deterministic data types: Models and implementations

DOI10.1007/BF00263649zbMath0564.68013MaRDI QIDQ1058286

Tobias Nipkow

Publication date: 1986

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

denotational semantics of programming languagesimplementation of data typesmodel theory of data typesmulti-algebrasnon-deterministic operations

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Specification and verification of object-oriented programs using supertype abstraction, Splitting atoms safely, Algebraic specification of documents, Generated models and the ω-rule: The nondeterministic case, The behavior-realization adjunction and generalized homomorphic relations, Typed homomorphic relations extended with subtypes, Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification, Prespecification in data refinement, Parallel composition and decomposition of specifications

Cites Work

• Behavioural correctness of data representations
• A calculus of communicating systems
• 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 laws for nondeterminism and concurrency
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item