On the public citation graph

Verifying end-to-end protocols using induction with CSP/FDR

https://doi.org/10.1007/bfb0098006
0 signed · 31 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-16761-7_81openalex-snapshot
A timed model for communicating sequential processes
inferredcites →https://doi.org/10.1007/3-540-52148-8_6openalex-snapshot
Verifying properties of large sets of processes with network invariants
inferredcites →https://doi.org/10.1007/3-540-58555-9_87openalex-snapshot
Three applications of formal methods at MITRE
inferredcites →https://doi.org/10.1007/3-540-60218-6_30openalex-snapshot
Verifying parameterized networks using abstraction and regular languages
inferredcites →https://doi.org/10.1007/3-540-60630-0_7openalex-snapshot
Hierarchical compression for model-checking CSP or how to check 1020 dining philosophers for deadlock
inferredcites →https://doi.org/10.1007/3-540-60973-3_101openalex-snapshot
Experiences in embedded scheduling
inferredcites →https://doi.org/10.1007/978-0-387-34892-6_10openalex-snapshot
The Specification and Verification of an Experimental ATM Signalling Protocol
inferredcites →https://doi.org/10.1007/978-0-387-35578-8_25openalex-snapshot
Verifying an infinite family of inductions simultaneously using data independence and FDR
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_4openalex-snapshot
Notes on Communicating Sequential Systems
inferredcites →https://doi.org/10.1007/bf02259750openalex-snapshot
An incremental specification of the sliding-window protocol
inferredcites →https://doi.org/10.1007/bfb0024640openalex-snapshot
An industrial experience on LOTOS-based prototyping for switching systems design
inferredcites →https://doi.org/10.1007/bfb0032011openalex-snapshot
Timed CSP: Theory and Practice.
inferredcites →https://doi.org/10.1007/bfb0053594openalex-snapshot
Automated formal analysis of networks: FDR models of arbitrary topologies and flow-control mechanisms
inferredcites →https://doi.org/10.1109/65.238150openalex-snapshot
RSVP: a new resource ReSerVation Protocol
inferredcites →https://doi.org/10.1109/mcom.1986.1092946openalex-snapshot
New directions in communications (or which way to the information age?)
inferredcites →https://doi.org/10.1145/72981.72998openalex-snapshot
A structural induction theorem for processes
inferredcites →https://doi.org/10.21954/ou.ro.0000fe9dopenalex-snapshot
Action Systems, Determinism and the Development of Secure Systems

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-44919-1_24openalex-snapshot
Analysing Properties of the Resource Reservation Protocol
inferred← citeshttps://doi.org/10.1007/3-540-45314-8_5openalex-snapshot
Combining Independent Specifications
inferred← citeshttps://doi.org/10.1007/978-0-387-35578-8_25openalex-snapshot
Verifying an infinite family of inductions simultaneously using data independence and FDR
inferred← citeshttps://doi.org/10.1007/978-1-4471-0851-1_20openalex-snapshot
Deductive Reasoning versus Model Checking: Two Formal Approaches for System Development
inferred← citeshttps://doi.org/10.1007/978-1-4615-4549-1_7openalex-snapshot
Automated Formal Analysis of Networks
inferred← citeshttps://doi.org/10.1016/j.csi.2008.12.005openalex-snapshot
Test aspect of requirement specification
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.066openalex-snapshot
Formal Verification of the IEEE 802.1D Spanning Tree Protocol Using Extended R ebeca
inferred← citeshttps://doi.org/10.1016/j.jsc.2008.11.006openalex-snapshot
An invariant-based approach to the verification of asynchronous parameterized networks
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80059-3openalex-snapshot
Refinement-Preserving Plug-In Components
inferred← citeshttps://doi.org/10.1109/incc.2004.1366574openalex-snapshot
Using CSP to model and analyze transmission control protocol vulnerabilities within the broadcast network
inferred← citeshttps://doi.org/10.1109/mc.2009.284openalex-snapshot
Formal Versus Agile: Survival of the Fittest
inferred← citeshttps://doi.org/10.14288/1.0051286openalex-snapshot
A framework for multiparty communication types
inferred← citeshttps://doi.org/10.25405/ncl.34125261openalex-snapshot
MAFTIA (Malicious- and Accidental-Fault Tolerance for Internet Applications)
inferred← citeshttps://doi.org/10.25405/ncl.34129209openalex-snapshot
Conceptual Model and Architecture
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.