Specifying modules to satisfy interfaces: A state transition system approach

DOI10.1007/BF02276640zbMath0748.68014OpenAlexW2054727993MaRDI QIDQ1193606

A. Udaya Shankar, Simon S. Lam

Publication date: 27 September 1992

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02276640

zbMATH Keywords

verificationinterfacemoduletwo-phase lockingLake Arrowhead Workshopmulti-version timestampsspecification of a serializable database

Mathematics Subject Classification ID

Database theory (68P15) Abstract data types; algebraic specification (68Q65)

Related Items (2)

Proving possibility properties ⋮ Composing leads-to properties

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adequate proof principles for invariance and liveness properties of concurrent programs
• The existence of refinement mappings
• An assertional correctness proof of a distributed algorithm
• Protocol Verification via Projections
• Proving Liveness Properties of Concurrent Programs

This page was built for publication: Specifying modules to satisfy interfaces: A state transition system approach