M. Mohnen. Efficient closure utilisation by higher-order inheritance analysis. To appear in Proceedings of SAS 95 (LNCS), 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Escape Analysis for Object Oriented Languages. Application to Java - Blanchet (1999) (26 citations) (Correct)
....loss of precision in the higher order case) He has also suggested several extensions. In [5] we gave a complete implementation of escape analysis on the Caml Special Light compiler (an implementation of ML) with some extensions, and a proof of correctness as well as experimental data. Mohnen [25, 26] describes a similar analysis, but the analyzed language is restricted to first order and does not handle imperative operations. Hughes [20] already introduces integer levels to represent the escaping part of data. He does not perform stack allocation, but keeps in memory the addresses of data to ....
Mohnen, M. Efficient Closure Utilisation by HigherOrder Inheritance Analysis. In Static Analysis Symposium (SAS'95) (1995), vol. 983 of Lecture Notes in Computer Science, Springer, pp. 261 -- 278.
Escape Analysis: Correctness Proof, Implementation and.. - Blanchet (1998) (1 citation) (Correct)
....otherwise, to republish, to post on servers or to redistribute to lists, requires specific permission and or fee. POPL 98 San Diego CA USA Copyright 1998 ACM 0 89791 979 3 98 01. 3.50 an unavoidable loss of precision in the higher order case) He has also suggested many extensions. Mohnen [30, 29] describes a similar analysis, but its complexity is quadratic and the analyzed language is first order and does not contain imperative operations. Hughes [24] already introduces integer levels to represent the escaping part of data. He does not perform stack allocation, but keeps in memory ....
Mohnen, M. Efficient closure utilisation by higher-order inheritance analysis. In Static Analysis Symposium (SAS'95) (1995).
Efficient Compile-Time Garbage Collection for Arbitrary Data.. - Mohnen (1995) (9 citations) Self-citation (Mohnen) (Correct)
No context found.
M. Mohnen. Efficient closure utilisation by higher-order inheritance analysis. To appear in Proceedings of SAS 95 (LNCS), 1995.
Efficient Compile-Time Garbage Collection for Arbitrary Data.. - Mohnen (1995) (9 citations) Self-citation (Mohnen) (Correct)
....and not its definition. This may be of interest in the context of modules, where the definition is not available. 6. We compute the abstract function only for their test arguments, which makes the analysis fast. More work needs to be done in the following directions: Higher order functions: In [Moh95a] we describe a higher order version of our analysis. The representation of functions with functional argument or result within the abstract interpretation has two aspects: on the one hand, the interpretation must be extended to handle function as arguments and results, and on the other hand, we ....
M. Mohnen. Efficient closure utilisation by higher-order inheritance analysis. To appear in Proceedings of SAS 95 (LNCS), 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