L. Unnikrishnan, S. D. Stoller, and Y. A. Liu. Automatic accurate live memory analysis for garbage-collected languages. In Proceedings of The Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES), pages 102--111. ACM, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Static Prediction of Heap Space Usage for First-Order.. - Hofmann, Jost (2003) (10 citations) (Correct)
....of the former tree within the heap, saving an exponential amount of space. However, this structure should only be used for read only purposes, as destroying any of the element lists leads to malignant sharing. 10. RELATED WORK Approaches based on abstract interpretation and symbolic evaluation [7, 13, 4, 20, 5, 6] go in the direction of the naive approach mentioned in the Introduction. The structure of the inferred resource bound matches the structure of the program. Where the program contains a while loop or a recursion the bounding function will do so as well. This is not meant to diminish the value of ....
....that the algorithm for their intention is provably successful and ecient in a well delineated subset of programs which comprises most textbook examples of functional programming such as reversal, quicksort, insertion sort, heap sort, Hu man codes, tree traversal, etc. Indeed, Unnikrishnan et al. [20] report performance problems with medium sized inputs and recommend to t an algebraic expression into a value table obtained from small inputs. This is acceptable for pro ling purposes but certainly not for resource certi cation. In other works like [3] the user must provide a conjectured ....
Leena Unnikrishnan, Scott D. Stoller, and Yanhong A. Liu. Automatic accurate live memory analysis for garbage-collected languages. In Proceedings of The Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES 2001.
Dynamic Programming via Static Incrementalization - Liu, Stoller (2002) (13 citations) Self-citation (Stoller Liu) (Correct)
....and pruning produce programs that are at least as fast as the given program, but caching auxiliary information may result in a slower program on certain inputs. We can determine statically whether such information is cached in the nal program. If so, we can use time and space analysis [32, 54, 59, 60, 61] to determine conservatively whether it is worthwhile to use and maintain such information. The trade o between time and space is an open problem for future study. Additional properties. Many dynamic programming algorithms can be further improved by exploiting additional properties, such as ....
L. Unnikrishnan, S. D. Stoller, and Y. A. Liu. Automatic accurate live memory analysis for garbage-collected languages. In Proceedings of the ACM SIGPLAN 2001.
Optimized Live Heap Bound Analysis - Unnikrishnan, Stoller, Liu (2001) (2 citations) Self-citation (Unnikrishnan Stoller Liu) (Correct)
....maximum max(v 1 ; v 2 ) of constructor count vectors v 1 and v 2 is v 1 if v 1 P v 2 P and is v 2 otherwise. The transformation L in Figure 2 produces live heap space functions. The transformation of testers and let expressions is elided for brevity. The complete transformation appears in [27]. L introduces two global variables, live and maxlive, that satisfy: 1) for each constructor c, live[i c ] is the number of live instances of c; 2) maxlive is the maximum value of live so far during execution. The maximum live space used during evaluation of function f is at most ml P ; ml is ....
....4 Live Heap Space Bound Functions The transformation L b in Figure 3 produces live heap space bound functions. The transformation of certain expressions is elided for brevity; for variables, literals and constructor applications L b works the same way as L. The complete transformation appears in [27]. We sometimes refer to space bound functions simply as bound functions. At every point during the execution of L b [ f ] x) the value of live is an upper bound on the possible values of live at the corresponding point in executions of L [ f ] x ) for all x in the set represented ....
[Article contains additional citation context not shown here]
L. Unnikrishnan, S. D. Stoller, and Y. A. Liu. Automatic accurate live memory analysis for garbage-collected languages. In Proc. ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES), pages 102-111. ACM Press, 2001.
Automatic Accurate Cost-Bound Analysis for High-Level Languages - Liu, Gómez (2001) Self-citation (Liu) (Correct)
....and ecient. We have started to explore a suite of new language based techniques for cost analysis, in particular, analyses and optimizations for further speeding up the evaluation of the costbound function. We have also applied our general approach to analyze stack space and live heap space [48], which can further help predict garbage collection and caching behavior. We can also analyze lower bounds using a symmetric method, namely by replacing maximum with minimum at all conditional points. A future work is to accommodate more lowerlevel dynamic factors for timing at the source language ....
L. Unnikrishnan, S. D. Stoller, and Y. A. Liu. Automatic accurate live memory analysis for garbagecollected languages. In Proceedings of the ACM SIGPLAN 2001 Workshop on Languages, Compilers, and Tools for Embedded Systems. ACM, New York, June 2001. 30
lfd_infer: an Implementation of a Static Inference on Heap Space.. - Jost (2004) (Correct)
No context found.
L. Unnikrishnan, S. D. Stoller, and Y. A. Liu. Automatic accurate live memory analysis for garbage-collected languages. In Proceedings of The Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES), pages 102--111. ACM, 2001.
the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
No context found.
Leena Unnikrishnan, Scott D. Stoller, and Yanhong A. Liu. Automatic accurate live memory analysis for garbage-collected languages. In ACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES), 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