Abstract representation theorems for demonic refinement algebras

DOI10.1016/j.jlap.2010.07.014zbMath1200.68070OpenAlexW2083577794MaRDI QIDQ604454

Jules Desharnais, Jean-Lou De Carufel

Publication date: 11 November 2010

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jlap.2010.07.014

zbMATH Keywords

terminationdemonic refinement algebradivergence operatorKleene algebra with domainrepresentation by pairs

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kleene getting lazy
• Relational algebraic semantics of deterministic and nondeterministic programs
• A completeness theorem for Kleene algebras and the algebra of regular events
• Towards a refinement algebra
• Algebraic Notions of Termination
• Latest News about Demonic Algebra with Domain
• Reactive Probabilistic Programs and Refinement Algebra
• Probabilistic Choice in Refinement Algebra
• Modal Semirings Revisited
• Refinement Algebra with Operators for Enabledness and Termination
• A generalized control structure and its formal definition
• Programming as a Discipline of Mathematical Nature
• Kleene algebra with domain
• Demonic Algebra with Domain
• Omega Algebra, Demonic Refinement Algebra and Commands
• On Two Dually Nondeterministic Refinement Algebras
• Domain Axioms for a Family of Near-Semirings
• Relational Methods in Computer Science