Work

Probabilistic Noninterference Based on Program Dependence Graphs

Year: 2012
Type: book
Abstract: We present a new algorithm for checking probabilistic noninterference in concurrent programs. The algorithm uses the Low-Security Observational Determinism criterion. It is based on program dependence graphs for concurrent programs, and is thus very precise: it is flowsensitive, context-sensitive, object-sensitive, and optionally time-sensitive. The algorithm has been implemented for full Java bytecode with unlimited threads, and avoids restrictions or soundness leaks of previous approaches. A soundness proof is provided. Precision and scalability have been experimentally validated.
Language: English
Subfield: Software
Open Access status: green
OpenAlex ID: W2183901409
FWCI: 3.488
Cites: 38
Cited by: 9
Related to: 10