Precision vs. Scalability: Context Sensitive Analysis with Prefix Approximation

Medicherla, Raveendra Kumar and Komondoor, Raghavan (2015) Precision vs. Scalability: Context Sensitive Analysis with Prefix Approximation. In: International Conference on Software Analysis, Evolution, and Reengineering (SANER), MAR 02-06, 2015, Montreal, CANADA, pp. 281-290.

PDF 22nd_Int_Con_Sof_Ana_Evo_Ree_281_2015.pdf - Published Version Restricted to Registered users only Download (2MB) | Request a copy

Abstract

Context sensitive inter-procedural dataflow analysis is a precise approach for static analysis of programs. It is very expensive in its full form. We propose a prefix approximation for context sensitive analysis, wherein a prefix of the full context stack is used to tag dataflow facts. Our technique, which is in contrast with suffix approximation that has been widely used in the literature, is designed to be more scalable when applied to programs with modular structure. We describe an instantiation of our technique in the setting of the classical call-strings approach for inter-procedural analysis. We analyzed several large enterprise programs using an implementation of our technique, and compared it with the fully context sensitive, context insensitive, as well as suffix-approximated variants of the call-strings approach. The precision of our technique was in general less than that of suffix approximation when measured on entire programs. However, the precision that it offered for outer-level procedures, which typically contain key business logic, was better, and its performance was much better.

Item Type:	Conference Proceedings
Additional Information:	Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation
Date Deposited:	30 Aug 2016 10:16
Last Modified:	30 Aug 2016 10:16
URI:	http://eprints.iisc.ac.in/id/eprint/54533

Actions (login required)

View Item