On the public citation graph

Efficient detection of a class of stable properties

https://doi.org/10.1007/bf02280830
0 signed · 33 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/bf01782776openalex-snapshot
Algorithms for distributed termination detection
inferredcites →https://doi.org/10.1007/bf02277859openalex-snapshot
Detecting causal relationships in distributed computations: In search of the holy grail
inferredcites →https://doi.org/10.1007/bf02280831openalex-snapshot
Strong stable properties in distributed systems
inferredcites →https://doi.org/10.1016/0020-0190(80)90021-6openalex-snapshot
Termination detection for diffusing computations
inferredcites →https://doi.org/10.1145/128738.128742openalex-snapshot
Lightweight causal and atomic group multicast
inferredcites →https://doi.org/10.1145/214451.214456openalex-snapshot
Distributed snapshots
inferredcites →https://doi.org/10.1145/357172.357178openalex-snapshot
Proving Liveness Properties of Concurrent Programs
inferredcites →https://doi.org/10.1145/357360.357365openalex-snapshot
Distributed deadlock detection
inferredcites →https://doi.org/10.1145/359545.359563openalex-snapshot
Time, clocks, and the ordering of events in a distributed system
inferredcites →https://doi.org/10.1145/5956.5958openalex-snapshot
An example of stepwise refinement of distributed programs: quiescence detection
inferredcites →https://doi.org/10.1145/800221.806729openalex-snapshot
Detecting termination of distributed computations using markers
inferredcites →https://doi.org/10.1145/800222.806756openalex-snapshot
A distributed algorithm for generalized deadlock detection

What points at this work

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

inferred← citeshttps://doi.org/10.1002/0471721271.biblioopenalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1006/jcss.1997.1512openalex-snapshot
Shared Global States in Distributed Computations
inferred← citeshttps://doi.org/10.1007/11590156_34openalex-snapshot
Monitoring Stable Properties in Dynamic Peer-to-Peer Distributed Systems
inferred← citeshttps://doi.org/10.1007/11596356_58openalex-snapshot
Nonintrusive Snapshots Using Thin Slices
inferred← citeshttps://doi.org/10.1007/978-3-540-27860-3_5openalex-snapshot
Detecting Locally Stable Predicates Without Modifying Application Messages
inferred← citeshttps://doi.org/10.1007/s00446-006-0004-yopenalex-snapshot
Efficient dependency tracking for relevant events in concurrent systems
inferred← citeshttps://doi.org/10.1007/s00446-006-0018-5openalex-snapshot
Timestamping messages and events in a distributed system using synchronous communication
inferred← citeshttps://doi.org/10.1007/s004460050040openalex-snapshot
Vector time and causality among abstract events in distributed computations
inferred← citeshttps://doi.org/10.1016/j.jpdc.2006.12.004openalex-snapshot
Efficient detection of a locally stable predicate in a distributed system
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.09.009openalex-snapshot
Detecting stable locality-aware predicates
inferred← citeshttps://doi.org/10.1109/etfa.2018.8502653openalex-snapshot
Behavior-driven Development for Real-time Embedded Systems
inferred← citeshttps://doi.org/10.1109/icdcs.1995.500048openalex-snapshot
Characterizing and detecting the set of global states seen by all observers of a distributed computation
inferred← citeshttps://doi.org/10.1109/icdcs.2019.00215openalex-snapshot
An Optimal Vector Clock Algorithm for Multithreaded Systems
inferred← citeshttps://doi.org/10.1109/iv.2012.80openalex-snapshot
Debugging the Execution of Distributed Algorithms over Anonymous Networks
inferred← citeshttps://doi.org/10.1109/tkde.2003.1232275openalex-snapshot
Efficient causality-tracking timestamping
inferred← citeshttps://doi.org/10.1109/tse.2007.1000openalex-snapshot
Detecting Arbitrary Stable Properties Using Efficient Snapshots
inferred← citeshttps://doi.org/10.1142/s0129054102001503openalex-snapshot
A NOTE ON THE DETERMINATION OF THE IMMEDIATE PREDECESSORS IN A DISTRIBUTED COMPUTATION
inferred← citeshttps://doi.org/10.1145/1073814.1073818openalex-snapshot
Efficient dependency tracking for relevant events in shared-memory systems
inferred← citeshttps://doi.org/10.1145/1968513.1968516openalex-snapshot
Detecting Locally Distributed Predicates
inferred← citeshttps://doi.org/10.1145/564870.564907openalex-snapshot
Tracking immediate predecessors in distributed computations
inferred← citeshttps://doi.org/10.7907/8frw-zf17.openalex-snapshot
Applying formal methods to distributed algorithms using local-global relations
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.