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

The performance of an object-oriented threads package 90

The performance of an object-oriented threads package

1990 European conference on Object-Oriented programming on Object-Oriented programming Systems, languages, and Applications, OOPSLA/ECOOP 1990

作者： Faust, John E. Levy, Henry M. Department of Computer Science and Engineering University of Washington SeattleWA98195 United States

ISBN: (纸本)0897914112

Presto is an object-oriented threads package for writing parallel programs on a shared-memory multiprocessor. The system adds thread objects and synchronization objects to C++ to allow programmers to create and control parallelism. Presto's object-oriented structure, along with its user-level thread implementation, simplifies customization of thread management primitives to meet application-specific needs. The performance of thread primitives is crucial for parallel programs with fine-grained structure;therefore, the principal objective of this effort was to substantially improve Presto's performance under heavy loads without sacrificing the benefits of its object-oriented interface. We discuss design and implementation issues for shared-memory multiprocessors, and the performance impact of various designs is shown through measurements on a 20-processor Sequent Symmetry multiprocessor. © 1990 acm.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

A practical type system and language for reference immutability 04

A practical type system and language for reference immutabil...

引用

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

作者： Birka, Adrian Ernst, Michael D. MIT Comp. Sci./Artif. Intell. Lab. Cambridge MA 02139 United States

ISBN: (纸本)1581138318

This paper describes a type system that is capable of expressing and enforcing immutability constraints. The specific constraint expressed is that the abstract state of the object to which an immutable reference refers cannot be modified using that reference. The abstract state is (part of) the transitively reachable state: that is, the state of the object and all state reachable from it by following references. The type system permits explicitly excluding fields or objects from the abstract state of an object. For a statically type-safe language, the type system guarantees reference immutability. If the language is extended with immutability downcasts, then run-time checks enforce the reference immutability constraints. In order to better understand the usability and efficacy of the type system, we have implemented an extension to Java, called Javari, that includes all the features of our type system. Javari is interoperable with Java and existing JVMs. It can be viewed as a proposal for the semantics of the Java const keyword, though Javari's syntax uses readonly instead. This paper describes the design and implementation of Javari, including the type-checking rules for the language. This paper also discusses experience with 160,000 lines of Javari code. Javari was easy to use and provided a number of benefits, including detecting errors in well-tested code.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Modularizing Crosscutting Concerns with Ptolemy 11

Modularizing Crosscutting Concerns with Ptolemy

引用

10th International conference on Aspect-Oriented Software Development (AOSD)

作者： Rajan, Hridesh Leavens, Gary T. Dyer, Robert Bagherzadeh, Mehdi Iowa State Univ Ames IA 50011 USA Univ Cent Florida Orlando FL 32816 USA

ISBN: (纸本)9781450305563

This tutorial will provide an introduction to Ptolemy. Ptolemy is a programming language whose goals are to improve a software engineer's ability to separate conceptual concerns, while preserving encapsulation of object-oriented code and the ability of programmers to modularly reason about their code. In particular, Ptolemy's features are useful towards modularization of cross-cutting concerns. A cross-cutting concern is a requirement whose implementation is spread across and mixed with the code of other requirements. There has been attempts to improve separation of cross-cutting concerns, e.g. by aspect-oriented and implicit-invocation languages, but none give software developers textual separation of concerns and modular reasoning at the same time. Ptolemy has both these properties important for scalable software engineering. Ptolemy's event types provide a well-defined interface between object-oriented code and cross-cutting code. This in turn enables separate type-checking and compilation. Ptolemy also provides a novel and practical specification mechanism that we call translucid contracts. A translucid contracts allows developers to reason about the control effects of the object-oriented code and cross-cutting code modularly. This tutorial will proceed by discussing the goals of the Ptolemy programming language. We will then discuss Ptolemy's programming features and its specification features by way of several hands-on exercises. We will conclude with pointers to ongoing work on design, implementation and verification of Ptolemy programs.

关键词： modular reasoning aspect-oriented programming languages implicit invocation translucid contracts aspect-oriented interfaces Ptolemy

来源：评论

学校读者我要写书评

暂无评论

How to print floating-point numbers accurately

How to print floating-point numbers accurately

引用

Proceedings of the acm sigplan '90 conference on programming language design and implementation

作者： Steele Jr., Guy L. White, Jon L. Thinking Machines Corp Cambridge United States

ISBN: (纸本)0897913647

We present algorithms for accurately converting floating-point numbers to decimal representation. The key idea is to carry along with the computation an explicit representation of the required rounding accuracy. We begin with the simpler problem of converting fixed-point fractions. A modification of the well-known algorithm for radix-conversion of fixed-point fractions by multiplication explicitly determines when to terminate the conversion process;a variable number of digits are produced. We then derive two algorithms for free-format output of floating-point numbers. Finally, we modify the free-format conversion algorithm for use in fixed-format applications.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

The myth: Anyone Can code the software if the requirements and design are

The myth: Anyone Can code the software if the requirements a...

引用

1988 Annual International conference on Ada, TRI-Ada 1988

作者： Perkins, J.A. Dynamics Research Corporation Systems Division 60 Frontage Road AndoverMA01810 United States

ISBN: (纸本)0897912853

The focus of this paper is the conjecture that the coding phase of a software system is difficult even in those instances where the functional requirements are well-defined, the functional design is finalized, and the implementation issues are well-understood. To study this conjecture, we examined an actual implementation of a stack to discover what decisions the programmer encounters when attempting to transform the functional design into operational software code. We examine decisions affecting the specification of the stack package as well as those affecting the implementation of the subprograms in the body of this package.

关键词： Codes (symbols)

来源：评论

学校读者我要写书评

暂无评论

Finding Optimum Abstractions in Parametric Dataflow Analysis 13

Finding Optimum Abstractions in Parametric Dataflow Analysis

引用

acm sigplan conference on programming language design and implementation

作者： Xin Zhang Mayur Naik Hongseok Yang Georgia Institute of Technology University of Oxford

ISBN: (纸本)9781450320146

We propose a technique to efficiently search a large family of abstractions in order to prove a query using a parametric dataflow analysis. Our technique either finds the cheapest such abstraction or shows that none exists. It is based on counterexample-guided abstraction refinement but applies a novel meta-analysis on abstract counterexample traces to efficiently find abstractions that are incapable of proving the query. We formalize the technique in a generic framework and apply it to two analyses: a type-state analysis and a thread-escape analysis. We demonstrate the effectiveness of the technique on a suite of Java benchmark programs.

关键词： Dataflow analysis CEGAR Abstraction refinement Optimum abstraction Impossibility Under-approximation languages Verification data flow analysis language Probability Verification Abstraction Parametric

来源：评论

学校读者我要写书评

暂无评论

A SYSTEMATIC FRAMEWORK FOR THE DEPENDENCE CYCLE REMOVAL IN PRACTICAL LOOPS

引用

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING 1995年第2期27卷 157-171页

作者： KONDA, V KUMAR, A UNIV LOUISVILLE DEPT ENGN MATH & COMP SCILOUISVILLEKY 40292

Traditionally research in dependence testing considered the most general linear subscripted DO loops permitted by standard Fortran. However, the existing program transformations are discussed in isolation without developing a unified and formal theory for the most general loops. Consequently all the available parallelism in the serial programs is not exploited by the existing techniques;for example, the existing techniques can neither completely remove the output dependence cycles nor recognize all types of reduction loops. In this paper, based on the empirical studies of Goff et al. (Proc. acm sigplan '91 conference on programming language design and implementation, Toronto, Ontario, Canada, June 26-28, 1991, pp. 15-29), first we consider a DO loop model which encompasses 97% of the practical Fortran DO loops. By analyzing their dependence characteristics, we develop the formal theory for the application of various parallelizing transformations, specifically the dependence cycle breaking transformations. By this formalization, we contribute the following useful results: (1) define the scope of the existing cycle breaking techniques and illustrate the shortcomings in them;(2) present the dependence characteristics of reduction loops, which will help in designing general reduction loop recognition algorithms in contrast to the existing pattern matching techniques;and (3) propose a new transformation called node replication and prove that by applying this transformation all the output dependence cycles can be completely removed. Finally, we discuss how the most general linear subscripted DO loops can be converted into the above-mentioned loop model, showing that the results presented in this paper are applicable to ah the linear subscripted DO loops permitted by standard Fortran. (C) 1995 Academic Press, Inc.

关键词： Compiler optimizations Computer programming languages DEPENDENCE dissolved oxygen

来源：评论

学校读者我要写书评

暂无评论

Checking race freedom via linear programming

引用

acm sigplan NOTICES 2008年第6期43卷 1-10页

作者： Terauchi, Tachio Tohoku Univ Sendai Miyagi 980 Japan

We present a new static analysis for race freedom and race detection. The analysis checks race freedom by reducing the problem to ( rational) linear programming. Unlike conventional static analyses for race freedom or race detection, our analysis avoids explicit computation of locksets and lock linearity/must-aliasness. Our analysis can handle a variety of synchronization idioms that more conventional approaches often have difficulties with, such as thread joining, semaphores, and signals. We achieve efficiency by utilizing modern linear programming solvers that can quickly solve large linear programming instances. This paper reports on the formal properties of the analysis and the experience with applying an implementation to real world C programs.

关键词： algorithms languages theory verification fractional capabilities linear programming

来源：评论

学校读者我要写书评

暂无评论

Adding trace matching with free variables to AspectJ

Adding trace matching with free variables to AspectJ

引用

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

来源：评论

学校读者我要写书评

暂无评论

The JastAdd extensible java compiler

The JastAdd extensible java compiler

引用

22nd Annual acm sigplan International conference on Object-Oriented programming, Systems, languages, and Applications, OOPSLA'07

作者： Ekman, Torbjörn Görel, Hedin Programming Tools Group University of Oxford United Kingdom Department of Computer Science Lund University Sweden

ISBN: (纸本)1595937862

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

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：