Refinement Algebra with Operators for Enabledness and Termination
From MaRDI portal
Publication:3618834
DOI10.1007/11783596_23zbMath1235.68060OpenAlexW1722478857MaRDI QIDQ3618834
Publication date: 2 April 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11783596_23
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (12)
Normal design algebra ⋮ Abstract representation theorems for demonic refinement algebras ⋮ Latest News about Demonic Algebra with Domain ⋮ On the Structure of Demonic Refinement Algebras with Enabledness and Termination ⋮ Reactive Probabilistic Programs and Refinement Algebra ⋮ Knowledge and Games in Modal Semirings ⋮ Probabilistic Choice in Refinement Algebra ⋮ Modal Semirings Revisited ⋮ Enabledness and termination in refinement algebra ⋮ Algebraic reasoning for probabilistic action systems and while-loops ⋮ Refinement algebra for probabilistic programs ⋮ Domain Axioms for a Family of Near-Semirings
This page was built for publication: Refinement Algebra with Operators for Enabledness and Termination