On the public citation graph

From Security Protocols to Pushdown Automata

https://doi.org/10.1145/2811262
0 signed · 36 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-44881-0_12openalex-snapshot
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols
inferredcites →https://doi.org/10.1007/3-540-45465-9_70openalex-snapshot
Deciding DPDA Equivalence Is Primitive Recursive
inferredcites →https://doi.org/10.1007/3-540-63165-8_221openalex-snapshot
The equivalence problem for deterministic pushdown automata is decidable
inferredcites →https://doi.org/10.1007/978-3-642-22993-0_20openalex-snapshot
Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete
inferredcites →https://doi.org/10.1007/978-3-642-36830-1_12openalex-snapshot
Proving More Observational Equivalences with ProVerif
inferredcites →https://doi.org/10.1007/978-3-642-39274-0_16openalex-snapshot
LALBLC A Program Testing the Equivalence of dpda’s
inferredcites →https://doi.org/10.1007/s10207-004-0055-7openalex-snapshot
OFMC: A symbolic model checker for security protocols
inferredcites →https://doi.org/10.1007/s10817-010-9199-5openalex-snapshot
Decidability of Equivalence of Symbolic Derivations
inferredcites →https://doi.org/10.1016/0304-3975(76)90074-8openalex-snapshot
The inclusion problem for simple languages
inferredcites →https://doi.org/10.1016/j.jlap.2007.06.002openalex-snapshot
Automated Verification of Selected Equivalences for Security Protocols
inferredcites →https://doi.org/10.1016/s0304-3975(00)00285-1openalex-snapshot
L(A)=L(B)? decidability results from complete formal systems
inferredcites →https://doi.org/10.1016/s0304-3975(02)00490-5openalex-snapshot
Protocol insecurity with a finite number of sessions and composed keys is NP-complete
inferredcites →https://doi.org/10.1109/csf.2009.9openalex-snapshot
A Method for Proving Observational Equivalence
inferredcites →https://doi.org/10.1109/csf.2010.13openalex-snapshot
Formal Verification of Privacy for RFID Systems
inferredcites →https://doi.org/10.1109/csf.2010.15openalex-snapshot
Analysing Unlinkability and Anonymity Using the Applied Pi Calculus
inferredcites →https://doi.org/10.1109/csf.2010.28openalex-snapshot
Automating Open Bisimulation Checking for the Spi Calculus
inferredcites →https://doi.org/10.1109/csfw.2001.930138openalex-snapshot
An efficient cryptographic protocol verifier based on prolog rules
inferredcites →https://doi.org/10.1145/1102120.1102125openalex-snapshot
Deciding security of protocols against off-line guessing attacks
inferredcites →https://doi.org/10.1145/1455770.1455787openalex-snapshot
Unbounded verification, falsification, and characterization of security protocols by pattern refinement
inferredcites →https://doi.org/10.1145/2046707.2046744openalex-snapshot
Trace equivalence decision
inferredcites →https://doi.org/10.1145/358722.358740openalex-snapshot
Timestamps in key distribution protocols

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-030-62077-6_10openalex-snapshot
The Hitchhiker’s Guide to Decidability and Complexity of Equivalence Properties in Security Protocols
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_26openalex-snapshot
Typing Messages for Free in Security Protocols: The Case of Equivalence Properties
inferred← citeshttps://doi.org/10.1016/j.jlamp.2016.10.005openalex-snapshot
A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
inferred← citeshttps://doi.org/10.1109/csf.2016.29openalex-snapshot
Automated Reasoning for Equivalences in the Applied Pi Calculus with Barriers
inferred← citeshttps://doi.org/10.1109/sp.2016.40openalex-snapshot
A Method for Verifying Privacy-Type Properties: The Unbounded Case
inferred← citeshttps://doi.org/10.1109/sp.2018.00033openalex-snapshot
DEEPSEC: Deciding Equivalence Properties in Security Protocols Theory and Practice
inferred← citeshttps://doi.org/10.1109/spw67851.2025.00006openalex-snapshot
C2VPG: Translating Practical Context-Free Grammars into Visibly Pushdown Grammars by Order-Based Tagging
inferred← citeshttps://doi.org/10.1145/3127586openalex-snapshot
The Applied Pi Calculus
inferred← citeshttps://doi.org/10.1561/3300000004openalex-snapshot
Modeling and Verifying Security Protocols with the Applied Pi Calculus and ProVerif
inferred← citeshttps://doi.org/10.3233/jcs-171013openalex-snapshot
Automated reasoning for equivalences in the applied pi calculus with barriers
inferred← citeshttps://doi.org/10.3233/jcs-171070openalex-snapshot
A method for unbounded verification of privacy-type properties
inferred← citeshttps://doi.org/10.46298/theoretics.24.4openalex-snapshot
DeepSec: Deciding Equivalence Properties for Security Protocols -- Improved theory and practice
inferred← citeshttps://doi.org/10.70675/174b16b3z807cz413fz9849z794e3e037748openalex-snapshot
Efficient verification of observational equivalences of cryptographic processes : theory and practice
inferred← citeshttps://doi.org/10.70675/1be7f5f7zb53dz4abaz9f95z92dbefd6fb07openalex-snapshot
Vérification de propriétés d'indistinguabilité pour les protocoles cryptographiques
inferred← citeshttps://doi.org/10.70675/b8c9913aze055z43bdz863czb01f1010420fopenalex-snapshot
Automated Verification of Privacy in Security Protocols : Back and Forth Between Theory & Practice
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.