On the public citation graph
Using a PVS embedding of CSP to verify authentication protocols
0 signed · 64 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/3-540-58468-4_189openalex-snapshot
Towards a duration calculus proof assistant in PVS
inferredcites →https://doi.org/10.1007/3-540-61042-1_43openalex-snapshot
Breaking and fixing the Needham-Schroeder Public-Key Protocol using FDR
inferredcites →https://doi.org/10.1007/bf00197942openalex-snapshot
Three systems for cryptographic protocol analysis
inferredcites →https://doi.org/10.1007/bfb0105397openalex-snapshot
Deciding cryptographic protocol adequacy with HOL: The implementation
inferredcites →https://doi.org/10.1016/0169-7552(94)00016-mopenalex-snapshot
On communicating sequential processes
inferredcites →https://doi.org/10.1109/32.58786openalex-snapshot
Mechanizing CSP trace theory in higher order logic
inferredcites →https://doi.org/10.1109/csfw.1997.596788openalex-snapshot
Proving properties of security protocols by induction
inferredcites →https://doi.org/10.1109/risp.1994.296595openalex-snapshot
On unifying some cryptographic protocol logics
inferredcites →https://doi.org/10.1109/secpri.1996.502680openalex-snapshot
Security properties and CSP
inferredcites →https://doi.org/10.1145/359657.359659openalex-snapshot
Using encryption for authentication in large networks of computers
inferredcites →https://doi.org/10.21236/ada465512openalex-snapshot
On Unifying Some Cryptographic Protocol Logics
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10722599_14openalex-snapshot
Analysing Time Dependent Security Properties in CSP Using PVS
inferred← citeshttps://doi.org/10.1007/11423348_14openalex-snapshot
Verifying Security Protocols: An Application of CSP
inferred← citeshttps://doi.org/10.1007/11554578_1openalex-snapshot
Justifying a Dolev-Yao Model Under Active Attacks
inferred← citeshttps://doi.org/10.1007/11555827_28openalex-snapshot
Browser Model for Security Analysis of Browser-Based Protocols
inferred← citeshttps://doi.org/10.1007/11589976_15openalex-snapshot
Embedding the Stable Failures Model of CSP in PVS
inferred← citeshttps://doi.org/10.1007/11817949_11openalex-snapshot
A Complete Axiomatic Semantics for the CSP Stable-Failures Model
inferred← citeshttps://doi.org/10.1007/3-540-36532-x_14openalex-snapshot
Formalization and Verification of a Mail Server in Coq
inferred← citeshttps://doi.org/10.1007/3-540-45116-1_3openalex-snapshot
Open Issues in Formal Methods for Cryptographic Protocol Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4419-9359-5_7openalex-snapshot
Translation Validation of High-Level Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-11936-6_5openalex-snapshot
A Mechanized Proof of Loop Freedom of the (Untimed) AODV Routing Protocol
inferred← citeshttps://doi.org/10.1007/978-3-319-66845-1_27openalex-snapshot
Certified Password Quality - A Case Study Using Coq and Linux Pluggable Authentication Modules.
inferred← citeshttps://doi.org/10.1007/978-3-540-31980-1_8openalex-snapshot
A Generic Theorem Prover of CSP Refinement
inferred← citeshttps://doi.org/10.1007/978-3-540-39893-6_12openalex-snapshot
Formalising an Integrated Language in PVS
inferred← citeshttps://doi.org/10.1007/978-3-540-49020-3_13openalex-snapshot
Owicki/Gries in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/978-3-540-73210-5_29openalex-snapshot
Translating FSP into LOTOS and Networks of Automata
inferred← citeshttps://doi.org/10.1007/978-3-540-75227-1_14openalex-snapshot
A Theorem-Proving Approach to Verification of Fair Non-repudiation Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-76862-3_42openalex-snapshot
Proof Principles of CSP – CSP-Prover in Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-04904-0_10openalex-snapshot
Where Next for Formal Methods?
inferred← citeshttps://doi.org/10.1007/978-3-642-04904-0_9openalex-snapshot
Where Next for Formal Methods?
inferred← citeshttps://doi.org/10.1007/978-3-642-14521-6_13openalex-snapshot
Encoding Circus Programs in ProofPowerZ
inferred← citeshttps://doi.org/10.1007/s00165-007-0044-5openalex-snapshot
Unifying theories in ProofPower-Z
inferred← citeshttps://doi.org/10.1007/s00165-009-0133-8openalex-snapshot
Translating FSP into LOTOS and networks of automata
inferred← citeshttps://doi.org/10.1007/s00165-018-0453-7openalex-snapshot
A UTP semantics for communicating processes with shared variables and its formal encoding in PVS
inferred← citeshttps://doi.org/10.1007/s10207-014-0243-zopenalex-snapshot
Analysis of two authorization protocols using Colored Petri Nets
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.10.013openalex-snapshot
Linking Semantic Models to Support CSP ∥ B Consistency Checking
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.11.043openalex-snapshot
Temporal Logics of Knowledge and their Applications in Security
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.08.020openalex-snapshot
PVS Embedding of cCSP Semantic Models and Their Relationship
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.08.021openalex-snapshot
The Stable Revivals Model in CSP-Prover
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80132-xopenalex-snapshot
Rewriting Semantics of Meta-Objects and Composable Distributed Services
inferred← citeshttps://doi.org/10.1109/ainaw.2007.304openalex-snapshot
Rank Theorems for Forward Secrecy in Group Key Management Protocols
inferred← citeshttps://doi.org/10.1109/csda.1998.798355openalex-snapshot
A symbiotic relationship between formal methods and security
inferred← citeshttps://doi.org/10.1109/csfw.2001.930139openalex-snapshot
Proving secrecy is easy enough
inferred← citeshttps://doi.org/10.1109/discex.2000.824984openalex-snapshot
Open issues in formal methods for cryptographic protocol analysis
inferred← citeshttps://doi.org/10.1109/fuzz.2003.1206609openalex-snapshot
Notice of Violation of IEEE Publication Principles: Which models should be applied to measure computer security and information assurance?
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397284openalex-snapshot
Automated refinement checking of concurrent systems
inferred← citeshttps://doi.org/10.1109/ipdps.2008.4536556openalex-snapshot
What is the best way to prove a cryptographic protocol correct?
inferred← citeshttps://doi.org/10.1109/jsac.2002.806125openalex-snapshot
Formal methods for cryptographic protocol analysis: emerging issues and trends
inferred← citeshttps://doi.org/10.1109/tcad.2010.2042889openalex-snapshot
Translation Validation of High-Level Synthesis
inferred← citeshttps://doi.org/10.1109/waina.2013.16openalex-snapshot
Modelling Attacker with Deciding Security Properties by Induction and Deduction
inferred← citeshttps://doi.org/10.1109/wecwis.2000.853873openalex-snapshot
Failure analysis of an e-commerce protocol using model checking
inferred← citeshttps://doi.org/10.1109/wict.2015.7489637openalex-snapshot
Formal analysis of SEP protocol using the interpretation function-based method
inferred← citeshttps://doi.org/10.1145/948109.948140openalex-snapshot
A composable cryptographic library with nested operations
inferred← citeshttps://doi.org/10.1145/986655.986666openalex-snapshot
From absence of certain vulnerabilities towards security proofs
inferred← citeshttps://doi.org/10.1155/2012/254942openalex-snapshot
Formal Analysis of SET and NSL Protocols Using the Interpretation Functions-Based Method
inferred← citeshttps://doi.org/10.25405/ncl.34169559openalex-snapshot
Browser-based Identity Federation
inferred← citeshttps://doi.org/10.3233/978-1-60750-774-1-341openalex-snapshot
CONPASU-tool: A Concurrent Process Analysis Support Tool based on Symbolic Computation
inferred← citeshttps://doi.org/10.48550/arxiv.1001.3464openalex-snapshot
Formalizing cCSP Synchronous Semantics in PVS
inferred← citeshttps://doi.org/10.5555/1326073.1326139openalex-snapshot
Automated refinement checking of concurrent systems
inferred← citeshttps://doi.org/10.6092/issn.1972-5787/3720openalex-snapshot
Formalization in PVS of Balancing Properties Necessary for Proving Security of the Dolev-Yao Cascade Protocol Model
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.