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

oopsla'05 - 20th Annual ACM conference on object-oriented programming, systems, languages, and applications

作者： Allan, Chris Avgustinov, Pavel Christensen, Aske Simon Hendren, Laurie Kuzins, Sascha Lhoták, Ondřej De Moor, Oege Sereni, Damien Sittampalam, Ganesh Tibble, Julian Programming Tools Group University of Oxford United Kingdom BRICS University of Aarhus Denmark Sable Research Group McGill University Montreal Canada

An aspect observes the execution of a base program;when certain actions occur, the aspect runs some extra code of its own. In the AspectJ language, the observations that an aspect can make are confined to the current action: it is not possible to directly observe the history of a computation. Recently, there have been several interesting proposals for new history-based language features, most notably by Douence et al. and by Walker and Viggers. In this paper, we present a new history-based language feature called tracematches that enables the programmer to trigger the execution of extra code by specifying a regular pattern of events in a computation trace, We have fully designed and implemented tracematches as a seamless extension of AspectJ. A key innovation in our tracematch approach is the introduction of free variables in the matching patterns. This enhancement enables a whole new class of applications in which events can be matched not only by the event kind, but also by the values associated with the free variables, We provide several examples of applications enabled by this feature. After introducing and motivating the idea of tracematches via examples, we present a detailed semantics of our language design, and we derive an implementation from that semantics. The implementation has been realised as an extension of the abc compiler for AspectJ. Copyright 2005 ACM.

关键词： Formal languages

来源：评论

学校读者我要写书评

暂无评论

"Honey, I Shrunk the Types": How Behavioral Types loose relevance on the edges on 00 applications and why a core Data fabric is useful for adaptability

"Honey, I Shrunk the Types": How Behavioral Types loose rele...

引用

oopsla'05 - 20th Annual ACM conference on object-oriented programming, systems, languages, and applications

作者： Kuriakose, John Set Labs Infosys Technologies Pune India

OO Programs are built by first defining User Types within the language environment and then realizing program requirements by using the behavior defined by these *** argue against defining types to deal with every *** Programs within an enterprise have to deal with the non-OO world that includes RDBMS, other applications, and humans etc. On these EDGES that OO programs interact with the non-OO world we have observed that there is little respect for Types and behavior while the requirement and expectation is most often data. If this is true, then OO application developers will repeatedly have to extract data to and from objects defined by Types to support the pure data interface that the non OO world *** this paper we attempt to highlight some benefits we have realized by equipping an OO Application (Banking Middleware in Java) with a core representation for data which we refer to as the 'data fabric'. We further show that seemingly unrelated problems in database persistence, data-binding, message data transformation and metadata management that appear within an Enterprise context can now be addressed well within the data fabric. The Data fabric is itself realized using reflective uniform data API defined using a few key data *** then reopens the case for OO developers to enhance their effectiveness with generic Data Models and principles of Data Driven programming. © 2005 ACM.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

DOSC: Dispersed Operating System Computing

DOSC: Dispersed Operating System Computing

引用

oopsla'05 - 20th Annual ACM conference on object-oriented programming, systems, languages, and applications

作者： Karne, Ramesh K. Jaganathan, Karthick V. Rosa, Nelson Ahmed, Tufail Towson University United States Dartmouth College United States

Over the past decade the sheer size and complexity of traditional operating systems have prompted a wave of new approaches to help alleviate the services provided by these operating systems. The emergence of micro-kernels and a plethora of non-traditional operating system models, both geared toward reducing the role of the OS, attest to the promise of practical alternatives. The problem with these methods is that the three-tiered system of software, operating system, and hardware is still preserved. Even though the operating system might find some reprieve by having to handle less work there is a nascent notion being triggered by these alternative approaches that the operating system as an abstract entity is no longer a necessity. We propose a radical method of computing where we take this notion to the extreme and push the operating system into the software and hardware levels. By doing so, we create a decentralized operating system environment known as Dispersed Operating System Computing (DOSC). We outline how the Dispersed Operating System paradigm works, its benefits, and immediate practical applications in today's world. © 2005 ACM.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Safe futures for Java

Safe futures for Java

引用

20th conference on object-oriented programming, systems, languages and applications

作者： Welc, A Jagannathan, S Hosking, A Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

A future is a simple and elegant abstraction that allows concurrency to be expressed often through a relatively small rewrite of a sequential program. In the absence of side-effects, futures serve as benign annotations that mark potentially concurrent regions of code. Un-fortunately, when computation relies heavily on mutation as is the case in Java, its meaning is less clear, and much of its intended simplicity lost. This paper explores the definition and implementation of safe futures for Java. One can think of safe futures as truly transparent annotations on method calls, which designate opportunities for concurrency. Serial programs can be made concurrent simply by replacing standard method calls with future invocations. Most significantly, even though some parts of the program are executed concurrently and may indeed operate on shared data, the semblance of serial execution is nonetheless preserved. Thus, program reasoning is simplified since data dependencies present in a sequential program are not violated in a version augmented with safe futures. Besides presenting a programming model and API for safe futures, we formalize the safety conditions that must be satisfied to ensure equivalence between a sequential Java program and its future-annotated counterpart. A detailed implementation study is also provided. Our implementation exploits techniques such as object versioning and task revocation to guarantee necessary safety conditions. We also present an extensive experimental evaluation of our implementation to quantify overheads and limitations. Our experiments indicate that for programs with modest mutation rates on shared data, applications can use futures to profitably exploit parallelism, without sacrificing safety.

关键词： experimentation languages measurement performance Java concurrency futures safety

来源：评论

学校读者我要写书评

暂无评论

Deriving object typestates in the presence of inter-object references 05

Deriving object typestates in the presence of inter-object r...

引用

oopsla'05 - 20th Annual ACM conference on object-oriented programming, systems, languages, and applications

作者： Nanda, Mangala Gowri Grothoff, Christian Chandra, Satish IBM India Research Laboratory India University of California Los Angeles United States

ISBN: (纸本)1595930310

We are interested in static analysis of Java classes with the goal of discovering the preconditions under which a certain program point within a method may be reached, taking into account the effects of previous method calls on an object of that class. The information pertinent to this computation is represented as the object's typestate, which is a finite set of relevant predicates that abstract the object's actual state. The execution of a method depends on an object's current typestate as well as other input parameters;the object may transition to a different typestate during the method's execution. It is common for objects to contain references to other objects. In such cases, an object's behavior may depend on, in addition to its own state, the state of objects it has a reference to. The main contribution of this paper is to discover relevant object typestates, as well as transitions between typestates, in the presence of inter-object references. Our analysis first performs a combined predicate discovery and predicate abstraction to derive "boolean" versions of Java classes given as input. It then uses abstract interpretation to compute the typestate transitions caused by method calls. A novel aspect of this work is that a set of Java classes is analyzed in isolation, without any client program being provided. To do this, the analysis simulates all possible client's actions via a synthetic heap, all of whose interesting configurations are explored by our analysis. The information we compute can be put to use in several ways. It can be used in checking whether a given client code erroneously uses a set of Java classes in a way that can throw an exception. It can also be used in creating test drivers for Java classes in order to exercise all relevant code paths in the corresponding methods. Copyright 2005 ACM.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

abc: The aspectBench compiler for aspectJ: A workbench for aspect-oriented programming language and compilers research

abc: The aspectBench compiler for aspectJ: A workbench for a...

引用

oopsla'05 - 20th Annual ACM conference on object-oriented programming, systems, languages, and applications

作者： Allan, Chris Avgustinov, Pavel Christensen, Aske Simon Dufour, Bruno Goard, Christopher Hendren, Laurie Kuzins, Sascha Lhoták, Jennifer Lhoták, Ondrej De Moor, Oege Sereni, Damien Sittampalam, Ganesh Tibble, Julian Verbrugge, Clark Programming Tools Group Oxford University United Kingdom Brics University of Aarhus Denmark Sable Research Group McGill University Montreal Canada

Aspect-oriented programming (AOP) is gaining popularity as a new way of modularising cross-cutting concerns. The aspectbench compiler (abc) is a new workbench for AOP research which provides an extensible research framework for both new language features and new compiler optimisations. This poster presents the abc architecture, as well as example uses. © 2005 ACM.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

Demand-driven points-to analysis for Java

Demand-driven points-to analysis for Java

引用

oopsla'05 - 20th Annual ACM conference on object-oriented programming, systems, languages, and applications

作者： Sridharan, Manu Shan, Lexin Gopan, Denis Bodík, Rastislav University of California Berkeley University of Wisconsin Madison

We present a points-to analysis technique suitable for environments with small time and memory budgets, such as just-in-time (JIT) compilers and interactive development environments (IDEs). Our technique is demand-driven, performing only the work necessary to answer each query (a request for a variable's points-to information) issued by a client. In cases where even the demand-driven approach exceeds the time budget for a query, we employ early termination, i.e., stopping the analysis prematurely and returning an over-approximated result to the client. Our technique improves on previous demand-driven points-to analysis algorithms [17, 33] by achieving much higher precision under small time budgets and early termination. We formulate Andersen's analysis [5] for Java as a CFL-reachability problem [33]. This formulation shows that Andersen's analysis for Java is a balanced-parentheses problem, an insight that enables our new techniques. We exploit the balanced parentheses structure to approximate Andersen's analysis by regularizing the CFL-reachability problem, yielding an asymptotically cheaper algorithm. We also show how to regain most of the precision lost in the regular approximation as needed through refinement. Our evaluation shows that our regularization and refinement approach achieves nearly the precision of field-sensitive Andersen's analysis in time budgets as small as 2ms per query. Our technique can yield speedups of up to 16x over computing an exhaustive Andersen's analysis for some clients, with little to no precision loss. Copyright 2005 ACM.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the conference on object-oriented programming systems, languages, and Application, oopsla: Foreword

Proceedings of the Conference on Object-Oriented Programming...

引用

Proceedings of the conference on object-oriented programming systems, languages, and applications, oopsla 2005年 iii页

作者： Johnson, Ralph Gabriel, Richard P. University of Illinois United States Sun Microsystems Laboratories

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

The survey and expansion on quantitative methods to conflict resolution

The survey and expansion on quantitative methods to conflict...

引用

International conference on Information Technology and applications, ICITA

作者： Chih-Yao Lo Chen-Feng Wu Department of Information Management Yu Da College of Business Taiwan

ISBN: (纸本)0769523161

Due to information exchange among the conflict participants, conflict resolution occurs. Either through direct negotiation between the agents or through a third party known as the 'mediator' by Sycara, (1987), Resmerita and Heymann, (2003), conflict resolution can be achieved. Improved robustness and balance in the integrated solution can be provided by using this communication process to resolve conflict. Therefore conflict resolution is a very important procedure required for the coordination of systems made up of intelligent, autonomous, interacting agents. Having learned the spirit of conflict resolution, this research tries to expand the ideas of some quantitative methods to conflict resolution and gives a brief assessment of each method in its theory.

关键词： Marketing and sales Educational institutions Robustness Intelligent agent object detection Database languages Data mining Linear programming Decision making Manufacturing

来源：评论

学校读者我要写书评

暂无评论

Companion of the 18th Annual ACM SIGPLAN conference on object-oriented programming, systems, languages, and applications, oopsla'03

Companion of the 18th Annual ACM SIGPLAN Conference on Objec...

引用

18th Annual ACM SIGPLAN conference on object-oriented programming, systems, languages, and applications, oopsla'03

ISBN: (纸本)1581137516

The proceedings contain 101 papers. The topics discussed include: model driven development - the case for domain oriented programming;an end-to-end domain-driven software development framework;XAspects: an extensible system for domain-specific aspect languages;the power of symmetry: unifying inheritance and generative programming;domain driven web development with WebJinn;automated impact analysis of object-oriented software systems;a demonstration of JPie: an environment for live software construction in Java;reuse learning objects through LOM and XML;QuickUML: a tool to support iterative design and code development;GME: the generic modeling environment;generative model transformer;semantic software engineering tools;a policy based system to incorporate self-managing behaviors in applications;using events to debug Java programs backwards in time;and issues on building T++, a tool for web application development with C++.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：