On the suitability of trace semantics for modular proofs of communicating processes

DOI10.1016/0304-3975(85)90130-6zbMath0567.68018OpenAlexW2009408666MaRDI QIDQ1060004

Heikki Mannila, Ralph-Johan Back

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0304-3975(85)90130-6

zbMATH Keywords

partial correctness assertionscommunicating processesmodular proof systemsemantic model

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (2)

A fully abstract trace model for dataflow and asynchronous networks ⋮ Towards a complete hierarchy of compositional dataflow models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-history semantics for languages for distributed programming
• A calculus of communicating systems
• Deadlock absence proofs for networks of communicating processes
• A calculus of total correctness for communicating processes
• A Theory of Communicating Sequential Processes
• A Proof System for Communicating Sequential Processes
• Processes and the denotational semantics of concurrency
• An axiomatic basis for computer programming

This page was built for publication: On the suitability of trace semantics for modular proofs of communicating processes