L. Unnikrishnan, S. D. Stoller, and Y. A. Liu. Optimized live heap bound analysis. In Proc. 4th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI), volume 2575 of Lecture Notes in Computer Science, pages 70--85. Springer-Verlag, jan 2003.  Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Optimized Live Heap Bound Analysis - Unnikrishnan, Stoller, Liu (2001) (2 citations) Self-citation (Unnikrishnan Stoller Liu) (Correct)
....At p 0 , because of R1 and R3, for every descendant of b 2 that is containedin j, there exists a unique descendant of b 1 that is contained in j. So, at p 0 , b 1 contributes at least as much to live as b 2 . It can be shown that this continues to be the case after p 0 . The complete proof is in [26]. 6 Handling Tail Call Optimization Tail call optimization [1] is handled in our analysis by recognizing function calls in tail position and at the sites of these calls, garbage collecting all variables in the current scope. The transformation for space functions is straightforward but that for ....
....uk element of the input list is both greater and less than every other uk element. The space bound function of quicksort terminates, while the time bound function for quicksort in [18] diverges. This is essentially because join values retain more information than partially known structures. See [26] for more details. The results in Figure 4 include the space used by top level arguments since these arguments are indeed live throughout the execution of the program. Figure 5 contains running times of live heap analysis of some examples; more results appear in [27, 26] For all examples, the ....
[Article contains additional citation context not shown here]
L. Unnikrishnan, S. D. Stoller, and Y. A. Liu. Optimized live heap bound analysis. Technical Report DAR 01-2, Computer Science Dept., SUNY at Stony Brook, Oct. 2001, Available at http://www.cs.sunysb.edu/~stoller/dar012.html.
Timber as an RTOS for Small Embedded Devices - Martin Kero Per (Correct)
No context found.
L. Unnikrishnan, S. D. Stoller, and Y. A. Liu. Optimized live heap bound analysis. In Proc. 4th International Conference on Verification, Model Checking and Abstract Interpretation (VMCAI), volume 2575 of Lecture Notes in Computer Science, pages 70--85. Springer-Verlag, jan 2003.
the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
No context found.
Leena Unnikrishnan, Scott D. Stoller, and Yanhong A. Liu. Optimized live heap bound analysis. Technical Report DAR 01-2, SUNY at Stony Brook, October 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC