Specification of abstract dynamic-data types: A temporal logic approach

DOI10.1016/S0304-3975(96)00165-XzbMath0901.68122OpenAlexW1982962901MaRDI QIDQ1391733

Gianna Reggio, Gerardo Costa

Publication date: 22 July 1998

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

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00165-x

zbMATH Keywords

dynamic-data type

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65) Data structures (68P05)

Related Items

A formally grounded software specification method, Formalism and method, Swinging types=functions+relations+transition systems

Cites Work

• Petri nets and algebraic specifications
• On the interpretability of arithmetic in temporal logic
• The power of temporal proofs
• Incompleteness of first-order temporal logic with until
• Algebraic implementation of abstract data types
• Partial abstract types
• Constructivism in mathematics. An introduction. Volume I
• Conditional rewriting logic as a unified model of concurrency
• Observational structures and their logic
• Temporal theories as modularisation units for concurrent system specification
• Module algebra
• Specifying Concurrent Program Modules
• The hereditary partial effective functionals and recursion theory in higher types
• Object Specification Logic
• D-oids: a model for dynamic data-types
• Labelled transition logic: An outline
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item