Abstract
We present an algorithm for escape analysis inspired by, but more precise than, the one proposed by Gay and Steensgaard [D. Gay and B. Steensgaard. Fast escape analysis and stack allocation for object-based programs. In CC'00. Springer-Verlag, 2000]. The primary purpose of our algorithm is to produce useful information to allocate memory using a region-based memory manager. The algorithm combines intraprocedural variable-based and interprocedural points-to analyses. This is a work in progress towards achieving an application-oriented trade-off between precision and scalability. We illustrate the algorithm on several typical programming patterns, and show experimental results of a first prototype on a few benchmarks.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
