检索结果-内蒙古大学图书馆

First acm/USENIX International conference on Virual Execution Environments, VEE 05

作者： Haupt, Michael Mezini, Mira Bockisch, Christoph Dinkelaker, Tom Eichberg, Michael Krebs, Michael Software Technology Group Darmstadt University of Technology Germany

ISBN: (纸本)1595930477

language mechanisms deserve language implementation effort. While this maxim has led to sophisticated support for language features specific to object-oriented, functional and logic programming languages, aspect-oriented programming languages are still mostly implemented using postprocessors. The Steamloom virtual machine, based on IBM's Jikes RVM, provides support for aspect-oriented programming at virtual machine level. A bytecode framework called BAT was integrated with the Jikes RVM to replace its bytecode management logic. While preserving the functionality needed by the VM, BAT also allows for querying application code for join point shadows, avoiding redundancy in bytecode representation. Performance measurements show that an AOP-enabled virtual machine like Steamloom does not inflict unnecessary performance penalties on a running application;when it comes to executing AOP-related operations, there even are significant performance gains compared to other approaches. Copyright 2005 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

ITERATIVE TYPE ANALYSIS AND EXTENDED MESSAGE SPLITTING - OPTIMIZING DYNAMICALLY-TYPED OBJECT-ORIENTED PROGRAMS 90

ITERATIVE TYPE ANALYSIS AND EXTENDED MESSAGE SPLITTING - OPT...

引用

1990 CONF OF THE SPECIAL INTEREST GROUP ON programming languageS OF THE ASSOC FOR COMPUTING MACHINERY : programming language design AND implementation

作者： CHAMBERS, C UNGAR, D STANFORD UNIV COMP SYST LABSTANFORDCA 94305

ISBN: (纸本)9780897913645

Object-oriented languages have suffered from poor performance caused by frequent and slow dynamically-bound procedure calls. The best way to speed up a procedure call is to compile it out, but dynamic binding of object-oriented procedure calls without static receiver type information precludes inlining. Iterative type analysis and extended message splitting are new compilation techniques that extract much of the necessary type information and make it possible to hoist run-time type tests out of *** system compiles code on-the-fly that is customized to the actual data types used by a running program. The compiler constructs a control flow graph annotated with type information by simultaneously performing type analysis and inlining. Extended message splitting preserves type information that would otherwise be lost by a control-flow merge by duplicating all the code between the merge and the place that uses the information. Iterative type analysis computes the types of variables used in a loop by repeatedly recompiling the loop until the computed types reach a fix-point. Together these two techniques enable our SELF compiler to split off a copy of an entire loop, optimized for the common-case *** the time our SELF compiler generates code for the graph, it has eliminated many dynamically-dispatched procedure calls and type tests. The resulting machine code is twice as fast as that generated by the previous SELF compiler, four times faster than ParcPlace Systems Smalltalk-80,* the fastest commercially available dynamically-typed object-oriented language implementation, and nearly half the speed of optimized C. Iterative type analysis and extended message splitting have cut the performance penalty for dynamically-typed object-oriented languages in half.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A laboratory for teaching object-oriented language and design concepts with teachlets

A laboratory for teaching object-oriented language and desig...

引用

OOPSLA'05 - 20th Annual acm conference on Object-Oriented programming, Systems, languages, and Applications

作者： Schmolitzky, Axel University of Hamburg Vogt-Koelln-Str. 30 HamburgD-22527 Germany

Teachlets are a new method originally developed to teach design patterns. Based on executable code, a problem is set that is to be solved collaboratively and interactively by all the participants of a teaching unit. A moderator is on hand to operate the computer, the development environment and video projector when called upon to do so. While deployable in themselves as an innovative teaching method, teachlets can also be used as a design object in seminar-like workshop events. In the course on advanced concepts of object-oriented programming described here, the participants themselves developed and used teachlets in a so-called teachlet laboratory. © 2005 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Avoiding unconditional jumps by code replication

Avoiding unconditional jumps by code replication

引用

acm sigplan '92 conference on programming language design and implementation, pldi 1992

作者： Mueller, Frank Whalley, David B. Florida State Univ Tallahassee FL United States

ISBN: (纸本)0897914759

This study evaluates a global optimization technique that avoids unconditional jumps by replicating code. When implemented in the back-end of an optimizing compiler, this technique can be generalized to work on almost all instances of unconditional jumps, including those generated from conditional statements and unstructured loops. The replication method is based on the idea of finding a replacement for each unconditional jump which minimizes the growth in code size. This is achieved by choosing the shortest sequence of instructions as a replacement. Measurements taken from a variety of programs showed that not only the number of executed instructions decreased, but also that the total cache work was reduced (except for small caches) despite increases in code size. Pipelined and superscalar machines may also benefit from an increase in the average basic block size.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

What is a recursive module?

Proceedings of the ACM SIGPLAN Conference on Programming Lan...

引用

Proceedings of the acm sigplan conference on programming language design and implementation (pldi) 1999年 50-63页

作者： Crary, Karl Harper, Robert Puri, Sidd Carnegie Mellon Univ Pittsburgh PA United States

A hierarchical module system is an effective tool for structuring large programs. Strictly hierarchical module systems impose an acyclic ordering on import dependencies among program units. This can impede modular programming by forcing mutually-dependent components to be consolidated into a single module. Recently there have been several proposals for module systems that admit cyclic dependencies, but it is not clear how these proposals relate to one another, nor how one might integrate them into an expressive module system such as that of ML. To address this question we provide a type-theoretic analysis of the notion of a recursive module in the context of a `phase-distinction' formalism for higher-order module systems. We extend this calculus with a recursive module mechanism and a new form of signature, called a recursively dependent signature, to support the definition of recursive modules. These extensions are justified by an interpretation in terms of more primitive language constructs. This interpretation may also serve as a guide for implementation.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

language constructs for improving reusability in object-oriented software

Language constructs for improving reusability in object-orie...

引用

OOPSLA'05 - 20th Annual acm conference on Object-Oriented programming, Systems, languages, and Applications

作者： Van Dooren, Marko Steegmans, Eric University of Leuven Leuven Belgium

The objective of this research project is to improve the reusability of object-oriented software. We have introduced anchored exception declarations to allow checked exceptions to be used conveniently in reusable software elements such as design patterns. We are now investigating an innovative inheritance mechanism based on existing inheritance mechanisms like that of Eiffel and on traits. The resulting mechanism should allow a programmer to construct a class from existing components with little effort. © 2005 acm.

关键词： Reusability

来源：评论

学校读者我要写书评

暂无评论

Classbox/J: Controlling the scope of change in Java

Classbox/J: Controlling the scope of change in Java

引用

20th conference on Object-Oriented programming, Systems, languages and Applications

作者： Bergel, A Ducasse, S Nierstrasz, O Univ Bern Software Composit Grp Bern Switzerland Univ Savoie Language & Software Evolut Grp LISTIC Chambery France

Unanticipated changes to complex software systems can introduce anomalies such as duplicated code, suboptimal inheritance relationships and a proliferation of run-tirne downcasts. Refactoring to eliminate these anomalies may not be an option, at least in certain stages of software evolution. Classboxes are modules that restrict the visibility of changes to selected clients only, thereby offering more freedom in the way unanticipated changes may be implemented, and thus reducing the need for convoluted design anomalies. In this paper we demonstrate how classboxes can be implemented in statically-typed languages like Java. We also present an extended case study of Swing, a Java GUI package built on top of AWT, and we document the ensuing anomalies that Swing introduces. We show how Classbox/J, a prototype implementation of classboxes for Java, is used to provide a cleaner implementation of Swing using local refinement rather than subclassing.

关键词： language design module package open-classes class extension

来源：评论

学校读者我要写书评

暂无评论

Practical data breakpoints: design and implementation

Practical data breakpoints: Design and implementation

引用

acm sigplan '93 conference on programming language design and implementation, pldi 1993

作者： Wahbe, Robert Lucco, Steven Graham, Susan L. Univ of California at Berkeley Berkeley CA United States

ISBN: (纸本)0897915984

A data breakpoint associates debugging actions with programmer-specified conditions on the memory state of an executing program. Data breakpoints provide a means for discovering program bugs that are tedious or impossible to isolate using control breakpoints alone. In practice, programmers rarely use data breakpoints, because they are either unimplemented or prohibitively slow in available debugging software. In this paper, we present the design and implementation of a practical data breakpoint facility. A data breakpoint facility must monitor all memory updates performed by the program being debugged. We implemented and evaluated two complementary techniques for reducing the overhead of monitoring memory updates. First, we checked write instructions by inserting checking code directly into the program being debugged. The checks use a segmented bitmap data structure that minimizes address lookup complexity. Second, we developed data flow algorithms that eliminate checks on some classes of write instructions but may increase the complexity of the remaining checks. We evaluated these techniques on the SPARC using the SPEC benchmarks. Checking each write instruction using a segmented bitmap achieved an average overhead of 42%. This overhead is independent of the number of breakpoints in use. Data flow analysis eliminated an average of 79% of the dynamic write checks. For scientific programs such the NAS kernels, analysis reduced write checks by a factor of ten or more. On the SPARC these optimizations reduced the average overhead to 25%.

关键词： Program debugging

来源：评论

学校读者我要写书评

暂无评论

Pointer analysis for multithreaded programs

Proceedings of the ACM SIGPLAN Conference on Programming Lan...

引用

Proceedings of the acm sigplan conference on programming language design and implementation (pldi) 1999年 77-90页

作者： Rugina, Radu Rinard, Martin Massachusetts Inst of Technology Cambridge MA United States

This paper presents a novel interprocedural, flow-sensitive, and context-sensitive pointer analysis algorithm for multi-threaded programs that may concurrently update shared pointers. For each pointer and each program point, the algorithm computes a conservative approximation of the memory locations to which that pointer may point. The algorithm correctly handles a full range of constructs in multi-threaded programs, including recursive functions, function pointers, structures, arrays, nested structures and arrays, pointer arithmetic, casts between pointer variables of different types, heap and stack allocated memory, shared global variables, and thread-private global variables. We have implemented the algorithm in the SUIF compiler system and used the implementation to analyze a sizable set of multithreaded programs written in the Cilk multi-threaded programming language. Our experimental results show that the analysis has good precision and converges quickly for our set of Cilk programs.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

design of a class mechanism for MOBY

Proceedings of the ACM SIGPLAN Conference on Programming Lan...

引用

Proceedings of the acm sigplan conference on programming language design and implementation (pldi) 1999年 37-49页

作者： Fisher, Kathleen Reppy, John AT&T Lab United States

Typical class-based languages, such as C++ and JAVA, provide complex class mechanisms but only weak module systems. In fact, classes in these languages incorporate many of the features found in richer module mechanisms. In this paper, we describe an alternative approach to designing a language that has both classes and modules. In our design, we rely on a rich ML-style module system to provide features such as visibility control and parameterization, while providing a minimal class mechanism that includes only those features needed to support inheritance. Programmers can then use the combination of modules and classes to implement the full range of class-based features and idioms. Our approach has the advantage that it provides a full-featured module system (useful in its own right), while keeping the class mechanism quite simple. We have incorporated this design in MOBY, which is an ML-style language that supports class-based object-oriented programming. In this paper, we describe our design via a series of simple examples, show how various class-based features and idioms are realized in MOBY, compare our design with others, and sketch its formal semantics.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：