Compositional pointer and escape analysis for Java programs Export

@article{citeulike:643875, abstract = {algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize how local variables and elds in objects refer to other objects. Each points-to escape graph also contains escape information, which characterizes how objects allocated in one region of the program can escape to be accessed by another region. The algorithm is designed to analyze arbitrary regions of complete or incomplete programs, obtaining complete information for objects that ...}, author = {Whaley, John and Rinard, Martin}, citeulike-article-id = {643875}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.2189}, comment = {doublon}, journal = {ACM SIG\-PLAN Notices}, number = {10}, pages = {187--206}, posted-at = {2006-05-22 08:45:40}, priority = {0}, title = {Compositional pointer and escape analysis for Java programs}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.2189}, volume = {34}, year = {1999} }

TY - JOUR ID - citeulike:643875 L3 - citeulike-article-id:643875 N2 - algorithm for Java programs. The algorithm is based on the abstraction of points-to escape graphs, which characterize how local variables and elds in objects refer to other objects. Each points-to escape graph also contains escape information, which characterizes how objects allocated in one region of the program can escape to be accessed by another region. The algorithm is designed to analyze arbitrary regions of complete or incomplete programs, obtaining complete information for objects that ... IS - 10 JF - ACM SIG\-PLAN Notices EP - 206 TI - Compositional pointer and escape analysis for Java programs VL - 34 SP - 187 N1 - doublon AU - Whaley, John AU - Rinard, Martin PY - 1999/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.2189 ER -