On the public citation graph

From higher-order π-calculus to π-calculus in the presence of static operators

https://doi.org/10.1007/bfb0055619
0 signed · 22 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-55719-9_114openalex-snapshot
Barbed bisimulation
inferredcites →https://doi.org/10.1007/3-540-61604-7_55openalex-snapshot
Decoding choice encodings
inferredcites →https://doi.org/10.1007/bfb0084781openalex-snapshot
The problem of “weak bisimulation up to”
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/s0960129500001407openalex-snapshot
Functions as processes
inferredcites →https://doi.org/10.1109/hicss.1998.649220openalex-snapshot
Proving trust in systems of second-order processes
inferredcites →https://doi.org/10.1145/200836.200876openalex-snapshot
Bisimulation can't be traced
inferredcites →https://doi.org/10.1145/75277.75290openalex-snapshot
A calculus of higher order communicating systems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11563952_47openalex-snapshot
Deploying π-Calculus Technology in Inter-organizational Process
inferred← citeshttps://doi.org/10.1007/978-3-319-11599-3_10openalex-snapshot
Static Semantics of Secret Channel Abstractions
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_13openalex-snapshot
Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation
inferred← citeshttps://doi.org/10.1016/j.cl.2012.04.003openalex-snapshot
First-order reasoning for higher-order concurrency
inferred← citeshttps://doi.org/10.1016/j.ic.2010.10.001openalex-snapshot
On the expressiveness and decidability of higher-order process calculi
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00219-1openalex-snapshot
Encoding Distributed Areas and Local Communication into the π-Calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80421-3openalex-snapshot
Dynamic Channel Screening in the Higher Order π-Calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80869-7openalex-snapshot
A Distributed π-Calculus with Local Areas of Communication
inferred← citeshttps://doi.org/10.1080/00207160.2016.1210793openalex-snapshot
On parameterization of higher-order processes
inferred← citeshttps://doi.org/10.1109/csfw.2000.856943openalex-snapshot
Secure composition of untrusted code: wrappers and causality types
inferred← citeshttps://doi.org/10.3233/jcs-2003-11202openalex-snapshot
Secure composition of untrusted code: box π, wrappers, and causality types
inferred← citeshttps://doi.org/10.4204/eptcs.131.5openalex-snapshot
On Context Bisimulation for Parameterized Higher-order Processes
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/2285openalex-snapshot
Higher-Order Concurrency: Expressiveness and Decidability Results
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.