Ole Agesen, Jens Palsberg, and Michael I. Schwartzbach. Type inference of SELF: Analysis of objects with dynamic and multiple inheritance. Softw., Pract. Exper., 25(9):975--995, 1995.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....methods was presented in Palsberg and Schwartzbach [9] The algorithm guarantees that all objects understand all messages sent to them. Self is a prototype based language that includes both dynamic and multiple inheritance. Like the Smalltalk algorithm, the approach for Self in Agesen et al. [10] is to derive and solve sets of type constraints. Both of these approaches handle types on a coarse grained level, namely at the granularity of classes or prototypes. Imposing a static view of types on a language with inheritance sometimes leads to problematic theoretical issues. These issues ....

O. Agesen, J. Palsberg & M. Schwartzbach (1993) Type inference in SELF: analysis of objects with dynamic and multiple inheritance. ECOOP'93 European Conference on Object Oriented Programming. Lecture Notes in Computer Science, Vol. 707. Springer, Berlin, pp. 247}267.

.... of virtual method calls [DS84] CUL89] Much previous work has attempted to overcome this performance problem with a suite of optimization techniques aimed at reducing the cost of dynamic dispatch: inlining [CU93] customization ( CU89] CU93] splitting ( CU93] CU90] type inference [APS93], type feedback [HU94a] specialization [DCG95a] and adaptive optimization [HU94a] Together, these optimizations can dramatically improve the performance of pure object oriented languages. Many of these optimizations trade code space for speed by creating multiple specialized copies of a piece ....

Ole Agesen, Jens Palsberg, and Michael I. Schwartzbach. Type Inference of Self: Analysis of Objects with Dynamic and Multiple Inheritance. In ECOOP `93 Conference Proceedings, p. 247-267, Kaiserslautern Germany, July 1993.

....cant changes in objects structure to obtain a better memory usage. Modula 3 [9] supports limited change of objects behaviour, by allowing objects method suites to be determined at object creation time. Self [2] allows dynamic inheritance among prototypes, thus making type inference dicult [3]. In BETA [23] nested patterns model dynamic state changes, but require dynamic type checking. For concurrent objects [25] gives behavioural types that guarantee that every message has a chance of being received if it requires a method that may be enabled at some point in the future. Fickle is ....

O. Agesen, J. Palsberg, and M.I. Schwartzbach. Type inference of Self: Analysis of objects with dynamic and multiple inheritance. Software - Practice and Experience, 25(9):975-995, 1995.

....function therefore merges the parallel interaction graphs from all potentially invoked methods to derive the parallel interaction graph at the point after the method invocation site. The current implementation obtains this call graph information using a variant of a cartesian product type analysis [1], but it can use any conservative approximation to the dynamic call graph. The analysis uses a worklist algorithm to solve the combined intraprocedural and interprocedural dataflow equations. A bottom up analysis of the program yields the full result with one analysis per strongly connected ....

.... initial parallel interaction graphs (except n v 0 ) will appear in the new parallel interaction graph: 0 1 (n) 1 (n) fng 0 2 (n) ae 2 (n) if n = n v 0 2 (n) fng otherwise The algorithm uses 0 1 and 0 2 to compute the resulting parallel interaction graph as follows: O 0 = O[ 0 1 ] [ O2 [ 0 2 ] I 0 = I[ 0 1 ] I2 Gamma V Theta N ) 0 2 ] 0 = 0 1 ] 2 [ 0 2 ] ff 0 = ff[ 0 1 ] ff 2 [ 0 2 ] 0 = 0 1 ] 2 [ 0 2 ] O2 [ 0 2 ] ff 2 [ 0 2 ] Theta [ 0 1 ] nT [ 0 1 ] Theta 2 [ 0 2 ] In addition to combining the action ....

[Article contains additional citation context not shown here]

O. Agesen, J. Palsberg, and M. Schwartzbach. Type inference of SELF: analysis of objects with dynamic and multiple inheritance. Software---Practice and Experience, 25(9):975--995, Sept. 1995.

.... shares about 80 of its code with the interpreter, CecilInt) CecilInt 9,000 interpreter for the Cecil language [Chambers 1993] running a short Cecil test program Mango 7,000 automatically generated lexer parser for ANSI C, parsing a 700 line C file Typeinf 8,600 type inferencer for SELF [Agesen et al. 1993] UI1 15,200 prototype user interface using animation techniques [Chang and Ungar 1993] b UI3 4,000 experimental 3D user interface b Table 2: Benchmark programs 9 dynamic recompilation on interactive performance is explored later in Section 6. SELF 91 and SELF 93 nofeedback do not use ....

.... excludes the time spent in graphics primitives Benchmark Size (lines) a Description CecilComp 11,500 Cecil to C compiler compiling the Fibonacci function CecilInt 9,000 interpreter for the Cecil language [Chambers 1993] running a short test program Typeinf 8,600 type inferencer for SELF [Agesen et al. 1993] UI1 15,200 prototype user interface using animation techniques [Chang and Ungar 1993] b Table 5: Large SELF applications 10 20 30 40 50 60 70 80 90 100 0 10 20 30 40 50 60 execution time (seconds on SPARCstation 2) run number CecilComp CecilInt Typeinf UI1 Figure 17. ....

[Article contains additional citation context not shown here]

AGESEN, O., PALSBERG, J., AND SCHWARTZBACH, M., 1993. Type Inference of SELF: Analysis of Objects with Dynamic and Multiple Inheritance. ECOOP '93 Conference Proceedings. Lecture Notes in Computer Science, vol. 707, Springer Verlag, Berlin, 247-267.

....may be assigned dynamically, and that works similarly to dynamically changing the inheritance graph. Hence, dynamic inheritance exists, and it is hard to envision a greater exibility than what is already supported in prototype based languages like Self. There is support for type inference in Self [2], but this builds on a closed world assumption, so the entire program must be available for the inference algorithm, and changing one single line of the code would potentially invalidate any of the inferred types. Smalltalk 80 [15] is class based, and every object is an instance of one particular ....

Agesen, Ole, Palsberg, Jens, and Schwartzbach, Michael I. 1993. Type Inference of SELF: Analysis of Objects with Dynamic and Multiple Inheritance. In Proceedings ECOOP '93, LNCS 707. Springer-Verlag, Kaiserslautern, Germany, 247-267.

....static call graph to work well, and many intraprocedural optimizations are ineffective for the small function bodies present in objectoriented programs. Thus the presence of dynamic dispatch hinders optimization, and consequently, the resulting program will run more slowly. Concrete type inference [106, 130,2, 110, 3] or link time optimizations [10,58] can determine the concrete receiver types of calls, possibly eliminating dynamic dispatch for many sends. When a call site has the same target for a sufficiently long time, a dynamic compilation system can detect this through type feedback [70] and recompile ....

Ole Agesen, Jens Palsberg, and Michael I. Schwartzbach. Type Inference of SELF: Analysis of Objects with Dynamic and Multiple Inheritance. In ECOOP '93 Conference Proceedings, p. 247-267. Kaiserslautern, Germany, July 1993.

....group of objects which are described by one propagation pattern. The type system should allow for a combination of contracts and propagation patterns. The type system will be based on our previous work on type systems for object oriented languages [PS93, PS, PS90, PS91b, PS91a, PS92, OPS92, KPS, APS93] 1.6.2 Reengineering We will study algorithms for translating C programs (programs in any object oriented language) into propagation patterns. We have already successfully built a prototype which translates call graphs of C programs into propagation patterns [SL92] This program ....

Ole Agesen, Jens Palsberg, and Michael I. Schwartzbach. Type inference of Self: Analysis of objects with dynamic and multiple inheritance. In Proc. ECOOP'93, Seventh European Conference on Object-Oriented Programming, pages 247--267, Kaiserslautern, Germany, July 1993.

....as Java, simply retrieving a value can go from a load instruction to a dynamically dispatched message send on a heap object. Interface overheads are often exhibited as slower and more frequent procedure calls and pointer dereferences. The overheads induced by indirect method calls are well studied [3, 1, 9, 31, 35, 28, 29, 16, 36], and both static and dynamic optimizations developed by our group and others in the community can dramatically reduce such procedure calling overhead. But modular software design also incurs ineciencies in data structure design and layout, because it encourages composing generic structures ....

O. Agesen, J. Palsberg, and M. Schwartzbach. Type inference of Self: Analysis of objects with dynamic and multiple inheritance. In Proceedings of ECOOP '93, 1993.

....inference is described by Palsberg and Schwartzbach in [16, 15] Their approach was limited to a single level of discrimination and motivated our efforts to develop an extendible inference approach. Recently Agesen has extended the basic one level approach to handle the features of SELF [22] see [1]) However, the problems with precision and cost inherent in a single pass approach are tackled by exploiting specialized knowledge about the SELF language [2] The soft typing system of Cartwright and Fagan [5] extends a Hindley Milner style type inference to support union and recursive types as ....

O. Agesen, J. Palsberg, and M. Schwartzbach. Type inference of Self: Analysis of objects with dynamic and multiple inheritance. In Proceedings of ECOOP '93, 1993.

.... can also be reduced by eliminating dispatches (rather than just making them fast) For example, the Self 93 system eliminates 95 of all dispatches [Hl94] with compiler optimizations such as customization [CUL89] and type feedback [HU94] Similarly, concrete type inference [OPS92] VHU92] [APS93], PC94] can determine the concrete receiver types of calls, possibly eliminating dynamic dispatch for many sends. The Apple Object Pascal linker [App88] turned dynamically dispatched calls into statically bound calls if a method had exactly one implementation; Calder et al. CG94] report that ....

Ole Agesen, Jens Palsberg, and Michael I. Schwartzbach. Type Inference of SELF: Analysis of Objects with Dynamic and Multiple Inheritance. In ECOOP '93 Conference Proceedings, p. 247-267. Kaiserslautern, Germany, July 1993.

....class analysis in C [Pand94] is built upon Landi s alias analysis for C [Land91] and uses an extension of Landi s conditional points to information as the basis for its context sensitivity. Prior to developing CPA, Agesen proposed the hash algorithm to improve the analysis of Self programs [Ages93]. The hash algorithm makes context sensitivity decisions by hashing a description of the calling context; call sites of a target method that compute the same hash value will share the same callee contour. The original hash algorithm computed a simple hash function from limited information that ....

Ole Agesen, Jens Palsberg, and Michael I. Schwartzbach. Type inference of Self: Analysis of objects with dynamic and multiple inheritance. In O. Nierstrasz, editor, Proceedings ECOOP '93, LNCS 707, pages 247--267, Kaiserslautern, Germany, July 1993. Springer-Verlag.

....1 Introduction The background of this work lies in fault management of open distributed applications, a field we have been working in for the past few years. A year ago, we have terminated a project in which we built a management infrastructure for the operational E mail service of our university [1, 2]. Now we are exploring the field from a more conceptual viewpoint, aiming at elaborating a sound basis for automated fault management [3] The goal of fault management is to keep a system up and running and to cope with failures in the environment or in parts of the system itself. A manager ....

....how our approach can be applied also other application architectures. This, however, is a long term goal of our research. For the time being, we are working on the implementation and automation of our algorithms and on their application to distributed store and forward applications. Bibliography [1] V. Baggiolini, E. Solana, M. Ramluckun, S. Spahni, C.F. Tschudin and J. Harms, Managing the E Mail Service with the Distributed Management Tree , ICDP 96, Dresden, February 1996. 2] E. Solana, M. Ramluckun, V. Baggiolini, C. Tschudin, S. Spahni, J. Harms, Vers une gestion automatique des ....

[Article contains additional citation context not shown here]

Agesen, O., Palsberg, J., Schwartzbach, M.I.: Type Inference of SELF: Analysis of Objects with Dynamic and Multiple Inheritance. In O.M.Nierstrasz (ed.), Proc. ECOOP'93, LNCS 707, Springer-Verlag Berlin, ISBN 3-540-57120-5, pp. 247267.

....this is called dynamic inheritance. Consequently, BST s can be implemented in SELF so that an object which at one time inherits the behavior of a Null BST can, via dynamic inheritance, change its parent to a non Null BST. A partial example of the implementation of BST s in SELF can be found in [1]. While it s important to recognize that the ability to implement one s favorite example can be a dangerous way to choose a language, SELF should certainly be explored as an OOP for teaching purposes. A team at Brown University has begun to look into this area [19] Kim Bruce has developed binary ....

Agesen, Ole, Jens Palsberg and Michael I. Schwartzbach, "Type Inference of SELF: Analysis of Objects with Dynamic and Multiple Inheritance". Proceedings of the European Conference on Object-Oriented Programming 1993, Springer-Verlag. (Available via [16].)

....whatever inheritance hierarchy you want at any time by assigning to the parent slots. Admittedly, dynamic inheritance exists, and you could hardly envision a greater flexibility than what is already supported in prototype based languages like Self. There is also support for type inference in Self [1], but this builds on a closed world assumption, so the entire program must be available for the inference algorithm, and changing one single line of the code would potentially invalidate any of the inferred types. Nevertheless, Self serves as an ideal with respect to the flexibility. Smalltalk 80 ....

Ole Agesen, Jens Palsberg, and Michael I. Schwartzbach. Type inference of SELF: Analysis of objects with dynamic and multiple inheritance. In O. Nierstrasz, editor, Proceedings ECOOP '93, LNCS 707, pages 247--267, Kaiserslautern, Germany, July 1993. Springer-Verlag.

.... run time efficiency of SELF, a dynamically typed language, uses customization, iterative type analysis and inline caches to replace dynamic binding with procedure calls or inlined code [CU89, CU90, HCU91] More recently, the algorithms using run time type feedback [HCU94] and type inference [APS93] for optimizing SELF programs have shown promise of adaptability to C . The algorithm by Larcheveque [Lar92] is rendered imprecise by the fact that it factors out the side effects of function invocations and aliasing due to parameter bindings as well as pointers. The suggested algorithms for ....

Ole Agesen, Jens Palsberg, and Michael Schwartzbach. Type inference of SELF: Analysis of objects with dynamic and multiple inheritance. In ECOOP '93 Conference Proceedings, pages 247--267, July 1993.

No context found.

Ole Agesen, Jens Palsberg and Michael I. Schwartzbach, `Type inference of Self: Analysis of objects with dynamic and multiple inheritance', Proc. ECOOP'93, Seventh European Conference on Object-Oriented Programming. Springer Lecture Notes in Computer Science 707, Springer, Berlin, 1993, pp. 247--267.

.... shown in [84] Abstract data types are employed in [86, 85] their relation to classes is discussed earlier in [31] Large languages are presented in [13, 11] Slide 86 Type inference for simple subtyping is developed in [69, 102, 59, 74, 105, 55, 104] Slide 88 94 Class inference is developed in [101, 45, 79, 76, 4]. Slide 96 ML modules are described in [67, 106] Slide 97 Approaches to genericity are discussed in [63, 49, 61, 73, 83] Annotated Bibliography 104 Slide 98 Multi methods are presented in [53, 72, 24, 25] Slide 99 The Self language is described in [108, 26, 27, 28, 48, 3] ....

Ole Agesen, Jens Palsberg, and Michael I. Schwartzbach. Type inference of Self: Analysis of objects with dynamic and multiple inheritance. In Proc. ECOOP'93, Seventh European Conference on Object-Oriented Programming, pages 247--267, Kaiserslautern, Germany, July 1993.

....of the fact that foo s argument is the integer 1. On the other hand, when compiling the statements j: i. i: i j the compiler will test j s class even if a simple dataflow analysis would reveal that j is equal to i. 2. 4 Type inference Concrete type inference or constraint based analysis [PS91][APS93][PC94a] unlike type feedback, does not rely on executing the program. Given the program source, this global analysis will statically compute a type for every expression in the program. The types, as in type feedback, are sets of classes, but unlike the types obtained by running an instrumented ....

Ole Agesen, Jens Palsberg, and Michael I. Schwartzbach. Type Inference of SELF: Analysis of Objects with Dynamic and Multiple Inheritance. In ECOOP `93 Conference Proceedings, p. 247-267. Kaiserslautern, Germany, July 1993.

....of the fact that foo s argument is the integer 1. On the other hand, when compiling the statements j: i. i: i j the compiler will test j s class even if a simple dataflow analysis would reveal that j is equal to i. 2. 4 Type inference Concrete type inference or constraint based analysis [PS91][APS93][PC94a] unlike type feedback, does not rely on executing the program. Given the program source, this global analysis statically computes a type for every expression in the program. The types, as in type feedback, are sets of classes, but unlike the types obtained by running an instrumented ....

Ole Agesen, Jens Palsberg, and Michael I. Schwartzbach. Type Inference of SELF: Analysis of Objects with Dynamic and Multiple Inheritance. In ECOOP'93, Seventh European Conference on Object-Oriented Programming, p. 247-267, Kaiserslautern, Germany, July 1993. Springer-Verlag LNCS 707.

No context found.

Ole Agesen, Jens Palsberg, and Michael I. Schwartzbach. Type inference of SELF: Analysis of objects with dynamic and multiple inheritance. Softw., Pract. Exper., 25(9):975--995, 1995.

No context found.

Ole Agesen, Jens Palsberg, and Michael I. Schwartzbach. Type Inference of Self: Analysis of Objects with Dynamic and Multiple Inheritance. In O. Nierstrasz, editor, Proceedings ECOOP '93, LNCS 707, pages 247--267, Kaiserslautern, Germany, July 1993. Springer-Verlag.

No context found.

Agesen, O., Palsberg, J., Schwartzbach, M.I.: Type inference of SELF: Analysis of objects with dynamic and multiple inheritance. In Nierstrasz, O., ed.: Proceedings of ECOOP'93. LNCS(707), Kaiserslautern, Germany, Springer-Verlag (1993) 247-- 267

No context found.

O. Agesen, J. Palsberg, and M. Schwartzbach. Type inference of SELF: analysis of objects with dynamic and multiple inheritance. Software---Practice and Experience, 25(9):975--995, Sept. 1995.

No context found.

O. Agesen, J. Palsberg, and M. I. Schwartzbach. Type Inference SELF: Analysis of Objects with Dynamic and Multiple Inheritance. In O. Nierstrasz, editor, European Conference on Object-Oriented Programming, LNCS 707, pages 247-- 267, Kaiserslautern, Germany, July 1993. Springer.

First 50 documents

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