Content area

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.

Details

1009240
Title
Hybrid Information Flow Analysis for Programs with Arrays
Publication title
arXiv.org; Ithaca
Publication year
2016
Publication date
Jul 8, 2016
Section
Computer Science
Publisher
Cornell University Library, arXiv.org
Source
arXiv.org
Place of publication
Ithaca
Country of publication
United States
University/institution
Cornell University Library arXiv.org
e-ISSN
2331-8422
Source type
Working Paper
Language of publication
English
Document type
Working Paper
Publication history
 
 
Online publication date
2016-07-11
Milestone dates
2016-07-08 (Submission v1)
Publication history
 
 
   First posting date
11 Jul 2016
ProQuest document ID
2079421051
Document URL
https://www.proquest.com/working-papers/hybrid-information-flow-analysis-programs-with/docview/2079421051/se-2?accountid=208611
Full text outside of ProQuest
Copyright
© 2016. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2019-09-09
Database
ProQuest One Academic