On the public citation graph
On the use of history variables
0 signed · 21 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/bf00263992openalex-snapshot
Proving correctness of coroutines without history variables
inferredcites →https://doi.org/10.1016/0016-0032(64)90390-4openalex-snapshot
Rounding errors in algebraic processes
inferredcites →https://doi.org/10.1080/00913367.1978.10673241openalex-snapshot
Bittner, John R.,Mass Communication: An Introduction, Englewood Cliffs, New Jersey, Prentice-Hall, 1977
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/357980.358021openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.1145/359576.359585openalex-snapshot
Communicating sequential processes
inferredcites →https://doi.org/10.21236/ada239419openalex-snapshot
Mathematical Theory of Computation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-77935-5_5openalex-snapshot
Simpler Specifications and Easier Proofs of Distributed Algorithms Using History Variables
inferred← citeshttps://doi.org/10.1007/978-3-642-33475-7_15openalex-snapshot
Formal Verification of Distributed Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-46490-4_21openalex-snapshot
Verification of Processes Using Program Transformation
inferred← citeshttps://doi.org/10.1007/978-94-009-5528-8_4openalex-snapshot
Gas exchange in San Francisco Bay
inferred← citeshttps://doi.org/10.1007/s001650050057openalex-snapshot
Hoare Logic and Auxiliary Variables
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1080/00397918708063926openalex-snapshot
Facile Formation of Quaternary Azetidinium Compounds During Triflation of Dialkylaminopropanols
inferred← citeshttps://doi.org/10.1145/800017.800516openalex-snapshot
Temporal verification of carrier-sense local area network protocols
inferred← citeshttps://doi.org/10.14279/depositonce-3974openalex-snapshot
Modeling and verification of distributed algorithms in theorem proving environments
inferred← citeshttps://doi.org/10.1515/comp-2018-0005openalex-snapshot
The design of manual domain usability evaluation techniques
inferred← citeshttps://doi.org/10.26021/2692openalex-snapshot
The Semantics, Formal Correctness and Implementation of History Variables in an Imperative Programming Language.
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.