We employ Clarkson and Schneider's "hyperproperties" to classify various verification problems of quantitative information flow. The results of this paper unify and extend the previous results on the hardness of checking and inferring quantitative information flow. In particular, we identify a subclass of liveness hyperproperties, which we call "k-observable hyperproperties", that can be checked relative to a reachability oracle via self composition.
|Number of pages||15|
|Journal||Electronic Proceedings in Theoretical Computer Science, EPTCS|
|Publication status||Published - 2012 Jul 3|
|Event||10th Workshop on Quantitative Aspects of Programming Languages and Systems, QAPL 2012 - Tallinn, Estonia|
Duration: 2012 Mar 31 → 2012 Apr 1
ASJC Scopus subject areas