On the public citation graph

Automated deduction - CADE-20 : 20th International Conference on Automated Deduction, Tallinn, Estonia, July 22-27, 2005 : proceedings

https://doi.org/10.1007/11532231
0 signed · 14 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/11532231_28openalex-snapshot
Regular Protocols and Attacks with Regular Knowledge

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-540-71209-1_42openalex-snapshot
Automatic Analysis of the Security of XOR-Based Key Management Schemes
inferred← citeshttps://doi.org/10.1007/978-3-540-73595-3_30openalex-snapshot
Logical Engineering with Instance-Based Methods
inferred← citeshttps://doi.org/10.1007/978-3-540-74621-8_2openalex-snapshot
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_30openalex-snapshot
Efficient Interpolant Generation in Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1016/j.artint.2007.09.005openalex-snapshot
The model evolution calculus as a first-order DPLL method
inferred← citeshttps://doi.org/10.1016/j.artint.2012.08.001openalex-snapshot
Planning as satisfiability: Heuristics
inferred← citeshttps://doi.org/10.1016/j.entcs.2016.06.008openalex-snapshot
Alpha-Structural Induction and Recursion for the Lambda Calculus in Constructive Type Theory
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.08.010openalex-snapshot
Strong Normalization for the Simply-Typed Lambda Calculus in Constructive Type Theory Using Agda
inferred← citeshttps://doi.org/10.1016/j.ic.2013.06.003openalex-snapshot
Converting nondeterministic automata and context-free grammars into Parikh equivalent one-way and two-way deterministic automata
inferred← citeshttps://doi.org/10.1016/j.scico.2011.10.008openalex-snapshot
Formal verification of side-channel countermeasures using self-composition
inferred← citeshttps://doi.org/10.1145/3365438.3410946openalex-snapshot
Scenario-based specification of security protocols and transformation to security model checkers
inferred← citeshttps://doi.org/10.1145/3622834openalex-snapshot
Equality Saturation Theory Exploration à la Carte
inferred← citeshttps://doi.org/10.1145/3622835openalex-snapshot
Complete First-Order Reasoning for Properties of Functional Programs
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.