Axiomatic semantics of communicating sequential processes

DOI10.1145/1780.1805MaRDI QIDQ3330490zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

verificationCSPpartial correctnessaxiomatic semanticscommunicating processesdistributed terminationabsence of deadlock

Mathematics Subject Classification ID

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

Recommendations

• Denotational semantics of program schemas for languages for communicating sequential processes
• scientific article; zbMATH DE number 4050949
• Denotational semantics of communicating sequential programs
• scientific article; zbMATH DE number 4062561
• Semantics of communicating processes

Cited in

(29)

• Transformations for communication fairness in CSP
• An evaluation of interaction paradigms for active objects
• Formal verification of a programming logic for a distributed programming language
• Axiomatic system for proving the properties of simple multimodule programs
• A Lattice-Theoretic Model for an Algebra of Communicating Sequential Processes
• 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
• The need for compositional proof systems: a survey
• scientific article; zbMATH DE number 2104634 (Why is no real title available?)
• scientific article; zbMATH DE number 1973989 (Why is no real title available?)
• 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
• A sound and complete reasoning system for asynchronous communication with shared futures
• Observed Communication Semantics for Classical Processes
• scientific article; zbMATH DE number 4051578 (Why is no real title available?)
• A singleton failures semantics for communicating sequential processes
• Total correctness of CSP programs
• scientific article; zbMATH DE number 4062561 (Why is no real title available?)
• A system for compositional verification of asynchronous objects
• scientific article; zbMATH DE number 3917688 (Why is no real title available?)
• scientific article; zbMATH DE number 3932376 (Why is no real title available?)
• Observable behavior of distributed systems: component reasoning for concurrent objects
• A weakest precondition semantics for communicating processes
• scientific article; zbMATH DE number 4050949 (Why is no real title available?)
• 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)