Tofte, M. and Birkedal, L. 1998. A region inference algorithm. Transactions on Programming Languages and Systems 20, 4 (Nov.), 734-767. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Escape Analysis: Final Report for EPSRC grant GR/R53401 - Hill (2002) (Correct)
....interest (in our case: which data structures will still be accessed) To further explore the bene ts of escape analysis and therefore the results of this project, Dr Spoto began studying the relations between escape analysis and the automatic region annotation of Java programs. Region annotation [18] consists of the decoration of a Java program with directives that assist the garbage collector in its task. These directives can for instance specify a program point where the objects bound to a given expression can always be deallocated. Note that this technique can, in principle, totally ....
M. Tofte and L. Birkedal. A Region Inference Algorithm. TOPLAS, 20(4):724-767, 1998.
Statically Determining Memory Consumption of Real-Time Java.. - Gheorghioiu (2002) (5 citations) (Correct)
....programs [17, 7, 6] but these algorithms focused on allocating objects on the call stack. Researchers have also developed algorithms that are designed to correlate the lifetimes of objects with the lifetimes of invoked functions, then use this information to allocate objects in di erent regions [15]. The goal is to eliminate garbage collection overhead by statically deallocating all of the objects allocated in a given region when the corresponding function returns. 46 Of these analyses, the analysis of Bogda and Hoelzle [7] is closest in spirit to our analysis. Their analysis is more ....
M. Tofte and L. Birkedal. A Region Inference Algorithm. In ACM Transactions on Programming Languages and Systems, 20(4), July 1998.
Type and Effect Systems - Nielson, Nielson (1999) (1 citation) (Correct)
....becomes an issue. Indeed, polymorphic recursion over type variables makes the polymorphic type system undecidable. It is therefore wise to restrict the polymorphic recursion to annotation variables only as in [44] There the first stage is still ordinary type inference; the second stage [43] concerns an algorithm S that generates e#ect and region variables and an algorithm R that deals with the complications due to polymorphic recursion (for e#ects and regions only) The inference algorithm is proved syntactically sound but is known not to be syntactically complete; indeed, ....
M. Tofte and L. Birkedal. A region inference algorithm. ACM TOPLAS, 20(3):1-- 44, 1998.
Type-Based Analysis of Uncaught Exceptions - Pessaux, Leroy (1999) (32 citations) (Correct)
....of recursive data structures; on the other hand, type inference is much easier. The principles of effect systems were studied extensively in the early 90s [16, 28] but few practical applications have been developed since. An impressive application is the region analysis of Tofte et al. [30, 29]. Like ours, its precision is improved by typing recursion polymorphically. Several program analyses based on unification and running in quasi linear time have been proposed as faster alternatives to more conventional dataflow analyses. Two wellknown examples are Henglein s tagging analysis [10] ....
M. Tofte and L. Birkedal. A region inference algorithm. ACM Trans. Prog. Lang. Syst., 1998. To appear.
Unification and Polymorphism in Region Inference - Tofte, Birkedal (1996) (2 citations) Self-citation (Tofte Birkedal) (Correct)
....the difficulty is that the unification is of sets rather than terms. Similar forms of unification have been studied in record typing[16] and in type systems for polymorphic references[9] The region inference algorithm that is currently used in the ML Kit is described and proved correct in [20]. It is a syntax directed algorithm, similar to Milner s algorithm W , and it relies on the results about unification proved in the present paper. A different approach to region inference is to use constraints. Constraints have been used in previous work on ML type inference[5] subtyping [12, 4] ....
....that S 0 (S(B) B. Thus is a partial order on consistent bases. We write B 1 B 2 to mean B 1 B 2 and B 1 6= B 2 . Lemma 3 Let B 0 be a finite, consistent basis. There exists no infinite descending chain: B 0 B 1 B 2 Delta Delta Delta A proof of the above lemma may be found in [20]. The lemma plays a crucial role in the proof that the region inference algorithm terminates. The region inference algorithm iterates over the program, contracting the basis and modifying the program annotations in the process. Things are arranged so that if the program has been traversed without ....
[Article contains additional citation context not shown here]
M. Tofte and L. Birkedal. A region inference algorithm. (Submitted for publication; available at http://www.diku.dk/users/tofte/publ/toplassubm.a4.ps.Z ), November 1996.
Typed Memory Management via Static Capabilities - David Walker Carnegie (2000) (24 citations) (Correct)
No context found.
Tofte, M. and Birkedal, L. 1998. A region inference algorithm. Transactions on Programming Languages and Systems 20, 4 (Nov.), 734-767.
Memory Safety Without Runtime Checks or Garbage Collection - Dhurjati, Kowshik, Adve.. (2003) (7 citations) (Correct)
No context found.
M. Tofte and L. Birkedal. A region inference algorithm. ACM Trans. Prog. Lang. Sys., 20(1), 1998.
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