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

17th Meeting on object-oriented programming, systems, languages and applications (oopsla 2002)

作者： Soares, S Laureano, E Borba, P Univ Fed Pernambuco Informat Ctr Recife PE Brazil Catholic Univ Pernambuco Informat & Stat Dept Recife PE Brazil

This paper reports our experience using AspectJ, a general-purpose aspect-oriented extension to Java, to implement distribution and persistence aspects in a web-based information system. This system was originally implemented in Java and restructured with AspectJ. Our main contribution is to show that AspectJ is useful for implementing several persistence and distribution concerns in the application considered, and other similar applications. We have also identified a few drawbacks in the language and suggest some minor modifications that could significantly improve similar implementations. Despite the drawbacks, we argue that the AspectJ implementation is superior to the pure Java implementation. Some of the aspects implemented in our experiment are abstract and constitute a simple aspect framework. The other aspects are application specific but we suggest that different implementations might follow the same aspect pattern. The framework and the pattern allow us to propose architecture-specific guidelines that provide practical advice for both restructuring and implementing certain kinds of persistent and distributed applications with AspectJ.

关键词： languages standardization experimentation aspect-oriented programming separation of concerns AspectJ distributed programming object persistence

来源：评论

学校读者我要写书评

暂无评论

Alias annotations for program understanding

Alias annotations for program understanding

引用

17th Meeting on object-oriented programming, systems, languages and applications (oopsla 2002)

作者： Aldrich, J Kostadinov, V Chambers, C Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA

One of the primary challenges in building and evolving large object-oriented systems is understanding aliasing between objects. Unexpected aliasing can lead to broken invariants, mistaken assumptions, security holes, and surprising side effects, all of which may lead to software defects and complicate software evolution. This paper presents AliasJava, a capability-based alias annotation system for Java that makes alias patterns explicit in the source code, enabling developers to reason more effectively about the interactions in a complex system. We describe our implementation, prove the soundness of the annotation system, and give an algorithm for automatically inferring alias annotations. Our experience suggests that the annotation system is practical, that annotation inference is efficient and yields appropriate annotations, and that the annotations can express important invariants of data structures and of software architectures.

关键词： experimentation languages theory AliasJava Java ownership types encapsulation uniqueness aliasing type inference

来源：评论

学校读者我要写书评

暂无评论

Workflow enactment with continuation and future objects

Workflow enactment with continuation and future objects

引用

17th ACM conference on object-Orientated programming systems, languages, and applications

作者： Manolescu, Dragos A.

An increasing number of software developers are turning to workflow to separate the logic and the control aspects in their applications, thus making them more amenable to change. However, in spite of recent efforts lo standardize and provide reusable workflow components, many developers build their own. This is a challenging endeavor and involves solving problems which seem incompatible with the object paradigm and current object-oriented programming languages. In the context of an object-oriented workflow framework, this paper demonstrates a novel approach that resolves this impedance mismatch with techniques drawn from programming language theory. This successful cross-pollination narrows the gap between the results of decades of research in programming languages and developers working hard to cope with change.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Towards a formalization for COM part I: The primitive calculus 02

Towards a formalization for COM part I: The primitive calcul...

引用

17th Meeting on object-oriented programming, systems, languages and applications (oopsla 2002)

作者： Pucella, R Cornell Univ Dept Comp Sci Ithaca NY 14853 USA

ISBN: (纸本)9781581134711

We introduce in this paper a typed calculus intended to capture the execution model of COM. The innovation of this calculus is to model very low-level aspects of the COM framework, specifically the notion of interface pointers. This is handled by specifying an allocation semantics for the calculus, thereby modeling heap allocation of interfaces explicitly. Having an explicit way of talking about interface pointers allows us to model in a reasonable way the notions of interface sharing and object identity. We introduce a type system that can be used to disambiguate between specification and implementation of interfaces. The type system moreover can capture a notion of COM conformance, that is, the legality of COM components. We discuss extensions of the calculus to handle subtyping of interfaces, dynamic interface negotiation and aggregation.

关键词： design languages COM components interfaces calculus formalism type system

来源：评论

学校读者我要写书评

暂无评论

Lock reservation: Java locks can mostly do without atomic operations 02

Lock reservation: Java locks can mostly do without atomic op...

引用

17th Meeting on object-oriented programming, systems, languages and applications (oopsla 2002)

作者： Kawachiya, K Koseki, A Onodera, T IBM Res Corp Tokyo Res Lab Kanagawa 2428502 Japan

ISBN: (纸本)9781581134711

Because of the built-in support for multi-threaded programming, Java programs perform many lock operations. Although the overhead has been significantly reduced in the recent virtual machines, one or more atomic operations are required for acquiring and releasing an object's lock even in the fastest cases. This paper presents a novel algorithm called lock reservation. It exploits thread locality of Java locks, which claims that the locking sequence of a Java lock contains a very long repetition of a specific thread. The algorithm allows locks to be reserved for threads. When a thread attempts to acquire a lock, it can do without any atomic operation if the lock is reserved for the thread. Otherwise, it cancels the reservation and falls back to a conventional locking algorithm. We have evaluated an implementation of lock reservation in IBM's production virtual machine and compiler. The results show that it achieved performance improvements up to 53% in real Java programs.

关键词： languages algorithms performance measurement experimentation Java synchronization monitor lock reservation thread locality atomic operation

来源：评论

学校读者我要写书评

暂无评论

An analyzable annotation language

An analyzable annotation language

引用

17th Meeting on object-oriented programming, systems, languages and applications (oopsla 2002)

作者： Khurshid, S Marinov, D Jackson, D MIT Comp Sci Lab Cambridge MA 02139 USA

The Alloy Annotation Language (AAL) is a language (under development) for annotating Java code based on the Alloy modeling language. It offers a syntax similar to the Java Modeling Language (JML), and the same opportunities for generation of run-time assertions. In addition, however, AAL offers the possibility of fully automatic compile-time analysis. Several kinds of analysis are supported, including: checking the code of a method against its specification;checking that the specification of a method in a subclass is compatible with the specification in the superclass;and checking properties relating method calls on different objects, such as that the equals methods of a class (and its overridings) induce an equivalence. Using partial models in place of code, it is also possible to analyze object-oriented designs in the abstract: investigating, for example, a view relationship amongst objects. The paper gives examples of annotations and such analyses. It presents (informally) a systematic translation of annotations into Alloy, a simple first-order logic with relational operators. By doing so, it makes Alloy's automatic analysis, which is based on state-of-the-art SAT solvers, applicable to the analysis of object-oriented programs, and demonstrates the power of a simple logic as the basis for an annotation language.

关键词： verification languages specification language Java language alloy modeling language alloy analyzer compile-time analysis

来源：评论

学校读者我要写书评

暂无评论

GCspy: An adaptable heap visualisation framework 02

GCspy: An adaptable heap visualisation framework

引用

17th Meeting on object-oriented programming, systems, languages and applications (oopsla 2002)

作者： Printezis, T Jones, R Univ Glasgow Dept Comp Sci Glasgow G12 8RZ Lanark Scotland Univ Kent Comp Lab Canterbury CT2 7NF Kent England

ISBN: (纸本)9781581134711

GCspy is an architectural framework for the collection, transmission, storage and replay of memory management behaviour. It makes new contributions to the understanding of the dynamic memory behaviour of programming languages (and especially object-oriented languages that make heavy demands on the performance of memory managers). GCspy's architecture allows easy incorporation into any memory management system: it is not limited to garbage-collected languages. It requires only small changes to the system in which it is incorporated but provides a simple to use yet powerful data-gathering API. GCspy scales to allow very large heaps to be visualised effectively and efficiently. It allows already-running, local or remote systems to be visualised and those systems to run at full speed outside the points at which data is gathered. GCspy's visualisation tool presents this information in a number of novel ways. Deep understanding of program behaviour is essential to the design of the next generation of garbage collectors and explicit allocators. Until now, no satisfactory tools have been available to assist the implementer in gaining an understanding of heap behaviour. GCspy has been demonstrated to be a practical solution to this dilemma. It has been used to analyse production Java virtual machines running applications of realistic sizes. Its use has revealed important insights into the interaction between application program and JVM and has led to the development of better garbage collectors.

关键词： algorithms measurement performance languages human factors language implementation memory management garbage collection visualisation of objects Java

来源：评论

学校读者我要写书评

暂无评论

Language-specific make technology for the Java™ programming language

Language-specific make technology for the Java™ programming...

引用

17th Meeting on object-oriented programming, systems, languages and applications (oopsla 2002)

作者： Dmitriev, M Sun Microsyst Inc Mt View CA 94043 USA

Keeping the code of a Java(TM) application consistent (code is consistent if all of the project classes can be recompiled together without errors) prevents late linking errors, and thus may significantly improve development turnaround time. In this paper we describe a make technology for the Java programming language, that is based on smart dependency checking, guarantees consistency of the project code, and at the same time reduces the number of source code recompilations to the minimum. After project code consistency is initially assured by complete recompilation, the information extracted from the binary classes is stored in a so-called project database. Whenever the source code for some class C is changed, its recompiled binary is compared to the old version of C preserved in the project database. As a, result, we find a minimum subset of classes that depend on C and may be affected by the particular change made to it. These are recompiled in turn, and absence of compilation errors at this phase guarantees the consistency of the new project code. To determine which dependent classes to recompile, we categorize all source incompatible changes, and for each category establish a criterion for finding the smallest possible subset of dependent classes.

关键词： design languages Java dependency checking make development turnaround time

来源：评论

学校读者我要写书评

暂无评论

ARK: an object(ive) view of extensible minimal languages for system configuration

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2002年第4期44卷 259-268页

作者： Holgate, M Partain, W Univ Glasgow Dept Comp Sci Arusha Project Glasgow G12 8RZ Lanark Scotland

This paper presents ARK, a minimal, XML-based configuration language and framework for our particular problem domain: UNIX System Administration. The language allows the capture of poorly structured configuration data and code fragments written in various programming languages, while the ARK engine is responsible for interpreting the XML and allowing applications to query data and invoke code fragments. The paper discusses the need for a minimal, simple approach, and provides examples which illustrate the use of the prototype-based model supported by the language. The ARK framework is currently being used to manage several academic and industrial UNIX installations. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： XML configuration framework system administration prototype-based language

来源：评论

学校读者我要写书评

暂无评论

Institutions: integrating objects, XML and databases

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2002年第4期44卷 207-216页

作者： Alagic, S Univ So Maine Dept Comp Sci Portland ME 04104 USA

A general model theory based on institutions is proposed as a formal framework for investigating typed object-oriented, XML and other data models equipped with integrity constraints. A major challenge in developing such a unified model theory is in the requirement that it must be able to handle major structural differences between the targeted models as well as the significant differences in the logic bases of their associated constraint languages. A distinctive feature of this model theory is that it is transformation-oriented. It is based on structural transformations within a particular category of models or across different categories with a fundamental requirement that the associated constraints are managed in such a way that the database integrity is preserved. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： object-oriented XML data models institutions transformations integrity constraints

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：