Refinement-based CFG reconstruction from unstructured programs

  • Authors:
  • Sébastien Bardin;Philippe Herrmann;Franck Védrine

  • Affiliations:
  • CEA, LIST, Gif-sur-Yvette Cedex, France;CEA, LIST, Gif-sur-Yvette Cedex, France;CEA, LIST, Gif-sur-Yvette Cedex, France

  • Venue:
  • VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper addresses the issue of recovering a both safe and precise approximation of the Control Flow Graph (CFG) of an unstructured program, typically an executable file. The problem is tackled in an original way, with a refinement-based static analysis working over finite sets of constant values. Requirement propagation allows the analysis to automatically adjust the domain precision only where it is needed, resulting in precise CFG recovery at moderate cost. First experiments, including an industrial case study, show that the method outperforms standard analyses in terms of precision, efficiency or robustness.