Madhavan, Ravichandhran and Komondoor, Raghavan (2011) Null Dereference Verification via Over-approximated Weakest Pre-conditions Analysis. In: ACM Sigplan Notices, 46 (10). pp. 1033-1052.
Null_Dereference.pdf - Published Version
Restricted to Registered users only
Download (973Kb) | Request a copy
Null dereferences are a bane of programming in languages such as Java. In this paper we propose a sound, demand-driven, inter-procedurally context-sensitive dataflow analysis technique to verify a given dereference as safe or potentially unsafe. Our analysis uses an abstract lattice of formulas to find a pre-condition at the entry of the program such that a null-dereference can occur only if the initial state of the program satisfies this pre-condition. We use a simplified domain of formulas, abstracting out integer arithmetic, as well as unbounded access paths due to recursive data structures. For the sake of precision we model aliasing relationships explicitly in our abstract lattice, enable strong updates, and use a limited notion of path sensitivity. For the sake of scalability we prune formulas continually as they get propagated, reducing to true conjuncts that are less likely to be useful in validating or invalidating the formula. We have implemented our approach, and present an evaluation of it on a set of ten real Java programs. Our results show that the set of design features we have incorporated enable the analysis to (a) explore long, inter-procedural paths to verify each dereference, with (b) reasonable accuracy, and (c) very quick response time per dereference, making it suitable for use in desktop development environments.
|Item Type:||Journal Article|
|Additional Information:||Copyright of this article belongs to Association for Computing Machinery.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||03 Feb 2012 12:30|
|Last Modified:||03 Feb 2012 12:31|
Actions (login required)