Stepwise refinement of parallel algorithms
From MaRDI portal
Publication:918204
DOI10.1016/0167-6423(90)90069-PzbMath0705.68057MaRDI QIDQ918204
Publication date: 1990
Published in: Science of Computer Programming (Search for Journal in Brave)
stepwise refinementrefinement calculusprogram transformationprogram derivationaction system formalism
Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01) Distributed algorithms (68W15)
Related Items (12)
A principle for sequential reasoning about distributed algorithms ⋮ LOGIC DERIVATION OF PARALLEL LINEAR EQUATION SYSTEM SOLVERS WITHIN ELIMINATION STRATEGY ⋮ Superposition refinement of reactive systems ⋮ Modeling adaptive behaviors in Context UNITY ⋮ Using refinement calculus techniques to prove linearizability ⋮ Refinement concepts formalised in higher order logic ⋮ Defining conditional independence using collapses ⋮ Transformation of programs for fault-tolerance ⋮ A principled exploration of coordination models ⋮ Kaisa Sere: in memoriam ⋮ Action systems, unbounded nondeterminism, and infinite traces ⋮ Program refinement in fair transition systems
This page was built for publication: Stepwise refinement of parallel algorithms
