Refinement Algebra with Operators for Enabledness and Termination

DOI10.1007/11783596_23MaRDI QIDQ3618834zbMATH OpenOpenAlexFDO

Authors Kim Solin, Joakim von Wright

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Enabledness and termination in refinement algebra
• Probabilistic Choice in Refinement Algebra
• On the Structure of Demonic Refinement Algebras with Enabledness and Termination
• On Two Dually Nondeterministic Refinement Algebras
• Refinement algebra for probabilistic programs

Cited in

(17)

• Refinement algebra for probabilistic programs
• Algebraic Notions of Termination
• Encoding and decoding in refinement algebra
• 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
• Invariants and well-foundedness in program algebra
• Omega Algebra, Demonic Refinement Algebra and Commands
• On Two Dually Nondeterministic Refinement Algebras
• Domain Axioms for a Family of Near-Semirings
• Abstract representation theorems for demonic refinement algebras
• Normal design algebra
• Enabledness and termination in refinement algebra
• Algebraic reasoning for probabilistic action systems and while-loops

This page was built for publication: Refinement Algebra with Operators for Enabledness and Termination

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