Axiomatic semantics of communicating sequential processes

DOI10.1145/1780.1805zbMath0542.68013OpenAlexW2030590001MaRDI QIDQ3330490

N. Soundararajan

Publication date: 1984

Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1780.1805

zbMATH Keywords

verificationCSPaxiomatic semanticspartial correctnesscommunicating processesdistributed terminationabsence of deadlock

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items (14)

Total correctness of CSP programs ⋮ Transformations for communication fairness in CSP ⋮ A compositional proof system for distributed programs ⋮ Semantics and verification of monitors and systems of monitors and processes ⋮ Compositional reasoning about active objects with shared futures ⋮ A system for compositional verification of asynchronous objects ⋮ Observable behavior of distributed systems: component reasoning for concurrent objects ⋮ A sound and complete reasoning system for asynchronous communication with shared futures ⋮ An evaluation of interaction paradigms for active objects ⋮ Lazy behavioral subtyping ⋮ An introduction to compositional methods for concurrency and their application to real-time. ⋮ Formal verification of a programming logic for a distributed programming language ⋮ Correctness proofs of CSP programs ⋮ Observable Behavior of Dynamic Systems: Component Reasoning for Concurrent Objects

This page was built for publication: Axiomatic semantics of communicating sequential processes