Extended type-based information flow analysis for pi-calculus to support dynamically extensible security lattices.
Barbed bisimulation,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Algorithms for all maximal palindromes with wildcards and k-mismatches, including linear-space methods and time-memory tradeoffs.
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.
-
On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and $k$-Mismatches
Algorithms for all maximal palindromes with wildcards and k-mismatches, including linear-space methods and time-memory tradeoffs.