Compositional transformational design for concurrent programs

DOI10.1007/3-540-49213-5_24MaRDI QIDQ7010058zbMATH OpenFDO

Authors Job Zwiers

Publication date 19 March 2025

Full work available at URL https://doi.org/10.1007/3-540-49213-5_24

Mathematics Subject Classification ID

Temporal logic (03B44) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Cites work

• A Distributed Algorithm for Minimum-Weight Spanning Trees
• A principle for sequential reasoning about distributed algorithms
• Adequate proof principles for invariance and liveness properties of concurrent programs
• Decomposition of distributed programs into communication-closed layers
• From sequential layers to distributed processes
• scientific article; zbMATH DE number 3976314 (Why is no real title available?)
• scientific article; zbMATH DE number 140256 (Why is no real title available?)
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• scientific article; zbMATH DE number 4119618 (Why is no real title available?)
• Modeling concurrency with partial orders
• Specifying Concurrent Program Modules
• Verification of distributed programs using representative interleaving sequences

This page was built for publication: Compositional transformational design for concurrent programs

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