Invariants for the construction of a handshake register

DOI10.1016/S0020-0190(98)00158-6zbMATH Open1339.68091OpenAlexW2160457140MaRDI QIDQ293438FDOQ293438

Authors: W. H. Hesselink 

Publication date: 9 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001586?np=y

Recommendations

• An assertional criterion for atomicity
• An assertional proof for a construction of an atomic variable
• Wait-free linearization with a mechanical proof
• How a rainbow coloring function can simulate wait-free handshaking
• scientific article; zbMATH DE number 4096767

zbMATH Keywords

distributed computinginvariantghost variablehandshakeregisterwaitfree

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Cites Work

• On interprocess communication. II: Algorithms
• Title not available (Why is that?)
• An axiomatic proof technique for parallel programs

Cited In (7)

• Decomposing monolithic processes in a process algebra with multi-actions
• How a rainbow coloring function can simulate wait-free handshaking
• State space reduction of linear processes using control flow reconstruction
• Partial-order reduction for parity games with an application on parameterised Boolean equation systems
• Exponential automatic amortized resource analysis
• Priority promotion with Parysian flair
• Decomposing monolithic processes in a process algebra with multi-actions

This page was built for publication: Invariants for the construction of a handshake register

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