On the public citation graph

A mechanical proof of Segall's PIF algorithm

https://doi.org/10.1007/bf01211619
0 signed · 25 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-52559-9_77openalex-snapshot
Multivalued possibilities mappings
inferredcites →https://doi.org/10.1007/3-540-60218-6_14openalex-snapshot
Verification of a distributed summation algorithm
inferredcites →https://doi.org/10.1007/978-1-4613-9668-0_6openalex-snapshot
Parallel Program Design
inferredcites →https://doi.org/10.1007/978-1-4757-2714-2openalex-snapshot
Verification of Sequential and Concurrent Programs
inferredcites →https://doi.org/10.1007/978-1-4757-4376-0openalex-snapshot
Verification of Sequential and Concurrent Programs
inferredcites →https://doi.org/10.1007/bf00268134openalex-snapshot
An axiomatic proof technique for parallel programs I
inferredcites →https://doi.org/10.1007/bf01178564openalex-snapshot
Receptive process theory
inferredcites →https://doi.org/10.1007/bfb0020419openalex-snapshot
Distributed Algorithms: 8th International Workshop, Wdag'1994 Terschelling, the Netherlands September 29-October 1, 1994 : Proceedings
inferredcites →https://doi.org/10.1007/bfb0022433openalex-snapshot
Distributed Algorithms
inferredcites →https://doi.org/10.1016/0378-4754(89)90181-xopenalex-snapshot
A computational logic handbook
inferredcites →https://doi.org/10.1093/comjnl/38.2.152openalex-snapshot
Mechanical verification of distributed algorithms in higher-order logic
inferredcites →https://doi.org/10.1109/tit.1983.1056620openalex-snapshot
Distributed network protocols
inferredcites →https://doi.org/10.1145/357195.357200openalex-snapshot
A Distributed Algorithm for Minimum-Weight Spanning Trees
inferredcites →https://doi.org/10.21236/ada198312openalex-snapshot
A Lattice-Structured Proof Technique Applied to a Minimum Spanning Tree Algorithm

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-44798-9_32openalex-snapshot
Induction-Oriented Formal Verification in Symmetric Interconnection Networks
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_11openalex-snapshot
Compositional Proofs for Concurrent Objects
inferred← citeshttps://doi.org/10.1007/bfb0055652openalex-snapshot
Checking verifications of protocols and distributed systems by computer
inferred← citeshttps://doi.org/10.1007/s00165-004-0052-7openalex-snapshot
A computer checked algebraic verification of a distributed summation algorithm
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/s00236-013-0178-2openalex-snapshot
Verifying a simplification of mutual exclusion by Lycklama–Hadzilacos
inferred← citeshttps://doi.org/10.1023/a:1008764923992openalex-snapshot
Verification of a Leader Election Protocol: Formal Methods Applied to IEEE 1394
inferred← citeshttps://doi.org/10.1109/ipdps.2002.1016621openalex-snapshot
Mechanical verification of hypercube algorithms
inferred← citeshttps://doi.org/10.1109/sp54263.2024.00017openalex-snapshot
Formal Model-Driven Analysis of Resilience of GossipSub to Attacks from Misbehaving Peers
inferred← citeshttps://doi.org/10.1142/s0129626403001094openalex-snapshot
FORMAL PROOF OF APPLICATIONS DISTRIBUTED IN SYMMETRIC INTERCONNECTION NETWORKS
inferred← citeshttps://doi.org/10.19153/cleiej.8.1.2openalex-snapshot
Facilitating the Verification of Diffusing Computations and Their Applications
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.