Data Structure Analysis: A Fast and Scalable Context-Sensitive Heap Analysis

@misc{citeulike:481269, abstract = {In our recent work, we have developed compiler analyses and transformations that operate at the level of entire logical data structures, rather than individual load and store operations or individual data elements. This paper describes a fast, scalable heap analysis algorithm that has been the foundation for supporting such transformations, which we call Data Structure Analysis. Data Structure Analysis is fully context-sensitive (in the sense that it resolves memory objects by entire acyclic...}, author = {Lattner, C. and Adve, V. }, citeulike-article-id = {481269}, posted-at = {2007-11-18 23:02:55}, priority = {2}, title = {Data Structure Analysis: A Fast and Scalable Context-Sensitive Heap Analysis}, url = {http://citeseer.ist.psu.edu/691154.html}, year = {2003} }

TY - GEN ID - citeulike:481269 L3 - citeulike-article-id:481269 TI - Data Structure Analysis: A Fast and Scalable Context-Sensitive Heap Analysis N2 - In our recent work, we have developed compiler analyses and transformations that operate at the level of entire logical data structures, rather than individual load and store operations or individual data elements. This paper describes a fast, scalable heap analysis algorithm that has been the foundation for supporting such transformations, which we call Data Structure Analysis. Data Structure Analysis is fully context-sensitive (in the sense that it resolves memory objects by entire acyclic... AU - Lattner, C AU - Adve, V PY - 2003/// UR - http://citeseer.ist.psu.edu/691154.html ER -