On the public citation graph

On the compositional checking of validity

https://doi.org/10.1007/bfb0039079
0 signed · 19 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-15198-2_16openalex-snapshot
A complete modal proof system for a subset of SCCS
inferredcites →https://doi.org/10.1007/3-540-16042-6_22openalex-snapshot
A complete proof system for SCCS with modal assertions
inferredcites →https://doi.org/10.1007/bfb0032056openalex-snapshot
Compositionality through an operational semantics of contexts
inferredcites →https://doi.org/10.1016/0890-5401(90)90058-popenalex-snapshot
A compositional proof system on a category of labelled transition systems
inferredcites →https://doi.org/10.1016/s0019-9958(86)80038-9openalex-snapshot
A logic for the description of non-deterministic programs and their properties
inferredcites →https://doi.org/10.1109/lics.1989.39190openalex-snapshot
Compositional model checking
inferredcites →https://doi.org/10.7146/dpb.v18i294.6688openalex-snapshot
A Compositional Proof System on a Category of Labelled Transition 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/3-540-54233-7_129openalex-snapshot
Computing behavioural relations, logically
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_4openalex-snapshot
Compositional checking of satisfaction
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_18openalex-snapshot
A linear algorithm for solving fixed-point equations on transition systems
inferred← citeshttps://doi.org/10.1007/3-540-58140-5_2openalex-snapshot
On model checking infinite-state systems
inferred← citeshttps://doi.org/10.1007/978-3-540-45077-1_38openalex-snapshot
Compositionality of Hennessy-Milner Logic through Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/bf00709155openalex-snapshot
Compositional checking of satisfaction
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.035openalex-snapshot
Compositionality of Hennessy–Milner logic by structural operational semantics
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00245-4openalex-snapshot
A compositional μ-calculus proof system for statecharts processes
inferred← citeshttps://doi.org/10.1109/lics.1994.316076openalex-snapshot
A compositional proof system for the modal μ-calculus
inferred← citeshttps://doi.org/10.1145/151646.151648openalex-snapshot
The concurrency workbench
inferred← citeshttps://doi.org/10.7146/brics.v1i34.21609openalex-snapshot
A Compositional Proof System for the Modal mu-Calculus
inferred← citeshttps://doi.org/10.7146/dpb.v22i445.6762openalex-snapshot
Verification of Temporal Properties of Concurrent Systems
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.