Non-termination and secure information flow

DOI10.1017/S0960129511000181MaRDI QIDQ3103612zbMATH OpenOpenAlexFDO

Authors

Publication date 8 December 2011

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129511000181

zbMATH Keywords

Denning restrictionsfast probabilistic simulation on Markov chains

Mathematics Subject Classification ID

Markov processes (60J99) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• All Secrets Great and Small
• Information leakage of non-terminating processes
• A semantic approach to secure information flow
• scientific article; zbMATH DE number 1692935
• scientific article; zbMATH DE number 1759625

Cites work

• Bisimulation through probabilistic testing
• Certification of programs for secure information flow
• Comparative branching-time semantics for Markov chains
• Computational Secrecy by Typing for the Pi Calculus
• scientific article; zbMATH DE number 3145626 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)

Cited in

(1)

• Information leakage of non-terminating processes

This page was built for publication: Non-termination and secure information flow

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3103612)