Partial Flow Sensitivity

Roy, Subhajit and Srikant, YN (2007) Partial Flow Sensitivity. In: HiPC2007, Dec. 2007.

PDF Partial.pdf - Published Version Restricted to Registered users only Download (489Kb) | Request a copy

Abstract

Compiler optimizations need precise and scalable analyses to discover program properties. We propose a partially flow-sensitive framework that tries to draw on the scalability of flow-insensitive algorithms while providing more precision at some specific program points. Provided with a set of critical nodes — basic blocks at which more precise information is desired — our partially flow-sensitive algorithm computes a reduced control-flow graph by collapsing some sets of non-critical nodes. The algorithm is more scalable than a fully flow-sensitive one as, assuming that the number of critical nodes is small, the reduced flow-graph is much smaller than the original flow-graph. At the same time, a much more precise information is obtained at certain program points than would had been obtained from a flow-insensitive algorithm.

Item Type:	Conference Paper
Additional Information:	Copyright of this article belongs to Springer.
Keywords:	compilers;dataflow analysis;compiler optimizations;pointsto analysis.
Department/Centre:	Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)
Date Deposited:	17 Oct 2011 09:29
Last Modified:	17 Oct 2011 09:29
URI:	http://eprints.iisc.ernet.in/id/eprint/41485

Actions (login required)

View Item