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

acm sigplan NOTICES 2007年第10期42卷 441-460页

作者： Cameron, Nicholas R. Drossopoulou, Sophia Noble, James Smith, Matthew J. Victoria Univ Wellington Sch Math Stat & Comp Sci Wellington New Zealand Univ London Imperial Coll Sci & Technol Dept Comp London England

Existing ownership type systems require objects to have precisely one primary owner, organizing the heap into an ownership tree. Unfortunately, a tree structure is too restrictive for many programs, and prevents many common design patterns where multiple objects interact. Multiple Ownership is an ownership type system where objects can have more than one owner, and the resulting ownership structure forms a DAG. We give a straightforward model for multiple ownership, focusing in particular on how multiple ownership can support a powerful effects system that determines when two computations interfere - in spite of the DAG structure. We present a core programming language MOJO, Multiple Ownership for Java-like objects, including a type and effects system, and soundness proof. In comparison to other systems, MOJO imposes absolutely no restrictions on pointers, modi. cations or programs' structure, but in spite of this, MOJO's effects can be used to reason about or describe programs' behaviour.

关键词： languages Theory

来源：评论

学校读者我要写书评

暂无评论

Dependent classes

引用

acm sigplan NOTICES 2007年第10期42卷 133-151页

作者： Gasiunas, Vaidas Mezini, Mira Ostermann, Klaus Tech Univ Darmstadt Darmstadt Germany

Virtual classes allow nested classes to be refined in subclasses. In this way nested classes can be seen as dependent abstractions of the objects of the enclosing classes. Expressing dependency via nesting, however, has two limitations: Abstractions that depend on more than one object cannot be modeled and a class must know all classes that depend on its objects. This paper presents dependent classes, a generalization of virtual classes that expresses similar semantics by parameterization rather than by nesting. This increases expressivity of class variations as well as the flexibility of their modularization. Besides, dependent classes complement multimethods in scenarios where multi-dispatched abstractions rather than multi-dispatched methods are needed. They can also be used to express more precise signatures of multimethods and even extend their dispatch semantics. We present a formal semantics of dependent classes and a machine-checked type soundness proof in Isabelle/HOL [29], the first of this kind for a language with virtual classes and path-dependent types.

关键词： languages theory dependent classes virtual classes dynamic dispatch multiple dispatch multimethods variability

来源：评论

学校读者我要写书评

暂无评论

Making trace monitors feasible

引用

acm sigplan NOTICES 2007年第10期42卷 589-607页

作者： Avgustinov, Pavel Tibble, Julian de Moor, Oege Univ Oxford Programming Tools Grp Oxford OX1 2JD England

A trace monitor observes an execution trace at runtime;when it recognises a specified sequence of events, the monitor runs extra code. In the aspect-oriented programming community, the idea originated as a generalisation of the advice-trigger mechanism: instead of matching on single events (joinpoints), one matches on a sequence of events. The runtime verification community has been investigating similar mechanisms for a number of years, specifying the event patterns in terms of temporal logic, and applying the monitors to hardware and software. In recent years trace monitors have been adapted for use with mainstream object-oriented languages. In this setting, a crucial feature is to allow the programmer to quantify over groups of related objects when expressing the sequence of events to match. While many language proposals exist for allowing such features, until now no implementation had scalable performance: execution on all but very simple examples was infeasible. This paper rectifies that situation, by identifying two optimisations for generating feasible trace monitors from declarative specifications of the relevant event pattern. We restrict ourselves to optimisations that do not have a significant impact on compile-time: they only analyse the event pattern, and not the monitored code itself. The first optimisation is an important improvement over an earlier proposal in [2] to avoid space leaks. The second optimisation is a form of indexing for partial matches. Such indexing needs to be very carefully designed to avoid introducing new space leaks, and the resulting data structure is highly non-trivial.

关键词： program monitors runtime verification program analysis

来源：评论

学校读者我要写书评

暂无评论

The JastAdd Extensible Java Compiler

引用

acm sigplan NOTICES 2007年第10期42卷 1-17页

作者： Ekman, Torbjorn Hedin, Gorel Univ Oxford Programming Tools Grp Oxford England Lund Univ Dept Comp Sci S-22100 Lund Sweden

The JastAdd Extensible Java Compiler is a high quality Java compiler that is easy to extend in order to build static analysis tools for Java, and to extend Java with new language constructs. It is built modularly, with a Java 1.4 compiler that is extended to a Java 5 compiler. Example applications that are built as extensions include an alternative backend that generates Jimple, an extension of Java with AspectJ constructs, and the implementation of a pluggable type system for non-null checking and inference. The system is implemented using JastAdd, a declarative Java-like language. We describe the compiler architecture, the major design ideas for building and extending the compiler, in particular, for dealing with complex extensions that affect name and type analysis. Our extensible compiler compares very favorably concerning quality, speed and size with other extensible Java compiler frameworks. It also compares favorably in quality and size compared with traditional non-extensible Java compilers, and it runs within a factor of three compared to javac.

关键词： design languages OOP compilers extensibility declarative frameworks modularity Java

来源：评论

学校读者我要写书评

暂无评论

Join point patterns: A high-level join point selection mechanism

Join point patterns: A high-level join point selection mecha...

引用

9th international conference on Model Driven Engineering languages and systems

作者： Cazzola, Walter Pini, Sonia Univ Milan Dept Informat & Commun I-20122 Milan Italy Univ Genoa Dept Informat & Comp Sci Genoa Italy

ISBN: (纸本)9783540694885

Aspect-oriented programming is a powerful technique to better modularize object-oriented programs by introducing crosscutting concerns in a safe and noninvasive way. Unfortunately, most of the current join point models are too coupled with the application code. This fact hinders the concerns separability and reusability since each aspect is strictly tailored on the base application. This work proposes a possible solution to this problem based on modeling the join points selection mechanism at a higher level of abstraction. In our view, the aspect designer does not need to know the inner details of the application such as a specific implementation or the used name conventions rather he exclusively needs to know the application behavior to apply his/her aspects. In the paper, we present a novel join point model with a join point selection mechanism based on a high-level program representation. This high-level view of the application decouples the aspects definition from the base program structure and syntax. The separation between aspects and base program will render the aspects more reusable and independent of the manipulated application.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Library composition and adaptation using c++ concepts 07

Library composition and adaptation using c++ concepts

引用

GPCE'07 - 6th international conference on Generative programming and Component Engineering

作者： Järvi, Jaakko Marcus, Matthew A. Smith, Jacob N. Texas A and M University College Station TX United States Adobe Systems Inc. Seattle WA United States

ISBN: (纸本)9781595938558

Large scale software is composed of libraries produced by different entities. Non-intrusive and efficient mechanisms for adapting data structures from one library to conform to APIs of another are essential for the success of large software projects. Concepts and concept maps, planned features for the next version of C++, have been designed to support adaptation, promising generic, non-intrusive, efficient, and identity preserving adapters. This paper analyses the use of concept maps for library composition and adaptation, comparing and contrasting concept maps to other common adaptation mechanisms. We report on two cases of data structure adaptation between different libraries, indicating best practices and idioms along the way. First, we adapt GUI controls from several frameworks for use with a generic layout engine, extending the application of concepts to run-time polymorphism. Second, we develop a transparent adaptation layer between an image processing library and a graph algorithm library, enabling the efficient application of graph algorithms to the image processing domain. Copyright © 2007 acm.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Jeannie: Granting Java native interface developers their wishes

引用

acm sigplan NOTICES 2007年第10期42卷 19-38页

作者： Hirzel, Martin Grimm, Robert IBM Corp Thomas J Watson Res Ctr Yorktown Hts NY 10598 USA NYU New York NY USA

Higher-level languages interface with lower-level languages such as C to access platform functionality, reuse legacy libraries, or improve performance. This raises the issue of how to best integrate different languages while also reconciling productivity, safety, portability, and efficiency. This paper presents Jeannie, a new language design for integrating Java with C. In Jeannie, both Java and C code are nested within each other in the same file and compile down to JNI, the Java platform's standard foreign function interface. By combining the two languages' syntax and semantics, Jeannie eliminates verbose boiler-plate code, enables static error detection across the language boundary, and simplifies dynamic resource management. We describe the Jeannie language and its compiler, while also highlighting lessons from composing two mature programming languages.

关键词： design languages programming language composition Java C JNI foreign function interface xtc modular syntax Rats

来源：评论

学校读者我要写书评

暂无评论

Notation and representation in collaborative object-oriented design: An observational study

引用

acm sigplan NOTICES 2007年第10期42卷 261-280页

作者： Dekel, Uri Herbsleb, James D. Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA

Software designers in the object-oriented paradigm can make use of modeling tools and standard notations such as UML. Nevertheless, casual observations from collocated design collaborations suggest that teams tend to use physical mediums to sketch a plethora of informal diagrams in varied representations that often diverge from UML. To better understand such collaborations and support them with tools, we need to understand the origins, roles, uses, and implications of these alternate representations. To this end we conducted observational studies of collaborative design exercises, in which we focused on representation use. Our primary finding is that teams intentionally improvise representations and organize design information in response to ad-hoc needs, which arise from the evolution of the design, and which are difficult to meet with fixed standard notations. This behavior incurs orientation and grounding difficulties for which teams compensate by relying on memory, other communication mediums, and contextual cues. Without this additional information the artifacts are difficult to interpret and have limited documentation potential. Collaborative design tools and processes should therefore focus on preserving contextual information while permitting unconstrained mixing and improvising of notations.

关键词： design documentation human factors representation notation modeling collaborative software design UML OOD

来源：评论

学校读者我要写书评

暂无评论

Modular typestate checking of aliased objects

引用

acm sigplan NOTICES 2007年第10期42卷 301-319页

作者： Bierhoff, Kevin Aldrich, Jonathan Carnegie Mellon Univ Sch Comp Sci Inst Software Res Pittsburgh PA 15213 USA

objects often define usage protocols that clients must follow in order for these objects to work properly. Aliasing makes it notoriously difficult to check whether clients and implementations are compliant with such protocols. Accordingly, existing approaches either operate globally or severely restrict aliasing. We have developed a sound modular protocol checking approach, based on typestates, that allows a great deal of flexibility in aliasing while guaranteeing the absence of protocol violations at runtime. The main technical contribution is a novel abstraction, access permissions, that combines typestate and object aliasing information. In our methodology, developers express their protocol design intent through annotations based on access permissions. Our checking approach then tracks permissions through method implementations. For each object reference the checker keeps track of the degree of possible aliasing and is appropriately conservative in reasoning about that reference. This helps developers account for object manipulations that may occur through aliases. The checking approach handles inheritance in a novel way, giving subclasses more flexibility in method overriding. Case studies on Java iterators and streams provide evidence that access permissions can model realistic protocols, and protocol checking based on access permissions can be used to reason precisely about the protocols that arise in practice.

关键词： languages verification typestates aliasing permissions linear logic behavioral subtyping

来源：评论

学校读者我要写书评

暂无评论

User-changeable visibility: Resolving unanticipated name clashes in traits

引用

acm sigplan NOTICES 2007年第10期42卷 171-190页

作者： Ducasse, Stephane Wuyts, Roel Bergel, Alexandre INRIA Futurs LISTIC Univ Savoie Language & Software evolut Le Bourget Du Lac France IMEC Louvain Belgium Univ Libre Bruxelles Brussels Belgium LERO Trinity Coll Dublin Ireland

A trait is a unit of behaviour that can be composed with other traits and used by classes. Traits offer an alternative to multiple inheritance. Conflict resolution of traits, while flexible, does not completely handle accidental method name conflicts: if a trait with method m is composed with another trait defining a different method m then resolving the conflict may prove delicate or infeasible in cases where both versions of m are still needed. In this paper we present freezeable traits, which provide an expressive composition mechanism to support unanticipated method composition conflicts. Our solution introduces private trait methods and lets the class composer change method visibility at composition time (from public to private and vice versa). Moreover two class composers may use different composition policies for the same trait, something which is not possible in mainstream languages. This approach respects the two main design principles of traits: the class composer is empowered and traits can be flattened away. We present an implementation of freezable traits in Smalltalk. As a side-effect of this implementation we introduced private (early-bound and invisible) methods to Smalltalk by distinguishing object-sends from self-sends. Our implementation uses compile-time bytecode manipulation and, as such, introduces no run-time penalties.

关键词： languages dynamic typing traits encapsulation information hiding composition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：