Reasoning algebraically about loops
From MaRDI portal
Publication:1306570
DOI10.1007/s002360050163zbMath0940.68011OpenAlexW2016265082MaRDI QIDQ1306570
Publication date: 9 November 1999
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002360050163
Related Items
An algebraic approach to computations with progress ⋮ Unifying Lazy and Strict Computations ⋮ Generalised rely-guarantee concurrency: an algebraic foundation ⋮ Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras ⋮ Enabledness and termination in refinement algebra ⋮ Algebraic reasoning for probabilistic action systems and while-loops ⋮ An Algebraic Approach to Refinement with Fair Choice ⋮ Refinement algebra for probabilistic programs ⋮ Algebras for iteration and infinite computations ⋮ Derivation of concurrent programs by stepwise scheduling of Event-B models ⋮ Automated verification of refinement laws ⋮ Mathematics for reasoning about loop functions ⋮ Domain Axioms for a Family of Near-Semirings ⋮ A theory for execution-time derivation in real-time programs ⋮ Infinite executions of lazy and strict computations
