Hypercollecting Semantics and its Application to Static Analysis of Information Flow
Authors:
- Mounir AssafMAMounir Assaf
- David A. NaumannDNDavid A. Naumann
- Julien SignolesJSJulien Signoles
- Éric TotelÉTÉric Totel
- Frédéric TronelFTFrédéric Tronel
Preprint
Abstract
We show how static analysis for secure information flow can be expressed and proved correct entirely within the framework of abstract interpretation. The key idea is to define a Galois connection that directly approximates the hyperproperty of interest. To enable use of such Galois connections, we introduce a fixpoint characterisation of hypercollecting semantics, i.e. a "set of set" transformer. This makes it possible to systematically derive static analyses for hyperproperties entirely within the calculational framework of abstract interpretation. We evaluate this technique by deriving example static analyses. For qualitative information flow, we derive a dependence analysis similar to the logic of Amtoft and Banerjee (SAS'04) and the type system of Hunt and Sands (POPL'06). For quantitative information flow, we derive a novel cardinality analysis that bounds the leakage conveyed by a program instead of simply deciding whether it exists. This encompasses problems that are hypersafety but not k-safety. We put the framework to use and introduce variations that achieve precision rivalling the most recent and precise static analyses for information flow.Keywords
All Related Versions
- Version 1, 2016-08-04, ArXiv
- Version 2, 2016-11-07, ArXiv
- Published version: , 874.
This publication has 20 references indexed in Scilit:
- Precise quantitative information flow analysis— a symbolic approachTheoretical Computer Science, 2014
- Inverse-limit and topological aspects of abstract interpretationTheoretical Computer Science, 2012
- Modelling declassification policies using abstract domain completenessMathematical Structures in Computer Science, 2011
- Widening and narrowing operators for abstract interpretationComputer Languages, Systems & Structures, 2011
- From Exponential to Polynomial-Time Security Typing via Principal Types2011
- The trace partitioning abstract domainACM Transactions on Programming Languages and Systems, 2007
- Language-based information-flow securityIEEE Journal on Selected Areas in Communications, 2003
- Constructive design of a hierarchy of semantics of a transition system by abstract interpretationTheoretical Computer Science, 2002
- Principles of Program Analysis1999
- Abstract interpretation by dynamic partitioningJournal of Functional Programming, 1992