On the public citation graph
A Principle for Sequential Reasoning about Distributed Algorithms
0 signed · 49 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-17179-7_20openalex-snapshot
On proving communication closedness of distributed layers
inferredcites →https://doi.org/10.1007/3-540-51305-1_7openalex-snapshot
Stepwise refinement of action systems
inferredcites →https://doi.org/10.1007/3-540-51687-5_47openalex-snapshot
Designing distributed algorithms by means of formal sequentially phased reasoning
inferredcites →https://doi.org/10.1007/3-540-54430-5_96openalex-snapshot
Action systems and action refinement in the development of parallel systems
inferredcites →https://doi.org/10.1007/978-1-4612-0931-7openalex-snapshot
The Temporal Logic of Reactive and Concurrent Systems
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bf01211079openalex-snapshot
A functional logic for higher level reasoning about computation
inferredcites →https://doi.org/10.1007/bf03259394openalex-snapshot
A Principle for Sequential Reasoning about Distributed Algorithms
inferredcites →https://doi.org/10.1007/bfb0013032openalex-snapshot
An efficient verification method for parallel and distributed programs
inferredcites →https://doi.org/10.1016/0020-0190(76)90073-9openalex-snapshot
Information Processing Letters
inferredcites →https://doi.org/10.1016/0020-0190(80)90021-6openalex-snapshot
Termination detection for diffusing computations
inferredcites →https://doi.org/10.1016/0167-6423(83)90013-8openalex-snapshot
Decomposition of distributed programs into communication-closed layers
inferredcites →https://doi.org/10.1016/0304-3975(92)90054-jopenalex-snapshot
Defining conditional independence using collapses
inferredcites →https://doi.org/10.1016/0376-5075(82)90108-8openalex-snapshot
Protocol specification, testing, and verification
inferredcites →https://doi.org/10.1038/160112a0openalex-snapshot
Tata Institute of Fundamental Research
inferredcites →https://doi.org/10.1109/tcom.1979.1094552openalex-snapshot
A Failsafe Distributed Routing Protocol
inferredcites →https://doi.org/10.1109/tcom.1983.1095883openalex-snapshot
A Distributed Algorithm for Minimum Weight Directed Spanning Trees
inferredcites →https://doi.org/10.1109/tit.1983.1056620openalex-snapshot
Distributed network protocols
inferredcites →https://doi.org/10.1145/135419.135461openalex-snapshot
From sequential layers to distributed processes
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.1145/579.583openalex-snapshot
Using message passing for distributed programming: proof rules and disciplines
inferredcites →https://doi.org/10.1145/62546.62556openalex-snapshot
Understanding and verifying distributed algorithms using stratified decomposition
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11561927_18openalex-snapshot
Causing Communication Closure: Safe Program Composition with Non-FIFO Channels
inferred← citeshttps://doi.org/10.1007/11603771_4openalex-snapshot
Safe Composition of Distributed Programs Communicating over Order-Preserving Imperfect Channels
inferred← citeshttps://doi.org/10.1007/3-540-45352-0_2openalex-snapshot
Issues in the Refinement of Distributed Programs
inferred← citeshttps://doi.org/10.1007/3-540-48068-4_22openalex-snapshot
Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_24openalex-snapshot
Compositional Transformational Design for Concurrent Programs
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_141openalex-snapshot
Extending the limits of sequentially phased reasoning
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_41openalex-snapshot
CAVEAT: technique and tool for computer aided verification and transformation
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_28openalex-snapshot
A refinement theory that supports both ’decrease of nondeterminism’ and ’increase of parallelism’
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_12openalex-snapshot
Layers as knowledge transitions in the design of distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_87openalex-snapshot
Synchronous development of asynchronous systems
inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_1openalex-snapshot
A Bibliography of Willem-Paul de Roever
inferred← citeshttps://doi.org/10.1007/978-3-642-38613-8_26openalex-snapshot
Structural Transformations for Data-Enriched Real-Time Systems
inferred← citeshttps://doi.org/10.1007/bf01211299openalex-snapshot
Petri net based verification of distributed algorithms: An example
inferred← citeshttps://doi.org/10.1007/bfb0055345openalex-snapshot
Formal verification of stabilizing systems
inferred← citeshttps://doi.org/10.1007/bfb0056469openalex-snapshot
Top-down considerations on distributed computing
inferred← citeshttps://doi.org/10.1007/s00165-012-0231-xopenalex-snapshot
Layered reasoning for randomized distributed algorithms
inferred← citeshttps://doi.org/10.1007/s00165-014-0306-yopenalex-snapshot
Structural transformations for data-enriched real-time systems
inferred← citeshttps://doi.org/10.1007/s001650050035openalex-snapshot
The Verified Incremental Design of a Distributed Spanning Tree Algorithm: Extended Abstract
inferred← citeshttps://doi.org/10.1007/s00446-009-0081-9openalex-snapshot
Causing communication closure: safe program composition with reliable non-FIFO channels
inferred← citeshttps://doi.org/10.1145/248052.248068openalex-snapshot
Refining knowledge oriented actions to layered implementations
inferred← citeshttps://doi.org/10.15308/sinteza-2018-131-138openalex-snapshot
Communication-Closed Layers as Paradigm for Distributed Systems: A Manifesto
inferred← citeshttps://doi.org/10.18452/14640openalex-snapshot
Halbordnungsbasierte Verfeinerung zur Verifikation verteilter Algorithmen
inferred← citeshttps://doi.org/10.2168/lmcs-2(1:6)2006openalex-snapshot
Extending the theory of Owicki and Gries with a logic of progress
showing the first 23 of 24 · page through all 24
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.