Specifications, models, and implementations of data abstractions

DOI10.1016/0304-3975(82)90097-4zbMath0478.68021OpenAlexW2051800122WikidataQ126849121 ScholiaQ126849121MaRDI QIDQ1161277

Mitchell Wand

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90097-4

zbMATH Keywords

specification languageabstract data typesDLPfirst order dynamic logicverification of modules

Mathematics Subject Classification ID

Data structures (68P05)

Related Items

Toward formal development of programs from algebraic specifications: Implementations revisited, Functional un\(|\)unparsing, The meaning of specifications I: Domains and initial models, Abstract implementation of algebraic specifications in a temporal logic language, Swinging types=functions+relations+transition systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Final algebra semantics and data type extensions
• Hierarchical program specification and verification - a many-sorted logical approach
• Extended directed graphs, a formalism for structured data and data structures
• Proving programs correct through refinement
• On the many facets of lists
• Proof of correctness of data representations
• An Introduction to the Construction and Verification of Alphard Programs
• Proof techniques for hierarchically structured programs
• Abstraction mechanisms in CLU
• Extensions and implementations of abstract data type specifications
• An example of hierarchical design and proof
• Abstract data types and software validation
• Programming as a Discipline of Mathematical Nature
• A practical decision method for propositional dynamic logic (Preliminary Report)