Pages that link to "Item:Q2957526"
From MaRDI portal
The following pages link to The Complexity of Quantitative Information Flow in Recursive Programs (Q2957526):
Displaying 6 items.
- The complexity of synchronous notions of information flow security (Q278742) (← links)
- Sampling automata and programs (Q2339473) (← links)
- Quantified interference for a while language (Q2849851) (← links)
- Assessing security threats of looping constructs (Q3189801) (← links)
- (Q4893148) (← links)
- Upper bound computation of information leakages for unbounded recursion (Q6045049) (← links)