Pages that link to "Item:Q1306570"
From MaRDI portal
The following pages link to Reasoning algebraically about loops (Q1306570):
Displaying 18 items.
- An algebraic approach to computations with progress (Q299188) (← links)
- Generalised rely-guarantee concurrency: an algebraic foundation (Q333330) (← links)
- Algebras for iteration and infinite computations (Q715050) (← links)
- Derivation of concurrent programs by stepwise scheduling of Event-B models (Q736912) (← links)
- Enabledness and termination in refinement algebra (Q923890) (← links)
- Algebraic reasoning for probabilistic action systems and while-loops (Q938297) (← links)
- Automated verification of refinement laws (Q1037397) (← links)
- Mathematics for reasoning about loop functions (Q1044182) (← links)
- Refinement algebra for probabilistic programs (Q2268474) (← links)
- Infinite executions of lazy and strict computations (Q2347906) (← links)
- Loop formulas for circumscription (Q2457644) (← links)
- A theory for execution-time derivation in real-time programs (Q2576947) (← links)
- Unifying Lazy and Strict Computations (Q2915133) (← links)
- Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras (Q5098718) (← links)
- An Algebraic Approach to Refinement with Fair Choice (Q5403463) (← links)
- Domain Axioms for a Family of Near-Semirings (Q5505433) (← links)
- Algebra-Based Loop Analysis (Q6060345) (← links)
- Relation-algebraic verification of disjoint-set forests (Q6614547) (← links)