Pages that link to "Item:Q2978540"
From MaRDI portal
The following pages link to Computing Information Flow Using Symbolic Model-Checking (Q2978540):
Displaying 11 items.
- Sampling automata and programs (Q2339473) (← links)
- Quantifying leakage in the presence of unreliable sources of information (Q2361344) (← links)
- Hybrid statistical estimation of mutual information and its application to information flow (Q2414250) (← links)
- Precise quantitative information flow analysis -- a symbolic approach (Q2453114) (← links)
- An automata based approach for verifying information flow properties (Q2848479) (← links)
- Model Checking Information Flow in Reactive Systems (Q2891409) (← links)
- The Complexity of Quantitative Information Flow in Recursive Programs (Q2957526) (← links)
- A Logical System for Modular Information Flow Verification (Q3296345) (← links)
- Formal Analysis of Information Flow Using Min-Entropy and Belief Min-Entropy (Q5166664) (← links)
- Upper bound computation of information leakages for unbounded recursion (Q6045049) (← links)
- An automated quantitative information flow analysis for concurrent programs (Q6103027) (← links)