Inferring Effective Types for Static Analysis of C Programs

Abstract

The C language does not have a specific Boolean type: Boolean values are encoded with integers. This is also true for enumerated types, that may be freely and silently cast to and from integers. On the other hand, verification tools aiming at inferring the possible values of variables at each program point may benefit from the information that some (integer) variables are used solely as Boolean or enumerated type variables, or more generally as finite type variables with a small domain. Indeed, specialized and efficient symbolic representations such as BDDs may be used for representing properties on such variables, whereas approximated representations like intervals and octagons are better suited to larger domain integers and floating-points variables. Driven by this motivation, this paper proposes a static analysis for inferring more precise types for the variables of a C program, corresponding to their effective use. The analysis addresses a subset of the C99 language, including pointers, structures and dynamic allocation.

DOI: 10.1016/j.entcs.2012.10.006

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@article{Jeannet2012InferringET, title={Inferring Effective Types for Static Analysis of C Programs}, author={Bertrand Jeannet and Pascal Sotin}, journal={Electr. Notes Theor. Comput. Sci.}, year={2012}, volume={288}, pages={37-47} }