On the public citation graph

A theorem on atomicity in distributed algorithms

https://doi.org/10.1007/bf01786631
0 signed · 47 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1016/0020-0190(85)90056-0openalex-snapshot
Defining liveness
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/361227.361234openalex-snapshot
Reduction
inferredcites →https://doi.org/10.1145/512950.512965openalex-snapshot
Parallel program correctness through refinement

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jpdc.2001.1792openalex-snapshot
A Quorum-Based Self-Stabilizing Distributed Mutual Exclusion Algorithm
inferred← citeshttps://doi.org/10.1007/10722010_4openalex-snapshot
Separation and Reduction
inferred← citeshttps://doi.org/10.1007/10722468_12openalex-snapshot
Abstraction of Communication Channels in Promela: A Case Study
inferred← citeshttps://doi.org/10.1007/3-540-52592-0_62openalex-snapshot
Development of concurrent systems by incremental transformation
inferred← citeshttps://doi.org/10.1007/3-540-54099-7_11openalex-snapshot
Stepwise development of a distributed load balancing algorithm
inferred← citeshttps://doi.org/10.1007/3540539816_73openalex-snapshot
Refining interfaces of communicating systems
inferred← citeshttps://doi.org/10.1007/978-1-4614-4881-5_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-1-4614-4881-5_6openalex-snapshot
Programs, Semantics and Effective Atomicity
inferred← citeshttps://doi.org/10.1007/978-3-642-19237-1_13openalex-snapshot
Synthesizing Solutions to the Leader Election Problem Using Model Checking and Genetic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-84542-0_7openalex-snapshot
Extending the Techniques to Parallel Programs
inferred← citeshttps://doi.org/10.1007/bfb0028760openalex-snapshot
A general approach to partial order reductions in symbolic verification
inferred← citeshttps://doi.org/10.1007/s00165-012-0250-7openalex-snapshot
Using refinement calculus techniques to prove linearizability
inferred← citeshttps://doi.org/10.1016/0167-6423(90)90020-eopenalex-snapshot
Stepwise refinement and concurrency: the finite-state case
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90053-1openalex-snapshot
Global serializability of concurrent programs
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.02.016openalex-snapshot
Trace-based Derivation of a Lock-Free Queue Algorithm
inferred← citeshttps://doi.org/10.1016/j.jcss.2009.11.008openalex-snapshot
Efficiently supporting secure and reliable collaboration in scientific workflows
inferred← citeshttps://doi.org/10.1109/71.363410openalex-snapshot
An (N-1)-resilient algorithm for distributed termination detection
inferred← citeshttps://doi.org/10.1109/apsec.2007.32openalex-snapshot
Checking Distributed Programs with Partially Ordered Atoms
inferred← citeshttps://doi.org/10.1109/aspec.2007.39openalex-snapshot
Checking Distributed Programs with Partially Ordered Atoms
inferred← citeshttps://doi.org/10.1109/ccece.2011.6030585openalex-snapshot
Block-based atomicity to simplify the verification of distributed applications
inferred← citeshttps://doi.org/10.1109/dasc.2007.24openalex-snapshot
Using Atoms to Simplify Distributed Programs Checking
inferred← citeshttps://doi.org/10.1109/dasc.2007.30openalex-snapshot
Author Index
inferred← citeshttps://doi.org/10.1109/iccl.1994.288373openalex-snapshot
State space reduction in abstract interpretation of parallel programs
inferred← citeshttps://doi.org/10.1109/iceccs.2007.39openalex-snapshot
Reasoning about Nonblocking Concurrency using Reduction
inferred← citeshttps://doi.org/10.1109/icpads.1997.652603openalex-snapshot
Efficient distributed deadlock detection and resolution using probes, tokens, and barriers
inferred← citeshttps://doi.org/10.1109/icpads.2007.4447747openalex-snapshot
Using synchronized atoms to check distributed programs
inferred← citeshttps://doi.org/10.1109/pdcat.2007.31openalex-snapshot
A Fault Tolerant Topology Control Algorithm for Large-Scale Sensor Networks
inferred← citeshttps://doi.org/10.1109/pdcat.2007.56openalex-snapshot
Detecting Atomicity Errors in Message Passing Programs
inferred← citeshttps://doi.org/10.1109/sbcci.1999.802970openalex-snapshot
Interface design and refinement using state-based techniques
inferred← citeshttps://doi.org/10.1109/spdp.1992.242734openalex-snapshot
An (N-1)-resilient algorithm for distributed termination detection
inferred← citeshttps://doi.org/10.1145/158439.158441openalex-snapshot
An introduction to assertional reasoning for concurrent systems
inferred← citeshttps://doi.org/10.1145/2815400.2815428openalex-snapshot
IronFleet
inferred← citeshttps://doi.org/10.1145/3513259openalex-snapshot
Deconstructing the bakery to build a distributed state machine
inferred← citeshttps://doi.org/10.1145/383043.383044openalex-snapshot
Synthesis of concurrent programs for an atomic read/write model of computation
inferred← citeshttps://doi.org/10.14569/ijacsa.2012.031025openalex-snapshot
A Harmony Search Based Algorithm for Detecting Distributed Predicates
inferred← citeshttps://doi.org/10.26083/tuprints-00006610openalex-snapshot
Automated Security Analysis of Virtualized Infrastructures
inferred← citeshttps://doi.org/10.3217/jucs-015-01-0072openalex-snapshot
Reasoning about Nonblocking Concurrency
inferred← citeshttps://doi.org/10.4018/978-1-4666-0089-8.ch003openalex-snapshot
Runtime Verification of Distributed Programs
inferred← citeshttps://doi.org/10.4018/978-1-5225-3686-4.ch009openalex-snapshot
A Genetic-Algorithms-Based Technique for Detecting Distributed Predicates
inferred← citeshttps://doi.org/10.4018/978-1-7998-8048-6.ch025openalex-snapshot
A Genetic-Algorithms-Based Technique for Detecting Distributed Predicates
inferred← citeshttps://doi.org/10.4018/jiit.2013010104openalex-snapshot
Detecting Distributed Predicates Using Genetic Algorithms
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.