On the public citation graph

Protocol verification in Nuprl

https://doi.org/10.1007/bfb0028764
0 signed · 18 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-60385-9_2openalex-snapshot
Automatic verification of the SCI cache coherence protocol
inferredcites →https://doi.org/10.1007/3-540-61042-1_48openalex-snapshot
Formal verification of a partial-order reduction technique for model checking
inferredcites →https://doi.org/10.1007/3-540-63104-6_34openalex-snapshot
Hybrid interactive theorem proving using nuprl and HOL
inferredcites →https://doi.org/10.1007/bfb0014566openalex-snapshot
Sets in types, types in sets
inferredcites →https://doi.org/10.1007/bfb0105410openalex-snapshot
Importing mathematics from HOL into Nuprl
inferredcites →https://doi.org/10.1109/cmpass.1996.507881openalex-snapshot
A correctness proof of a cache coherence protocol
inferredcites →https://doi.org/10.1109/lics.1991.151641openalex-snapshot
On computational open-endedness in Martin-Lof's type theory
inferredcites →https://doi.org/10.1145/237502.237573openalex-snapshot
Verification of FLASH cache coherence protocol by aggregation of distributed transactions

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-48660-7_19openalex-snapshot
Fault-Tolerant Distributed Theorem Proving
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_21openalex-snapshot
Formal Metatheory Using Implicit Syntax, and an Application to Data Abstraction for Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-92995-6_5openalex-snapshot
Declarative Network Verification
inferred← citeshttps://doi.org/10.1007/bfb0055138openalex-snapshot
A type annotation scheme for Nuprl
inferred← citeshttps://doi.org/10.1007/s100090100044openalex-snapshot
System design of a CC-NUMA multiprocessor architecture using formal specification, model-checking, co-simulation, and test generation
inferred← citeshttps://doi.org/10.1007/s10703-005-2243-0openalex-snapshot
A Complete Mechanization of Correctness of a String-Preprocessing Algorithm
inferred← citeshttps://doi.org/10.1016/j.procs.2015.07.197openalex-snapshot
Formalization of the Behavior of Content-Centric Networking
inferred← citeshttps://doi.org/10.1109/iceccs.2002.1181499openalex-snapshot
Mechanization of a proof of string-preprocessing in Boyer-Moore's pattern matching algorithm
inferred← citeshttps://doi.org/10.1145/1014007.1014021openalex-snapshot
A type system for resource protocol verification and its correctness proof
inferred← citeshttps://doi.org/10.1587/transcom.2016nep0013openalex-snapshot
Verification of Content-Centric Networking Using Proof Assistant
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.