On the public citation graph

Proof rules dealing with fairness

https://doi.org/10.1007/bfb0025770
0 signed · 22 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/3-540-10003-2_69openalex-snapshot
Characterizing correctness properties of parallel programs using fixpoints
inferredcites →https://doi.org/10.7146/dpb.v10i133.18448openalex-snapshot
A Cook's Tour of Countable Nondeterminism

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-10843-2_38openalex-snapshot
A cook's tour of countable nondeterminism
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_96openalex-snapshot
A fair calculus of communicating systems
inferred← citeshttps://doi.org/10.1007/3-540-12896-4_352openalex-snapshot
Compactness in semantics for merge and fair merge
inferred← citeshttps://doi.org/10.1007/3-540-52559-9_61openalex-snapshot
Refinement calculus, part II: Parallel and reactive programs
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_23openalex-snapshot
A Theory of Bounded Fair Scheduling
inferred← citeshttps://doi.org/10.1007/bfb0012788openalex-snapshot
A powerdomain for countable non-determinism
inferred← citeshttps://doi.org/10.1007/bfb0036897openalex-snapshot
Processes and a fair semantics for the ADA rendez-vous
inferred← citeshttps://doi.org/10.1007/s00165-019-00501-3openalex-snapshot
Fifty years of Hoare’s logic
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90107-2openalex-snapshot
Storage requirements for fair scheduling
inferred← citeshttps://doi.org/10.1016/0020-0190(84)90114-5openalex-snapshot
Fairness and conspiracies
inferred← citeshttps://doi.org/10.1016/0167-6423(83)90004-7openalex-snapshot
Proof rules and transformations dealing with fairness
inferred← citeshttps://doi.org/10.1016/0167-6423(84)90003-0openalex-snapshot
Adequate proof principles for invariance and liveness properties of concurrent programs
inferred← citeshttps://doi.org/10.1016/0304-3975(84)90103-8openalex-snapshot
Fair termination revisited—with delay
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90167-7openalex-snapshot
While-programs with nondeterministic assignments and the logic ALNA
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90045-9openalex-snapshot
Merging regular processes by means of fixed-point theory
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104892openalex-snapshot
Fairness and communication-based semantics for session-typed languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)91250-5openalex-snapshot
Processes and the denotational semantics of concurrency
inferred← citeshttps://doi.org/10.1109/jcit.1990.128282openalex-snapshot
Superposition and fairness in reactive system refinement
inferred← citeshttps://doi.org/10.4204/eptcs.322.7openalex-snapshot
Substructural Observed Communication Semantics
inferred← citeshttps://doi.org/10.5555/952786.952800openalex-snapshot
Real-time specification and modeling with joint actions
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.