Extended type-based information flow analysis for pi-calculus to support dynamically extensible security lattices.
Title resolution pending
5 Pith papers cite this work, alongside 742 external citations. Polarity classification is still indexing.
5
Pith papers citing it
742
external citations · Crossref
representative citing papers
A single generalized energy game characterizes and decides the silent-step behavioral equivalence spectrum between branching bisimilarity and weak trace semantics.
A unifying framework for probabilistic testing equivalences is introduced via distribution-based semantics and process predicates, yielding internal and external characterizations that generalize classical fair/should and may equivalences and are proven to be congruences.
A non-deterministic queue automaton is shown to be equally expressive, under branching bisimulation, as the Reactive Turing Machine.
A first-person, richly cited history of μCRL and mCRL2 by their creators, covering the SPECS-era origins, tool development, verification methodology, and industrial applications, with no new formal results.
citing papers explorer
-
Type-based information flow analysis for $\pi$-calculus with a dynamically extensible security lattice
Extended type-based information flow analysis for pi-calculus to support dynamically extensible security lattices.
-
One Energy Game for the Spectrum between Branching Bisimilarity and Weak Trace Semantics
A single generalized energy game characterizes and decides the silent-step behavioral equivalence spectrum between branching bisimilarity and weak trace semantics.
-
A Unifying Approach to Probabilistic Testing Equivalences
A unifying framework for probabilistic testing equivalences is introduced via distribution-based semantics and process predicates, yielding internal and external characterizations that generalize classical fair/should and may equivalences and are proven to be congruences.
-
The Queue Automaton Revisited
A non-deterministic queue automaton is shown to be equally expressive, under branching bisimulation, as the Reactive Turing Machine.
-
A Comprehensive History of $\mu$CRL and mCRL2
A first-person, richly cited history of μCRL and mCRL2 by their creators, covering the SPECS-era origins, tool development, verification methodology, and industrial applications, with no new formal results.