Program Analysis Using Symbolic Ranges

Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow checks. In practice, however, intervals by themselves are often inadequate as invariants due to the lack of relational information among program variables. In this paper, we present a technique for deriving symbolic bounds on variable values. We study a restricted class of polyhedra whose constraints are stratified with respect to some variable ordering provided by the user, or chosen heuristically. We define a notion of normalization for such constraints and demonstrate polynomial time domain operations on lting domain of symbolic range constraints. The abstract domain is intended to complement widely used domains such as intervals and octagons for use in buffer overflow analysis. Finally, we study the impact of our analysis on commercial software using an overflow analyzer for the C language.

• Type: Conference
• Year: 2007
• Where: SAS
• Authors: Sriram Sankaranarayanan, Franjo Ivancic, Aarti Gupta
• Keywords: Buffer Overflow, Formal Methods, Program Variables, SAS 2007, Upper Bounds