Restructuring a concurrent refinement algebra

DOI10.1007/978-3-031-68279-7_9MaRDI QIDQ7013580zbMATH OpenFDO

Authors Ian Hayes, Larissa A. Meinicke, Naso Evangelou-Oost

Publication date 12 March 2025

Full work available at URL https://doi.org/10.1007/978-3-031-68279-7_9

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency
• An algebra of synchronous atomic steps
• An axiomatic basis for computer programming
• Calculi for synchrony and asynchrony
• Concurrent Kleene algebra and its foundations
• Designing a semantic model for a wide-spectrum language with concurrency
• Fixed-point calculus
• Generalised rely-guarantee concurrency: an algebraic foundation
• Guarded commands, nondeterminacy and formal derivation of programs
• scientific article; zbMATH DE number 3748394 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 605806 (Why is no real title available?)
• scientific article; zbMATH DE number 1748069 (Why is no real title available?)
• scientific article; zbMATH DE number 3302923 (Why is no real title available?)
• Monoidal functors, species and Hopf algebras
• Refinement Calculus
• Synchronous Kleene algebra
• Tentative steps toward a development method for interfering programs
• Towards a refinement algebra
• Types and invariants in the refinement calculus

This page was built for publication: Restructuring a concurrent refinement algebra

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