Reasoning algebraically about loops
From MaRDI portal
Recommendations
Cited in
(22)- Automated verification of refinement laws
- Mathematics for reasoning about loop functions
- Refinement algebra for probabilistic programs
- Infinite executions of lazy and strict computations
- Loop formulas for circumscription
- A theory for execution-time derivation in real-time programs
- Unifying lazy and strict computations
- An algebraic approach to computations with progress
- Generalised rely-guarantee concurrency: an algebraic foundation
- Stone Kleene
- A proof rule for control loops
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
- An algebraic approach to refinement with fair choice
- Domain Axioms for a Family of Near-Semirings
- Algebra-Based Loop Analysis
- Relation-algebraic verification of disjoint-set forests
- Algebras for iteration and infinite computations
- Formalization of Refinement Calculus for Reactive Systems
- Algebra of Monotonic Boolean Transformers
- Derivation of concurrent programs by stepwise scheduling of Event-B models
- Enabledness and termination in refinement algebra
- Algebraic reasoning for probabilistic action systems and while-loops
This page was built for publication: Reasoning algebraically about loops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306570)
