On the public citation graph
A full formalisation of π-calculus theory in the calculus of constructions
0 signed · 70 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-56454-3_13openalex-snapshot
The π-calculus as a theory in linear logic: Preliminary results
inferredcites →https://doi.org/10.1007/3-540-61604-7_53openalex-snapshot
On bisimulations for the asynchronous π-calculus
inferredcites →https://doi.org/10.1007/978-3-642-58041-3_6openalex-snapshot
The Polyadic π-Calculus: a Tutorial
inferredcites →https://doi.org/10.1007/bfb0014565openalex-snapshot
Using reflection to build efficient and certified decision procedures
inferredcites →https://doi.org/10.1016/0890-5401(92)90008-4openalex-snapshot
A calculus of mobile processes, I
inferredcites →https://doi.org/10.1016/0890-5401(92)90009-5openalex-snapshot
A calculus of mobile processes, II
inferredcites →https://doi.org/10.1016/1385-7258(72)90034-0openalex-snapshot
Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser theorem
inferredcites →https://doi.org/10.1016/s0304-3975(97)00223-5openalex-snapshot
On bisimulations for the asynchronous π-calculus
inferredcites →https://doi.org/10.1017/s0956796800001106openalex-snapshot
Residual theory in λ-calculus: a formal development
inferredcites →https://doi.org/10.1017/s0960129598002527openalex-snapshot
On the bisimulation proof method
inferredcites →https://doi.org/10.48456/tr-244openalex-snapshot
A mechanized theory of the π-calculus in HOL
inferredcites →https://doi.org/10.7551/mitpress/5641.003.0033openalex-snapshot
Lazy Functions and Mobile Processes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/10721959_33openalex-snapshot
A Formalization of a Concurrent Object Calculus up to α-Conversion
inferred← citeshttps://doi.org/10.1007/11532231_4openalex-snapshot
Nominal Techniques in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/3-540-44755-5_16openalex-snapshot
A Framework for the Formalisation of Pi Calculus Type Systems in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_30openalex-snapshot
A Higher-Order Specification of the π-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_24openalex-snapshot
Higher-Order Abstract Syntax with Induction in Isabelle/HOL: Formalizing the π-Calculus and Mechanizing the Theory of Contexts
inferred← citeshttps://doi.org/10.1007/3-540-45500-0_15openalex-snapshot
Modelisation of Timed Automata in Coq
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_11openalex-snapshot
Mobile Processes: A Commented Bibliography
inferred← citeshttps://doi.org/10.1007/3-540-48256-3_15openalex-snapshot
Mechanized Operational Semantics via (Co)Induction
inferred← citeshttps://doi.org/10.1007/978-3-031-38100-3_13openalex-snapshot
Implementation of a Reversible Distributed Calculus
inferred← citeshttps://doi.org/10.1007/978-3-031-62697-5_9openalex-snapshot
The Concurrent Calculi Formalisation Benchmark
inferred← citeshttps://doi.org/10.1007/978-3-032-28187-6_7openalex-snapshot
Soundness of Typed Transitions in the Linear $$\pi $$-Calculus
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-540-69407-6_33openalex-snapshot
Implementing Spi Calculus Using Nominal Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_6openalex-snapshot
Formalising the π-Calculus Using Nominal Logic
inferred← citeshttps://doi.org/10.1007/978-3-662-44522-8_28openalex-snapshot
L ax F: Side Conditions and External Evidence as Monads
inferred← citeshttps://doi.org/10.1007/978-3-662-44584-6_8openalex-snapshot
Bisimulations Up-to: Beyond First-Order Transition Systems
inferred← citeshttps://doi.org/10.1007/s001650050046openalex-snapshot
Formalising a Value-Passing Calculus in HOL
inferred← citeshttps://doi.org/10.1007/s100090100041openalex-snapshot
Bisimulation verification using the up to techniques
inferred← citeshttps://doi.org/10.1007/s10703-005-2254-xopenalex-snapshot
Two Case Studies of Semantics Execution in Maude: CCS and LOTOS
inferred← citeshttps://doi.org/10.1007/s10817-008-9097-2openalex-snapshot
Nominal Techniques in Isabelle/HOL
inferred← citeshttps://doi.org/10.1007/s10817-015-9358-9openalex-snapshot
Mechanizing a Process Algebra for Network Protocols
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.05.006openalex-snapshot
A Proof Search Specification of the π-Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.08.017openalex-snapshot
A Completeness Proof for Bisimulation in the pi-calculus Using Isabelle
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.11.013openalex-snapshot
Specifying Properties of Concurrent Computations in CLF
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104606openalex-snapshot
Unique solutions of contractions, CCS, and their HOL formalisation
inferred← citeshttps://doi.org/10.1016/j.jlap.2005.09.008openalex-snapshot
Executable structural operational semantics in Maude
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00276-2openalex-snapshot
A First-Order Syntax for the π-Calculus in Isabelle/HOL using Permutations
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00323-8openalex-snapshot
The Theory of Contexts for First Order and Higher Order Abstract Syntax
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80507-3openalex-snapshot
Ambient Calculus and its Logic in the Calculus of Inductive Constructions
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80251-8openalex-snapshot
Automatically Proving Up–to Bisimulation
inferred← citeshttps://doi.org/10.1017/s096012951700010xopenalex-snapshot
Proof-relevant π-calculus: a constructive account of concurrency and causality
inferred← citeshttps://doi.org/10.1017/s0960129518000105openalex-snapshot
Plugging-in proof development environments usingLocksinLF
inferred← citeshttps://doi.org/10.1017/s0960129518000415openalex-snapshot
A case study in programming coinductive proofs: Howe’s method
inferred← citeshttps://doi.org/10.1145/1656242.1656248openalex-snapshot
Proof search specifications of bisimulation and modal logics for the π-calculus
inferred← citeshttps://doi.org/10.1145/2854065.2854080openalex-snapshot
Bisimulation up-to techniques for psi-calculi
inferred← citeshttps://doi.org/10.1145/337244.337261openalex-snapshot
Behavioral equivalence in the polymorphic pi-calculus
inferred← citeshttps://doi.org/10.2168/lmcs-5(2:16)2009openalex-snapshot
Formalising the pi-calculus using nominal logic
inferred← citeshttps://doi.org/10.4204/eptcs.185.1openalex-snapshot
Gluing together Proof Environments: Canonical extensions of LF Type Theories featuring Locks
inferred← citeshttps://doi.org/10.4204/eptcs.276.10openalex-snapshot
Unique Solutions of Contractions, CCS, and their HOL Formalisation
inferred← citeshttps://doi.org/10.4204/eptcs.404openalex-snapshot
Proceedings Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
inferred← citeshttps://doi.org/10.4204/eptcs.404.1openalex-snapshot
A Beluga Formalization of the Harmony Lemma in the π-Calculus
inferred← citeshttps://doi.org/10.5281/zenodo.16643466openalex-snapshot
The Cresson Types Of Hymenoptera.
inferred← citeshttps://doi.org/10.5281/zenodo.41682openalex-snapshot
The Polar Edge Coherence: A Quasi Blind Metric For Video Quality Assessment
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.