Ole Agesen. Design and Implementation of Pep, a Java Just-in-Time Translator. Theory and Practice of Object Systems, 3(2):127--155, 1997. (p 45) Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Extensible Virtual Machines - Harris (2001) (4 citations) (Correct)
....frames to be heap allocated if they are captured as part of the state of a continuation. The jvm does not provide access to stack frames as first class entities. Pep 3.1. 3 Pep is a Just In Time (jit) compiler for Java which operates by translating Java bytecode for execution on the self vm [Agesen97a] As described in Section 2.1.4, self is a prototype based pure object oriented language. Each Java class is compiled to two objects: one representing the static methods and fields, and another defining the ordinary methods and fields as a prototype for any instances that are created. Systematic ....
Ole Agesen. Design and Implementation of Pep, a Java Just-in-Time Translator. Theory and Practice of Object Systems, 3(2):127--155, 1997. (p 45)
Assembly to High-Level Language Translation - Cifuentes, Simon, Fraboulet (1998) (6 citations) (Correct)
....in the underlying DFST to a higher node in the tree; i.e. order(h) order (l) and the edge (l; h) 2 E. In our work, we have used interval theory [2] to determine the nesting level of loops and the nodes that belong to the loop. However, different methods can be used for this purpose, for example [3, 1, 10]. Using intervals, the nodes that belong to a loop can be determined by the following set: loopNodes(h Phi l) fn 2 N ffl order(l) 6 order(n) order(h)n 2 I(h)g where I(h) denotes the interval that h belongs to. Nodes that belong to a loop are tagged as belonging to the most nested loop they ....
O. Agesen. Design and implementation of Pep, a Java just-in-time translator. Theory and Practice of Object Systems, 3(2):127--155, 1997.
OpenJIT Frontend System: an implementation of the.. - Ogawa, Shimura.. (2000) (3 citations) Self-citation (Implementation) (Correct)
....6. Reconstruct the Java control structure using the algorithm described in [16] 7. Output the result as an AST, augmented with control flow and dominator information. All the above steps except (6) are either simple, or could be done with existing techniques, such as that described in [20]. Step (6) is quite di#cult; most previous techniques published so far analyzed the CFG directly, and used pattern matching to extract valid Java control structures [20, 26] Instead, we have proposed an algorithm which walks over the dominator tree, and enumerates over every possible patterns of ....
.... All the above steps except (6) are either simple, or could be done with existing techniques, such as that described in [20] Step (6) is quite di#cult; most previous techniques published so far analyzed the CFG directly, and used pattern matching to extract valid Java control structures [20, 26]. Instead, we have proposed an algorithm which walks over the dominator tree, and enumerates over every possible patterns of dominance relation, which has a corresponding Java control structure. Compared to existing techniques such as Krakatoa[26] our method was shown to be faster, and more ....
O. Agesen. Design and Implementation of Pep, a Java Just-In-Time Translator. Theory and Practice of Object Systems, 3(2):127--155, 1997.
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