On the public citation graph
Presheaf models for the π-calculus
0 signed · 46 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-09526-8_8openalex-snapshot
Full abstraction for a simple parallel programming language
inferredcites →https://doi.org/10.1007/3-540-61604-7_50openalex-snapshot
A presheaf semantics of value-passing processes
inferredcites →https://doi.org/10.1007/3-540-63172-0_32openalex-snapshot
Presheaf models for concurrency
inferredcites →https://doi.org/10.1007/978-3-642-58041-3_6openalex-snapshot
The Polyadic π-Calculus: a Tutorial
inferredcites →https://doi.org/10.1007/bf01200262openalex-snapshot
Plain CHOCS A second generation calculus for higher order processes
inferredcites →https://doi.org/10.1007/bfb0028550openalex-snapshot
Searching Constant Width Mazes Captures the AC0 Hierarchy
inferredcites →https://doi.org/10.1016/0168-0072(94)90069-8openalex-snapshot
A completeness theorem for open maps
inferredcites →https://doi.org/10.1016/0304-3975(96)00075-8openalex-snapshot
π-Calculus, internal mobility, and agent-passing calculi
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.1017/cbo9780511525858openalex-snapshot
Handbook of Categorical Algebra
inferredcites →https://doi.org/10.1017/cbo9780511525865openalex-snapshot
Handbook of Categorical Algebra
inferredcites →https://doi.org/10.1093/oso/9780198537809.003.0001openalex-snapshot
Models for concurrency
inferredcites →https://doi.org/10.1109/lics.1996.561301openalex-snapshot
A fully abstract domain model for the π-calculus
inferredcites →https://doi.org/10.1109/real.1997.641264openalex-snapshot
Formal modeling and analysis of an audio/video protocol: an industrial case study using UPPAAL
inferredcites →https://doi.org/10.7146/brics.v4i26.18952openalex-snapshot
A Characterization of Finitary Bisimulation
inferredcites →https://doi.org/10.7146/brics.v4i27.18953openalex-snapshot
Zero-Knowledge Proofs for Finite Field Arithmetic or: Can Zero-Knowledge be for Free?
inferredcites →https://doi.org/10.7146/brics.v4i28.18954openalex-snapshot
Span Programs and General Secure Multi-Party Computation
inferredcites →https://doi.org/10.7146/brics.v4i29.18955openalex-snapshot
Model Checking via Reachability Testing for Timed Automata
inferredcites →https://doi.org/10.7146/brics.v4i34.18960openalex-snapshot
Presheaf Models for the pi-Calculus
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.2002.2968openalex-snapshot
A Fully Abstract Model for the π-calculus
inferred← citeshttps://doi.org/10.1007/1-4020-8141-3_40openalex-snapshot
New-HOPLA a higher-order process language with name generation
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_37openalex-snapshot
Event Structures as Presheaves—Two Representation Theorems
inferred← citeshttps://doi.org/10.1007/978-3-030-02508-3_13openalex-snapshot
Spatio-Temporal Domains: An Overview
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_10openalex-snapshot
Free-Algebra Models for the π-Calculus
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.05.019openalex-snapshot
A Name Abstraction Functor for Named Sets
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.07.014openalex-snapshot
Families of Symmetries as Efficient Models of Resource Binding
inferred← citeshttps://doi.org/10.1016/j.ic.2003.12.003openalex-snapshot
Models for name-passing processes: interleaving and causal
inferred← citeshttps://doi.org/10.1016/j.ic.2009.10.007openalex-snapshot
Symmetries, local names and dynamic (de)-allocation of names
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.029openalex-snapshot
Domain theory for concurrency
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00209-2openalex-snapshot
Presheaf models for CCS-like languages
inferred← citeshttps://doi.org/10.1017/cbo9780511550850.005openalex-snapshot
Linearity and Nonlinearity in Distributed Computation
inferred← citeshttps://doi.org/10.1017/s0960129509990272openalex-snapshot
Tree-functors, determinacy and bisimulations
inferred← citeshttps://doi.org/10.1109/lics.2001.932486openalex-snapshot
Semantics of name and value passing
inferred← citeshttps://doi.org/10.1145/3372885.3373814openalex-snapshot
Formalizing 𝜋-calculus in guarded cubical Agda
inferred← citeshttps://doi.org/10.1145/3844503openalex-snapshot
\(\pi\) LL: Reconciling Linear Logic, the \(\pi\) -calculus, and their Metatheory
inferred← citeshttps://doi.org/10.23638/lmcs-13(4:9)2017openalex-snapshot
An intensionally fully-abstract sheaf model for $\pi$ (expanded version)
inferred← citeshttps://doi.org/10.7146/brics.v6i28.20097openalex-snapshot
A Fully Abstract Presheaf Semantics of SCCS with Finite Delay
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.