An axiomatic semantics for nested concurrency

DOI10.1007/BF01933742MaRDI QIDQ1077155zbMATH OpenFDO

Authors Sigurd Meldal

Publication date 1986

Published in BIT (Search for Journal in Brave)

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

zbMATH Keywords

axiomatic semanticsconcurrent CSP programsHoare's language CSPmodular verificationnested concurrencyprocess compositiontransformation rules

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• scientific article; zbMATH DE number 3902009
• A Complete Axiomatic Semantics for the CSP Stable-Failures Model
• scientific article; zbMATH DE number 3932376
• Algebraic laws for nondeterminism and concurrency
• Semantics and verification of monitors and systems of monitors and processes

Cites work

• A Proof System for Communicating Sequential Processes
• A proof technique for communicating sequential processes
• An axiomatic semantics for nested concurrency
• Communicating sequential processes
• scientific article; zbMATH DE number 3714897 (Why is no real title available?)
• Soundness and Completeness of an Axiom System for Program Verification

Cited in

(8)

• An axiomatic semantics for nested concurrency
• Partial correctness of exits from concurrent structures
• Semantics and verification of monitors and systems of monitors and processes
• scientific article; zbMATH DE number 3932376 (Why is no real title available?)
• A Complete Axiomatic Semantics for the CSP Stable-Failures Model
• A sound and complete axiomatization of embedded cross dependencies
• A complete axiomatic semantics of spawning
• Step semantics for ``true concurrency with recursion

Describes a project that uses

Uses Software

• Ada95

This page was built for publication: An axiomatic semantics for nested concurrency

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077155)