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

40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

作者： Rompf, Tiark Sujeeth, Arvind K. Amin, Nada Brown, Kevin J. Jovanovic, Vojin Lee, HyoukJoong Jonnalagedda, Manohar Olukotun, Kunle Odersky, Martin EPFL Zurich Switzerland Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450318327

High level data structures are a cornerstone of modern programming and at the same time stand in the way of compiler optimizations. In order to reason about user or library-defined data structures, compilers need to be extensible. Common mechanisms to extend compilers fall into two categories. Frontend macros, staging or partial evaluation systems can be used to programmatically remove abstraction and specialize programs before they enter the compiler. Alternatively, some compilers allow extending the internal workings by adding new transformation passes at different points in the compile chain or adding new intermediate representation (IR) types. None of these mechanisms alone is sufficient to handle the challenges posed by high level data structures. This paper shows a novel way to combine them to yield benefits that are greater than the sum of the parts. Instead of using staging merely as a front end, we implement internal compiler passes using staging as well. These internal passes delegate back to program execution to construct the transformed IR. Staging is known to simplify program generation, and in the same way it can simplify program transformation. Defining a transformation as a staged IR interpreter is simpler than implementing a low-level IR to IR transformer. With custom IR nodes, many optimizations that are expressed as rewritings from IR nodes to staged program fragments can be combined into a single pass, mitigating phase ordering problems. Speculative rewriting can preserve optimistic assumptions around loops. We demonstrate several powerful program optimizations using this architecture that are particularly geared towards data structures: a novel loop fusion and deforestation algorithm, array of struct to struct of array conversion, object flattening and code generation for heterogeneous parallel devices. We validate our approach using several non trivial case studies that exhibit order of magnitude speedups in experiments.

关键词： Design Languages Performance Staging Code Generation Data Structures extensible compilers

来源：评论

学校读者我要写书评

暂无评论

A portable compiler-integrated approach to permanent checking

引用

AUTOMATED SOFTWARE ENGINEERING 2008年第1期15卷 3-33页

作者： Volanschi, Nic 1 Rue Michel Jeunet F-78300 Poissy France

Program checking is now a mature technology, but is not yet used on a large scale. We identify one cause of this gap in the decoupling of checking tools from the everyday development tools. To radically change the situation, we explore the integration of simple user-defined checks into the core of every development process: the compiler. The checks we implement express constrained reachability queries in the control flow graph taking the form "from x to y avoiding z", where x, y, and z are native code patterns containing a blend of syntactic, semantic and dataflow information. Compiler integration enables continuous checking throughout development, but also a pervasive propagation of checking technology. This integration poses some interesting challenges, including tight bounds on the acceptable overhead, but in turn opens up new perspectives. Factorizing analyses between checking and compiling improves both the efficiency and the expressiveness of the checks.

关键词： extensible compilers user-defined checks

来源：评论

学校读者我要写书评

暂无评论

Implementing aspect-oriented programming constructs as modular language extensions

引用

SCIENCE OF COMPUTER PROGRAMMING 2007年第1期68卷 38-61页

作者： Van Wyk, Eric Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA

extensible programming languages and their compilers are experimental systems that use highly modular specifications of languages and language extensions in order to allow a variety of language features to be easily imported, by the programmer, into his or her programming environment. Our framework for extensible languages is based on higher-order attribute grammars extended with a mechanism called "forwarding" that mimics a simple rewriting process. Forwarding is designed such that no additional attribute definitions need to be written when combining a "host" language with language extensions (specified as attribute grammars), thus allowing for the modular composition of language features. This means that programmers can remain unaware of the underlying attribute grammars when building customized languages by importing language extensions. This paper shows how aspects and the aspect weaving process from aspect-oriented programming can be specified as a modular language extension and imported into an extensible host language. This paper also illustrates how an extensible compiler framework exposes its underlying semantic analyses and how this can provide a convenient arena in which researchers can explore new aspect-oriented language features. (c) 2007 Elsevier B.V. All rights reserved.

关键词： extensible languages extensible compilers attribute grammars forwarding aspect-oriented programming

来源：评论

学校读者我要写书评

暂无评论

Silver: An extensible attribute grammar system

引用

SCIENCE OF COMPUTER PROGRAMMING 2010年第1-2期75卷 39-54页

作者： Van Wyk, Eric Bodin, Derek Gao, Jimin Krishnan, Lijesh Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA

Attribute grammar specification languages, like many domain-specific languages, offer significant advantages to their users, such as high-level declarative constructs and domain-specific analyses. Despite these advantages, attribute grammars are often not adopted to the degree that their proponents envision. One practical obstacle to their adoption is a perceived lack of both domain-specific and general purpose language features needed to address the many different aspects of a problem. Here we describe Silver, an extensible attribute grammar specification system, and show how it can be extended with general purpose features such as pattern matching and domain-specific features such as collection attributes and constructs for supporting data-flow analysis of imperative programs. The result is an attribute grammar specification language with a rich set of language features. Silver is implemented in itself by a Silver attribute grammar and utilizes forwarding to implement the extensions in a cost-effective manner. (C) 2009 Elsevier B.V. All rights reserved.

关键词： extensible languages extensible compilers Attribute grammars Forwarding Silver attribute grammar system

来源：评论

学校读者我要写书评

暂无评论

Semantic and behavioral library transformations

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2002年第13期44卷 797-810页

作者： Schupp, S Gregor, D Musser, D Liu, SM Rensselaer Polytech Inst Dept Comp Sci Troy NY 12180 USA Hewlett Packard Corp Cupertino CA USA

While software methodology encourages the use of libraries and advocates architectures of layered libraries, in practice the composition of libraries is not always seamless and the combination of two well-designed libraries not necessarily well designed, since it could result in suboptimal call sequences, lost functionality, or avoidable overhead. In this paper we introduce Simplicissimus, a framework for rewrite-based source code transformations that allows for code replacement in a systematic and safe manner. We discuss the design and implementation of the framework and illustrate its functionality with applications in several areas. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： active libraries extensible compilers concept-based transformations C plus plus metaprogramming

来源：评论

学校读者我要写书评

暂无评论

Sound and extensible Renaming for Java 08

Sound and Extensible Renaming for Java

引用

23rd Annual ACM Conference on Object-Oriented Programming, Systems, Languages and Applications

作者： Schaefer, Max Ekman, Torbjoern de Moor, Oege Univ Oxford Programming Tools Grp Oxford OX1 2JD England

ISBN: (纸本)9781605582153

Descriptive names are crucial to understand code. However, good names are notoriously hard to choose and manually changing a globally visible name can be a maintenance nightmare. Hence, tool support for automated renaming is an essential aid for developers and widely supported by popular development environments. This work improves on two limitations in current refactoring tools: too weak preconditions that lead to unsoundness where names do not bind to the correct declarations after renaming, and too strong preconditions that prevent renaming of certain programs. We identify two main reasons for unsoundness: complex name lookup rules make it hard to define sufficient preconditions, and new language features require additional preconditions. We alleviate both problems by presenting a novel extensible technique for creating symbolic names that are guaranteed to bind to a desired entity in a particular context by inverting lookup functions. The inverted lookup functions can then be tailored to create qualified names where otherwise a conflict would occur, allowing the refactoring to proceed and improve on the problem with too strong preconditions. We have implemented renaming for Java as an extension to the JastAdd extensible Java Compiler and integrated it in Eclipse. We show examples for which other refactoring engines have too weak preconditions, as well as examples where our approach succeeds in renaming entities by inserting qualifications. To validate the extensibility of the approach we have implemented renaming support for Java 5 and AspectJ like inter-type declarations as modular extensions to the initial Java 1.4 refactoring engine. The renaming engine is only a few thousand lines of code including extensions and performance is on par with industrial strength refactoring tools.

关键词： Refactoring name analysis renaming extensible compilers

来源：评论

学校读者我要写书评

暂无评论

Architecting aQu ery Compiler for Spatial Workloads 20

Architecting aQu ery Compiler for Spatial Workloads

引用

ACM SIGMOD International Conference on Management of Data (SIGMOD)

作者： Tahboub, Ruby Y. Rompf, Tiark Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9781450367356

Modern location-based applications rely extensively on the efficient processing of spatial data and queries. Spatial query engines are commonly engineered as an extension to a relational database or a cluster-computing framework. Large parts of the spatial processing runtime is spent on evaluating spatial predicates and traversing spatial indexing structures. Typical high-level implementations of these spatial structures incur significant interpretive overhead, which increases latency and lowers throughput. A promising idea to improve the performance of spatial workloads is to leverage native code generation techniques that have become popular in relational query engines. However, architecting a spatial query compiler is challenging since spatial processing has fundamentally different execution characteristics from relational workloads in terms of data dimensionality, indexing structures, and predicate evaluation. In this paper, we discuss the underlying reasons why standard query compilation techniques are not fully effective when applied to spatial workloads, and we demonstrate how a particular style of query compilation based on techniques borrowed from partial evaluation and generative programming manages to avoid most of these difficulties by extending the scope of custom code generation into the data structures layer. We extend the LB2 main-memory query compiler, a relational engine developed in this style, with spatial data types, predicates, indexing structures, and operators. We show that the spatial extension matches the performance of specialized library code and outperforms relational and map-reduce extensions.

关键词： Query Compilation Staging Code Generation Spatial Query Processing Futamura Projections extensible compilers

来源：评论

学校读者我要写书评

暂无评论

Sound and extensible Renaming for Java

引用

ACM SIGPLAN NOTICES 2008年第10期43卷 277-294页

作者： Schaefer, Max Ekman, Torbjoern de Moor, Oege Univ Oxford Programming Tools Grp Oxford OX1 2JD England

关键词： Languages Refactoring name analysis renaming extensible compilers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：