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

5th International conference on Aspect-oriented Software Development 2006, AOSD'06

作者： Ongkingco, Neil Avgustinov, Pavel Tibble, Julian Hendren, Laurie De Moor, Oege Sittampalam, Ganesh Programming Tools Group University of Oxford United Kingdom Sable Research Group McGill University Montreal Canada

ISBN: (纸本)159593300X

AspectJ does not provide a mechanism to hide implementation details from advice. As a result, aspects are tightly coupled to the implementation of the code they advise, while the behaviour of the base code is impossible to determine without analysing all advice that could modify its behaviour. The concept of open modules is proposed by Aldrich to solve the problems that arise from unrestricted advice. Defined for a, small functional language, it provides an encapsulation construct that allows an implementation to limit the set of points to which external advice may apply. We present an adaptation of open modules for AspectJ. We expand open modules to encompass the full set of point-cut primitives for AspectJ, extend its method of module composition to include the ability to open up a module, and describe the implementation of the design as an extension of the AspectBench compiler. We also provide an example of the use of open modules on a substantial AspectJ program to show how it would fit into existing AspectJ projects. Copyright 2006 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A practical automatic polyhedral parallelizer and locality optimizer

引用

acm sigplan NOTICES 2008年第6期43卷 101-113页

作者： Bondhugula, Uday Hartono, Albert Ramanujam, J. Sadayappan, P. Ohio State Univ Dept Comp Sci & Engn Columbus OH 43210 USA Louisiana State Univ Dept Elect & Comp Engn Baton Rouge LA 70803 USA Louisiana State Univ CCT Baton Rouge LA 70803 USA

We present the design and implementation of an automatic polyhedral source-to-source transformation framework that can optimize regular programs ( sequences of possibly imperfectly nested loops) for parallelism and locality simultaneously. Through this work, we show the practicality of analytical model-driven automatic transformation in the polyhedral model-far beyond what is possible by current production compilers. Unlike previous works, our approach is an end-to-end fully automatic one driven by an integer linear optimization framework that takes an explicit view of finding good ways of tiling for parallelism and locality using affine transformations. The framework has been implemented into a tool to automatically generate OpenMP parallel code from C program sections. Experimental results from the tool show very high speedups for local and parallel execution on multi-cores over state-of-the-art compiler frameworks from the research community as well as the best native production compilers. The system also enables the easy use of powerful empirical/iterative optimization for general arbitrarily nested loop sequences.

关键词： algorithms design experimentation performance automatic parallelization locality optimization polyhedral model loop transformations affine transformations tiling

来源：评论

学校读者我要写书评

暂无评论

Abc An extensible AspectJ compiler 05

Abc An extensible AspectJ compiler

引用

AOSD 2005: 4th International conference on Aspect-Oriented Software Development

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

ISBN: (纸本)1595930434

Research in the design of aspect-oriented programming languages requires a workbench that facilitates easy experimentation with new language features and implementation techniques. In particular, new features for AspectJ have been proposed that require extensions in many dimensions: syntax, type checking and code generation, as well as data flow and control flow analyses. The AspectBench Compiler (abc) is an implementation of such a workbench. The base version of abc implements the full AspectJ language. Its frontend is built, using the Polyglot framework, as a modular extension of the Java language. The use of Polyglot gives flexibility of syntax and type checking. The backend is built using the Soot framework, to give modular code generation and analyses. In this paper, we outline the design of abc, focusing mostly on how the design supports extensibility. We then provide a general overview of how to use abc to implement an extension. Finally, we illustrate the extension mechanisms of abc through a number of small, but non-trivial, examples, abc is freely available under the GNU LGPL. Copyright 2005 acm.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

design TRADEOFFS TO SUPPORT THE C programming language IN THE CRISP MICROPROCESSOR.

引用

proceedings - Second International conference on Architectural Support for programming languages and Operating Systems (ASPLOS II).

作者： Ditzel, David R. McLellan, Hubert R. Berenbaum, Alan D. AT&T Bell Lab Murray Hill NJ USA AT&T Bell Lab Murray Hill NJ USA

ISBN: (纸本)0818608056

The tradeoffs used in the implementation of a 172,163-transistor 32-bit single-chip microprocessor are investigated, focusing on those particular to the use of C. CRISP matches the requirements for supporting C compilers with a simple, straightforward set of instructions, a small number of addressing modes, and by allowing orthogonal operation on the basic integer data types supported in C. The use of a small stack cache provides a significant reduction in data traffic by a better allocation of data to registers than has previously been possible with software compilers.

关键词： COMPUTERS, MICROCOMPUTER

来源：评论

学校读者我要写书评

暂无评论

Disjoint Intersection Types

引用

acm sigplan NOTICES 2016年第9期51卷 364-377页

作者： Oliveira, Bruno C. d. S. Shi, Zhiyuan Alpuim, Joao Univ Hong Kong Hong Kong Hong Kong Peoples R China

Dunfield showed that a simply typed core calculus with intersection types and a merge operator is able to capture various programming language features. While his calculus is type-safe, it is not coherent: different derivations for the same expression can elaborate to expressions that evaluate to different values. The lack of coherence is an important disadvantage for adoption of his core calculus in implementations of programming languages, as the semantics of the programming language becomes implementation-dependent. This paper presents lambda(i) : a coherent and type-safe calculus with a form of intersection types and a merge operator. Coherence is achieved by ensuring that intersection types are disjoint and programs are sufficiently annotated to avoid type ambiguity. We propose a definition of disjointness where two types A and B are disjoint only if certain set of types are common supertypes of A and B. We investigate three different variants of lambda(i), with three variants of disjointness. In the simplest variant, which does not allow inverted perpendicular types, two types are disjoint if they do not share any common supertypes at all. The other two variants introduce inverted perpendicular types and refine the notion of disjointness to allow two types to be disjoint when the only the set of common supertypes are top-like. The difference between the two variants with inverted perpendicular types is on the definition of top-like types, which has an impact on which types are allowed on intersections. We present a type system that prevents intersection types that are not disjoint, as well as an algorithmic specifications to determine whether two types are disjoint for all three variants.

关键词： Intersection Types Type System design languages Theory

来源：评论

学校读者我要写书评

暂无评论

The influence of the object-oriented language model on a supporting architecture 26

The influence of the object-oriented language model on a sup...

引用

26th Hawaii International conference on System Sciences, HICSS 1993

作者： Wolczko, Mario Williams, Ifor Dept. of Computer Science University of Manchester Oxford Rd ManchesterM13 9PL United Kingdom

ISBN: (纸本)0818632305

The MUSHROOM architecture is designed to efficiently support dynamic object-oriented languages such as Smalltalk. The authors describe the architecture, and how the object-oriented model of computation and the provision of a sophisticated computer led to various simplifications in the design and implementation of the architecture. Two particular features of the object-oriented model have been exploited in the architecture. Freedom of object identifier selection, allows for straightforward and efficient implementation in software of virtual-to-real address translation and for efficient object allocation, and the absence of address aliasing allows simple, virtually addressed caches to be used. A prototype implementation of this architecture is currently being commissioned. © 1993 IEEE.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Dependence analysis for pointer variables

引用

sigplan Notices (acm Special Interest Group on programming languages) 1989年第7期24卷 28-40页

作者： Horwitz, Susan Pfeiffer, Phil Reps, Thomas Univ of Wisconsin United States

Our concern is how to determine data dependences between program constructs in programming languages with pointer variables. We are particularly interested in computing data dependences for languages that manipulate heap-allocated storage, such as Lisp and Pascal. We have defined a family of algorithms that compute safe approximations to the flow, output, and anti-dependences of a program written in such a language. Our algorithms account for destructive updates to fields of a structure and thus are not limited to the cases where all structures are trees or acyclic graphs;they are applicable to programs that build cyclic structures. For structured programming constructs, the technique can be extended to distinguish between loop-carried and loop-independent dependences, as well as to determine lower bounds on minimum distances for loop-carried dependences.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Occurrence Typing Modulo Theories

引用

acm sigplan NOTICES 2016年第6期51卷 296-309页

作者： Kent, Andrew M. Kempe, David Tobin-Hochstadt, Sam Indiana Univ Bloomington IN 47405 USA

We present a new type system combining occurrence typing- a technique previously used to type check programs in dynamically-typed languages such as Racket, Clojure, and JavaScript-with dependent refinement types. We demonstrate that the addition of refinement types allows the integration of arbitrary solver-backed reasoning about logical propositions from external theories. By building on occurrence typing, we can add our enriched type system as a natural extension of Typed Racket, reusing its core while increasing its expressiveness. The result is a well-tested type system with a conservative, decidable core in which types may depend on a small but extensible set of program terms. In addition to describing our design, we present the following: a formal model and proof of correctness;a strategy for integrating new theories, with specific examples including linear arithmetic and bitvectors;and an evaluation in the context of the full Typed Racket implementation. Specifically, we take safe vector operations as a case study, examining all vector accesses in a 56,000 line corpus of Typed Racket programs. Our system is able to prove that 50% of these are safe with no new annotations, and with a few annotations and modifications we capture more than 70%.

关键词： languages design Verification Refinement types occurrence typing Racket

来源：评论

学校读者我要写书评

暂无评论

A race-free hardware modeling language

A race-free hardware modeling language

引用

3rd acm and IEEE International conferenceon Formal Methods and Models for Co-design, MEMOCODE'05

作者： Schaumont, Patrick Shukla, Sandeep Verbauwhede, Ingrid UCLA Virginia Tech UCLA KUL

ISBN: (纸本)0780392272

We describe race-free properties of a hardware description language called GEZEL. The language describes networks of cycle-true finite-state-machines with datapaths (FSMDs). We derive a set of four rules under which a network of such FSMDs satisfies the Kahn principle. When applying those rules, GEZEL programs will be determinate and a designer will thus obtain race-free hardware. We define extended FSMD networks as FSMD networks for which some components are user-defined and not specified as FSMDs. An important result is that the determinate properties of the FSMD network are also valid for the extended FSMD network provided that the user-defined components are determinate. Most hardware description languages do not have this determinacy. Their simulation semantics are dependent on simulator implementation, and on a run-time race resolution mechanism. We therefore position GEZEL as a model of computation that RTL designers should have in mind while creating RTL models. In fact, we can generate SystemC and other HDL code from GEZEL models, thereby guaranteeing the determinacy in the generated HDL code. © 2005 IEEE.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Latte: A language, Compiler, and Runtime for Elegant and Efficient Deep Neural Networks

引用

acm sigplan NOTICES 2016年第6期51卷 209-223页

作者： Truong, Leonard Barik, Rajkishore Totoni, Ehsan Liu, Hai Markley, Chick Fox, Armando Shpeisman, Tatiana Univ Calif Berkeley Intel Labs Berkeley CA USA Intel Labs Berkeley CA USA Univ Calif Berkeley Berkeley CA USA

Deep neural networks (DNNs) have undergone a surge in popularity with consistent advances in the state of the art for tasks including image recognition, natural language processing, and speech recognition. The computationally expensive nature of these networks has led to the proliferation of implementations that sacrifice abstraction for high performance. In this paper, we present Latte, a domain-specific language for DNNs that provides a natural abstraction for specifying new layers without sacrificing performance. Users of Latte express DNNs as ensembles of neurons with connections between them. The Latte compiler synthesizes a program based on the user specification, applies a suite of domain-specific and general optimizations, and emits efficient machine code for heterogeneous architectures. Latte also includes a communication runtime for distributed memory data-parallelism. Using networks described using Latte, we demonstrate 3-6x speedup over Caffe (C++/MKL) on the three state-of-the-art ImageNet models executing on an Intel Xeon E5-2699 v3 x86 CPU.

关键词： Deep Learning Neural Networks Domain Specific language Compiler Optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：