TY - GEN
T1 - Automatic determination of may/must set usage in data-flow analysis
AU - Stone, Andrew
AU - Strout, Michelle
AU - Behere, Shweta
PY - 2008
Y1 - 2008
N2 - Data-flow analysis is a common technique to gather program information for use in transformations such as register allocation, dead-code elimination, common subexpression elimination, scheduling, and others. Tools for generating data-flow analysis implementations remove the need for implementers to explicitly write code that iterates over statements in a program, but still require them to implement details regarding the effects of aliasing, side effects, arrays, and user-defined structures. This paper presents the DFAGen Tool, which generates implementations for locally separable (e.g. bit-vector) data-flow analyses that are pointer, side-effect, and aggregate cognizant from an analysis specification that assumes only scalars. Analysis specifications are typically seven lines long and similar to those in standard compiler textbooks. The main contribution of this work is the automatic determination of may and must set usage within automatically generated data-flow analysis implementations.
AB - Data-flow analysis is a common technique to gather program information for use in transformations such as register allocation, dead-code elimination, common subexpression elimination, scheduling, and others. Tools for generating data-flow analysis implementations remove the need for implementers to explicitly write code that iterates over statements in a program, but still require them to implement details regarding the effects of aliasing, side effects, arrays, and user-defined structures. This paper presents the DFAGen Tool, which generates implementations for locally separable (e.g. bit-vector) data-flow analyses that are pointer, side-effect, and aggregate cognizant from an analysis specification that assumes only scalars. Analysis specifications are typically seven lines long and similar to those in standard compiler textbooks. The main contribution of this work is the automatic determination of may and must set usage within automatically generated data-flow analysis implementations.
UR - http://www.scopus.com/inward/record.url?scp=56349147778&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=56349147778&partnerID=8YFLogxK
U2 - 10.1109/SCAM.2008.28
DO - 10.1109/SCAM.2008.28
M3 - Conference contribution
AN - SCOPUS:56349147778
SN - 9780769533537
T3 - Proceedings - 8th IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2008
SP - 153
EP - 162
BT - Proceedings - 8th IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2008
T2 - 8th IEEE International Working Conference on Source Code Analysis and Manipulation, SCAM 2008
Y2 - 28 September 2008 through 29 September 2008
ER -