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

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

来源：评论

学校读者我要写书评

暂无评论

Multi-dispatch in the Java Virtual Machine: design and implementation

Multi-dispatch in the Java Virtual Machine: Design and imple...

引用

2000 conference on Object-Oriented programming, Systems, languages, and Applications, OOPSLA 2000

作者： Dutchyn, Christopher Lu, Paul Szafron, Duane Bromling, Steve Holst, Wade Department of Computing Science University of Alberta Edmonton AB T6G 2E8 Canada Department of Computer Science University of Western Ontario MiddleSex College London ON N6A 5B7 Canada

ISBN: (纸本)1581133073

Mainstream object-oriented languages, such as C++ and Java, provide only a restricted form of polymorphic methods, namely single-receiver dispatch. In common programming situations, programmers must work-around this limitation. We detail how to extend the Java Virtual Machine to support multiple-dispatch and examine the complications that Java imposes on multiple-dispatch in practice. Our technique avoids changes to the Java programming language itself, maintains source-code and library compatibility, and isolates the performance penalty and semantic changes of multiple-dispatch to the program sections which use it. We have micro-benchmark and application-level performance results for a dynamic Most Specific Applicable (MSA) dispatcher, two table-based dispatchers (Multiple Row Displacement (MRD) and Single Receiver Projections (SRP)), and a tuned SRP dispatcher. Our general-purpose technique provides smaller dispatch latency than equivalent programmer-written double-dispatch code. © 2000 acm.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Aspectual Caml: an aspect-oriented functional language

引用

acm sigplan NOTICES 2005年第9期40卷 320-330页

作者： Masuhara, H Tatsuzawa, H Yonezawa, A Univ Tokyo Grad Sch Arts & Sci Tokyo Japan Univ Tokyo Dept Comp Sci Tokyo Japan Univ Tokyo Dept Comp Sci Tokyo Japan

We propose an aspect-oriented programming (AOP) language called Aspectual Caml based on a strongly-typed functional language Objective Caml with two AOP mechanisms similar to those in AspectJ language. This paper describes the design and implementation issues of those AOP mechanisms that give us insights into the interaction between AOP features and common features in strongly-typed functional languages such as type inference, polymorphic types and curried functions. We implemented a prototype compiler of the language and used the language for separating crosscutting concerns in application programs, including for separating descriptions of a type system from compiler descriptions.

关键词： aspect-oriented programming objective Caml pointcut and advice

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the conference on Object-Oriented programming Systems, languages, and Applications, OOPSLA

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

引用

conference on Object-Oriented programming Systems, languages and Applications, OOPSLA 1986

ISBN: (纸本)0897912047

The proceedings contain 49 papers. The topics discussed include: Petri net-based object-oriented modelling of distributed systems;the application accelerator illustration system;a smalltalk system for algebraic manipulation;a simple technique for handling multiple polymorphism;encapsulators: a new software paradigm in smalltalk-80;the design and implementation of coneurrentsmalltalk;an exemplar based smalltalk;PI: A case study in object-oriented programming;an object-oriented approach to a large scientific application;object oriented spreadsheets: the analytic spreadsheet package;object identity;an alternative to subclassing;Boolean classes;language support for changeable large real time systems;genericity versus inheritance;a diagram for object-oriented programs;moving structures between smalltalk images;development of an object-oriented DBMS;a distributed repository for immutable persistent objects;design of a distributed object manager for the smalltalk-80 system;commonloops merging LISP and object-oriented programming;and Oaklisp: an object-oriented scheme with first class types.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Case study of object-oriented software development 92

Case study of object-oriented software development

引用

conference on Object-Oriented programming Systems, languages, and Applications - OOPSLA'92

作者： de Champeaux, Dennis Anderson, Al Feldhousen, Ed HP-Lab Palo Alto CA United States

ISBN: (纸本)0201533723

These are the highlights of a successfully completed application of object-oriented software development for a new product. The project was of medium size, the duration was less than 24 months (from the end of the requirements specification to product shipment), and the average team size was 8-10 software engineers. We discuss how the team dealt with major new aspects: a different paradigm, a different programming language, a different user interface environment, and a different development environment. In spite of all these novelties and in spite of the fact that almost twice as much code was produced as was predicted, the project schedule slipped only by 20%. We touch upon all phases of the development life cycle: requirement capture, OO analysis, OO design, OO implementation and the verification phase. Some management perspectives are addressed as well.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Extending SQL-92 for OODB access: design and implementation experience 95

Extending SQL-92 for OODB access: Design and implementation ...

引用

10th Annual conference on Object-Oriented programming Systems, languages, and Applications, OOPSLA 1995

作者： Kiernan, Jerry Carey, Michael J. IBM Santa Teresa Lab. 555 Bailey Avenue San Jose CA 95141 United States IBM Almaden Research Center 650 Harry Road K55-B1 San Jose CA 95120 United States

ISBN: (纸本)0897917030

This paper describes the design and implementation of a query engine that provides extended SQL-based access to the data managed by an object-oriented database system. This query engine allows extended SQL queries to be embedded in C++ programs or issued interactively as from a command line interface. The language supported by the engine is the complete SQL-92 select statement plus object extensions for navigating along paths and embedded structures, querying nested sets, and invoking member functions. In addition, an object-oriented SQL view facility is provided. Using this view facility, one can define object-oriented views;one can also define views that flatten complex OODB schemas, allowing direct access by existing tools designed to provide remote access to relational databases. The view facility also supports the definition of views that include reference and set-valued columns based on other views, thus allowing entire "view schemas" to be created. This paper describes the SQL-92 query and view extensions and discusses a number of issues that arose on the way to the implementation that is currently running on top of the ObjectStore OODB system. © 1995 acm.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

A first-class approach to genericity

A first-class approach to genericity

引用

18th Annual conference on Object-Oriented programming, Systems, languages and Applications (OOPSLA 2003)

作者： Allen, E Bannet, J Cartwright, R Rice Univ Houston TX 77005 USA

This paper describes how to add first-class generic types including mixins - to strongly-typed 00 languages with nominal subtyping such as Java and C#. A generic type system is "first-class" if generic types can appear in any context where conventional types can appear. In this context, a mixin is simply a generic class that extends one of its type parameters, e.g., a class C that extends T. Although mixins of this form are widely used in C++ (via templates), they are clumsy and error-prone because C++ treats mixins as macros, forcing each mixin instantiation to be separately compiled and type-checked. The abstraction embodied in a mixin is never separately analyzed. Our formulation of mixins using first-class genericity accommodates sound local (class-by-class) type checking. A mixin can be fully type-checked given symbol tables for each of the classes that it directly references-the same context in which Java performs incremental class compilation. To our knowledge, no previous formal analysis of first-class genericity in languages with nominal type systems has been conducted, which is surprising because nominal subtyping has become predominant in mainstream object-oriented programming languages. What makes our treatment of first-class genericity particularly interesting and important is the fact that it can be added to the existing Java language without any change to the underlying Java Virtual Machine. Moreover, the extension is backward compatible with legacy Java source and class files. Although our discussion of a, practical implementation strategy focuses on Java, the same implementation techniques could be applied to other object-oriented languages such as C# or Eiffel that support incremental compilation, dynamic class loading, and nominal subtyping.

关键词： design languages

来源：评论

学校读者我要写书评

暂无评论

Terra: A Multi-Stage language for High-Performance Computing 13

Terra: A Multi-Stage Language for High-Performance Computing

引用

acm sigplan conference on programming language design and implementation

作者： Zachary DeVito James Hegarty Alex Aiken Pat Hanrahan Jan Vitek Stanford University Purdue University

ISBN: (纸本)9781450320146

High-performance computing applications, such as auto-tuners and domain-specific languages, rely on generative programming techniques to achieve high performance and portability. However, these systems are often implemented in multiple disparate languages and perform code generation in a separate process from program execution, making certain optimizations difficult to engineer. We leverage a popular scripting language, Lua, to stage the execution of a novel low-level language, Terra. Users can implement optimizations in the high-level language, and use built-in constructs to generate and execute high-performance Terra code. To simplify meta-programming, Lua and Terra share the same lexical environment, but, to ensure performance, Terra code can execute independently of Lua's runtime. We evaluate our design by reimplementing existing multi-language systems entirely in Terra. Our Terra-based auto-tuner for BLAS routines performs within 20% of ATLAS, and our DSL for stencil computations runs 2.3x faster than hand-written C.

关键词： Lua Staged computation DSL design Performance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：