Axiomatic semantics of communicating sequential processes
DOI10.1145/1780.1805zbMATH Open0542.68013OpenAlexW2030590001MaRDI QIDQ3330490FDOQ3330490
Authors: 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
Recommendations
verificationCSPpartial correctnessaxiomatic semanticscommunicating processesdistributed terminationabsence of deadlock
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Cited In (28)
- Transformations for communication fairness in CSP
- An evaluation of interaction paradigms for active objects
- Axiomatic system for proving the properties of simple multimodule programs
- A Lattice-Theoretic Model for an Algebra of Communicating Sequential Processes
- Formal verification of a programming logic for a distributed programming language
- Semantics and verification of monitors and systems of monitors and processes
- Observable behavior of dynamic systems: component reasoning for concurrent objects
- A compositional proof system for distributed programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Denotational semantics of program schemas for languages for communicating sequential processes
- Lazy behavioral subtyping
- Compositional reasoning about active objects with shared futures
- Separation Logic Semantics for Communicating Processes
- Observed Communication Semantics for Classical Processes
- A sound and complete reasoning system for asynchronous communication with shared futures
- Title not available (Why is that?)
- A singleton failures semantics for communicating sequential processes
- Title not available (Why is that?)
- Total correctness of CSP programs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A system for compositional verification of asynchronous objects
- Observable behavior of distributed systems: component reasoning for concurrent objects
- Title not available (Why is that?)
- A weakest precondition semantics for communicating processes
- Correctness proofs of CSP programs
- An introduction to compositional methods for concurrency and their application to real-time.
This page was built for publication: Axiomatic semantics of communicating sequential processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3330490)
