M. Mohnen. E#cient compile-time garbage collection for arbitrary data structures. In Proceedings of Programming Languages: Implementations, Logics and Programs, number 982 in Lecture Notes in Computer Science, pages 241--258. Springer--Verlag, 1995. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Fast Escape Analysis and Stack Allocation for Object-Based.. - Gay, Steensgaard (2000) (15 citations) (Correct)
....the runtime stack using a very simple analysis algorithm. The increase in stack size is relatively small. 6 Related Work Escape analysis and stack allocation or compile time garbage collection based on same have been performed on functional languages like SML or Lisp [Bla98, Deu97, Hug92, ISY88, Moh95, PG92] and recently for Java [CGS 99, Bla99, 3 Performance numbers for a larger and partially overlapping set of benchmarks are presented in [FKR 99] Table 2. objects allocated on the stack Name Code Stack Allocated Stack allocated Reduced increase increase objs bytes objects ....
Markus Mohnen. E#cient compile-time garbage collection for arbitrary data structures. Technical Report 95-08, RWTH Aachen, Department of Computer Science, 1995.
Stack Allocating Objects in Java (Extended Abstract) - Gay, Steensgaard (Correct)
....unreachable (compile time garbage collection) The two major approaches are escape analysis and region inference. Stack allocation and compile time garbage collection based on escape analysis have mostly been performed on functional languages like SML [MTH90] or Lisp [Bla98, Deu97, Hug92, ISY88, Moh95, PG92] The precision of the escape analyses considered in these papers is much greater than ours. For instance, they can find that a function s result does not contain elements from the spine of its second argument (a list) This extra precision appears to be necessary for e#ective stack ....
Markus Mohnen. E#cient compile-time garbage collection for arbitrary data structures. Technical Report 95-08, RWTH Aachen, Department of Computer Science, 1995.
Experiments on the Effectiveness of an Automatic Insertion of.. - Lee, Yi (2004) (Correct)
No context found.
M. Mohnen. E#cient compile-time garbage collection for arbitrary data structures. In Proceedings of Programming Languages: Implementations, Logics and Programs, number 982 in Lecture Notes in Computer Science, pages 241--258. Springer--Verlag, 1995.
Inserting Safe Memory Reuse Commands into ML-like Programs - Lee, Yang, Yi (2003) (1 citation) (Correct)
No context found.
Markus Mohnen. E#cient compile-time garbage collection for arbitrary data structures. In Proceedings of Programming Languages: Implementations, Logics and Programs, volume 982 of Lecture Notes in Computer Science, pages 241--258. Springer--Verlag, 1995.
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