Hybrid information flow analysis for programs with arrays

Abstract : Information flow analysis checks whether certain pieces of (confidential) data may affect the results of computations in unwanted ways and thus leak information. Dynamic information flow analysis adds instrumentation code to the target software to track flows at run time and raise alarms if a flow policy is violated; hybrid analyses combine this with preliminary static analysis. Using a subset of C as the target language, we extend previous work on hybrid information flow analysis that handled pointers to scalars. Our extended formulation handles arrays, pointers to array elements, and pointer arithmetic. Information flow through arrays of pointers is tracked precisely while arrays of non-pointer types are summarized efficiently. A prototype of our approach is implemented using the Frama-C program analysis and transformation framework. Work on a full machine-checked proof of the correctness of our approach using Isabelle/HOL is well underway; we present the existing parts and sketch the rest of the correctness argument.
Document type :
Conference papers
Complete list of metadatas

https://hal-cea.archives-ouvertes.fr/cea-01836511
Contributor : Léna Le Roy <>
Submitted on : Thursday, July 12, 2018 - 1:24:31 PM
Last modification on : Wednesday, January 23, 2019 - 2:39:33 PM

Links full text

Identifiers

Collections

Citation

G. Barany. Hybrid information flow analysis for programs with arrays. Proceedings VPT 2016, Apr 2016, Eindhoven, Netherlands. pp.5-23, ⟨10.4204/EPTCS.216.1⟩. ⟨cea-01836511⟩

Share

Metrics

Record views

44