作者: Michael Hind , Manish Gupta , Jong-Deok Choi
DOI:
关键词:
摘要: A method and several variants are provided for analyzing transforming a computer program such that instructions may be reordered even across throw an exception, while strictly preserving the precise exception semantics of original program. The uses analysis to identify subset state needs preserved if is thrown. Furthermore, performs transformation allows dependence constraints among potentially excepting completely ignored applying optimizations. This does not require any special hardware support, requires compensation code executed only thrown, i.e., no additional need Variants show how one or features performed.