\textit{D\_PSNI}: delimited persistent stochastic non-interference
From MaRDI portal
Publication:2049988
DOI10.1016/j.tcs.2021.08.007OpenAlexW3195546701MaRDI QIDQ2049988
Sabina Rossi, Andrea Marin, Carla Piazza
Publication date: 27 August 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2021.08.007
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primitives for authentication in process algebras.
- Noninterference for concurrent programs and thread systems
- Lumping-based equivalences in Markovian automata: algorithms and applications to product-form analyses
- Verifying persistent security properties
- Bisimulation-based Non-deterministic Admissible Interference and its Application to the Analysis of Cryptographic Protocols
- A Proof System for Information Flow Security
- A General Framework for Nondeterministic, Probabilistic, and Stochastic Noninterference
- Simple O(m logn) Time Markov Chain Lumping
- Flow logic for Dolev–Yao secrecy in cryptographic processes
- Persistent Stochastic Non-Interference
- Tools and Algorithms for the Construction and Analysis of Systems
- Unwinding Possibilistic Security Properties
This page was built for publication: \textit{D\_PSNI}: delimited persistent stochastic non-interference