Stabilization-preserving atomicity refinement

DOI10.1006/JPDC.2001.1828MaRDI QIDQ701138zbMATH OpenOpenAlexFDO

Authors Anish Arora, Mikhail Nesterenko

Publication date 16 October 2002

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/5a1d73c1b7c5853bd091051cb0c95053a60f49fa

zbMATH Keywords

program refinements

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Nonnumerical algorithms (68W05)

Recommendations

• General refinement. II: Flexible refinement
• Program refinement in fair transition systems
• Information flow in systems with schedulers. II: Refinement
• Proving Linearizability Via Non-atomic Refinement
• Compositional verification of termination-preserving refinement of concurrent programs

Cited in

(13)

• Tiara: a self-stabilizing deterministic skip list and skip graph
• An optimal self-stabilizing strarvation-free alternator
• Optimal 1-fair alternators
• A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs
• The alternator
• Unifying stabilization and termination in message-passing systems
• Liveness-Preserving Atomicity Abstraction
• A new analysis of a self-stabilizing maximum weight matching algorithm with approximation ratio 2
• Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
• Stabilizing maximum matching in bipartite networks
• Linear time self-stabilizing colorings
• Alternators in read/write atomicity
• Distance-\(k\) knowledge in self-stabilizing algorithms

This page was built for publication: Stabilization-preserving atomicity refinement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q701138)