Extended type-based information flow analysis for pi-calculus to support dynamically extensible security lattices.
A spectrum of approximate probabilistic bisimulations,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
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.
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.
-
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.