Fixpoints for general correctness
From MaRDI portal
Publication:549677
DOI10.1016/j.jlap.2011.04.004zbMath1216.68073OpenAlexW1974600686WikidataQ128988566 ScholiaQ128988566MaRDI QIDQ549677
Publication date: 18 July 2011
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.2011.04.004
recursionmediandistributive latticesemiringprogram semanticsfixpointEgli-Milner ordergeneral correctness
Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Semantics in the theory of computing (68Q55) Semirings (16Y60) Distributive lattices (06D99)
Related Items (3)
Unifying Lazy and Strict Computations ⋮ Multirelations with infinite computations ⋮ Algebras for iteration and infinite computations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Internal axioms for domain semirings
- Kleene under a modal demonic star
- Kleene getting lazy
- A Hofmann-Mislove theorem for bitopological spaces
- A theory for nondeterminism, parallelism, communication, and concurrency
- Chain-complete posets and directed sets with applications
- A completeness theorem for Kleene algebras and the algebra of regular events
- A relation algebraic model of robust correctness
- Relation-algebraic semantics
- A fixpoint theory for non-monotonic parallelism
- General correctness: A unification of partial and total correctness
- Unifying Recursion in Partial, Total and General Correctness
- Partial, Total and General Correctness
- Reasoning about Loops in Total and General Correctness
- The Linear Algebra of UTP
- General Correctness Algebra
- Bilattices and the semantics of logic programming
- A Transformation System for Developing Recursive Programs
- Domain Axioms for a Family of Near-Semirings
- Ternary Boolean algebra
- A ternary operation in distributive lattices
- Relational Methods in Computer Science
This page was built for publication: Fixpoints for general correctness
