Partial Flow Sensitivity
Data(s) |
2007
|
---|---|
Resumo |
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. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/41485/1/Partial.pdf Roy, Subhajit and Srikant, YN (2007) Partial Flow Sensitivity. In: HiPC2007, Dec. 2007. |
Publicador |
Springer |
Relação |
http://www.springerlink.com/content/l567106vv1491k28/ http://eprints.iisc.ernet.in/41485/ |
Palavras-Chave | #Computer Science & Automation (Formerly, School of Automation) |
Tipo |
Conference Paper PeerReviewed |