An automated quantitative information flow analysis for concurrent programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Abstraction refinement with Craig interpolation and symbolic pushdown systems
- Backward and forward bisimulation minimization of tree automata
- CCS expressions, finite state processes, and three problems of equivalence
- Computing Information Flow Using Symbolic Model-Checking
- Forward and backward bisimulations for chemical reaction networks
- KeY: A Formal Method for Object-Oriented Systems
- Maximizing entropy over Markov processes
- On the Foundations of Quantitative Information Flow
- Precise quantitative information flow analysis -- a symbolic approach
- Quantifying information leakage of randomized protocols
- Quantitative information flow and applications to differential privacy
- Secure information flow by self-composition
- The dining cryptographers problem: Unconditional sender and recipient untraceability
- The optimum leakage principle for analyzing multi-threaded programs
- Three logics for branching bisimulation
Cited in
(5)- Automation of quantitative information-flow analysis
- The optimum leakage principle for analyzing multi-threaded programs
- Quantitative security analysis for multi-threaded programs
- Experiments in information flow analysis
- Addressing covert termination and timing channels in concurrent information flow systems
This page was built for publication: An automated quantitative information flow analysis for concurrent programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103027)