Proving the correctness of behavioural implementations

DOI10.1007/3-540-60043-4_51zbMath1496.68199OpenAlexW1547567140MaRDI QIDQ5096383

Michel Bidoit, Rolf Hennicker

Publication date: 16 August 2022

Published in: Algebraic Methodology and Software Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60043-4_51

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (3)

Object-oriented hybrid systems of coalgebras plus monoid actions ⋮ Swinging types=functions+relations+transition systems ⋮ Behavioural satisfaction and equivalence in concrete model categories

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Behavioural theories and the proof of behavioural properties
• Toward formal development of programs from algebraic specifications: Implementations revisited
• Modular correctness proofs of behavioural implementations
• Behavioural and abstractor specifications
• Proof of correctness of data representations

This page was built for publication: Proving the correctness of behavioural implementations