On the public citation graph

Categorical modelling of structural operational rules case studies

https://doi.org/10.1007/bfb0026985
0 signed · 32 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-09526-8_8openalex-snapshot
Full abstraction for a simple parallel programming language
inferredcites →https://doi.org/10.1007/3-540-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/3-540-56596-5_45openalex-snapshot
On the foundations of final semantics: Non-standard sets, metric spaces, partial orders
inferredcites →https://doi.org/10.1007/bf01304852openalex-snapshot
Strong functors and monoidal monads
inferredcites →https://doi.org/10.1007/bf01941131openalex-snapshot
Metric semantics for concurrency
inferredcites →https://doi.org/10.1007/bfb0032030openalex-snapshot
Functions as processes
inferredcites →https://doi.org/10.1016/0304-3975(93)90076-6openalex-snapshot
Terminal coalgebras in well-founded set theory
inferredcites →https://doi.org/10.1016/0890-5401(91)90052-4openalex-snapshot
Notions of computation and monads
inferredcites →https://doi.org/10.1017/s0960129500001407openalex-snapshot
Functions as processes
inferredcites →https://doi.org/10.1109/lics.1997.614955openalex-snapshot
Towards a mathematical operational semantics
inferredcites →https://doi.org/10.1112/blms/7.3.294openalex-snapshot
Adjoint Lifting Theorems for Categories of Algebras
inferredcites →https://doi.org/10.1137/0211062openalex-snapshot
The Category-Theoretic Solution of Recursive Domain Equations
inferredcites →https://doi.org/10.1145/200836.200876openalex-snapshot
Bisimulation can't be traced

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-57201-3_9openalex-snapshot
A Categorical Approach to Secure Compilation
inferred← citeshttps://doi.org/10.1007/978-3-030-89051-3_6openalex-snapshot
Fully Abstract and Robust Compilation
inferred← citeshttps://doi.org/10.1007/978-3-642-37075-5_9openalex-snapshot
Comodels and Effects in Mathematical Operational Semantics
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.029openalex-snapshot
A Coalgebraic Approach to Process Equivalence and a Coinduction Principle for Traces
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.02.017openalex-snapshot
Modularity and Implementation of Mathematical Operational Semantics
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.03.005openalex-snapshot
Adding recursive constructs to bialgebraic semantics
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.03.023openalex-snapshot
Bialgebras for structural operational semantics: An introduction
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00056-6openalex-snapshot
Universal coalgebra: a theory of systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80358-xopenalex-snapshot
GSOS for probabilistic transition systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80372-4openalex-snapshot
Well-behaved Translations between Structural Operational Semantics
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80319-6openalex-snapshot
A Coalgebraic Foundation for Linear Time Semantics
inferred← citeshttps://doi.org/10.1017/s0960129598002588openalex-snapshot
On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
inferred← citeshttps://doi.org/10.1109/lics.1997.614955openalex-snapshot
Towards a mathematical operational semantics
inferred← citeshttps://doi.org/10.1109/lics.2001.932486openalex-snapshot
Semantics of name and value passing
inferred← citeshttps://doi.org/10.2168/lmcs-9(3:28)2013openalex-snapshot
Abstract GSOS Rules and a Modular Treatment of Recursive Definitions
inferred← citeshttps://doi.org/10.25560/13693openalex-snapshot
A Coalgebraic Semantics for Imperative Programming Languages
inferred← citeshttps://doi.org/10.4230/lipics.mfcs.2021.88openalex-snapshot
Abstract Congruence Criteria for Weak Bisimilarity
inferred← citeshttps://doi.org/10.48456/tr-688openalex-snapshot
Name-passing process calculi: operational models and structural operational semantics
inferred← citeshttps://doi.org/10.48550/arxiv.2006.14969openalex-snapshot
Fully Abstract and Robust Compilation and How to Reconcile the Two, Abstractly
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.