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

acm sigplan conference on programming language design and implementation, pldi 2006 - PLAS 2006: 2006 programming languages and Analysis for Security Workshop

作者： Ertl, M. Anton Casey, Kevin Gregg, David TU Wien Austria Trinity College Dublin Ireland Institut für Computersprachen Technische Universität Wien Argentinierstraße 8 A-1040 Wien Austria

ISBN: (纸本)1595933743

Tree parsing as supported by code generator generators like BEG, burg, iburg, lburg and ml-burg is a popular instruction selection method. There are two existing approaches for implementing tree parsing: dynamic programming, and tree-parsing automata;each approach has its advantages and disadvantages. We propose a new implementation approach that combines the advantages of both existing approaches: we start out with dynamic programming at compile time, but at every step we generate a state for a tree-parsing automaton, which is used the next time a tree matching the state is found, turning the instruction selector into a fast tree-parsing automaton. We have implemented this approach in the Gforth code generator. The implementation required little effort and reduced the startup time of Gforth by up to a factor of 2.5. Copyright © 2006 acm.

关键词： Automatic programming

来源：评论

学校读者我要写书评

暂无评论

Grammatical abstraction and incremental syntax analysis in a language-based editor 88

Grammatical abstraction and incremental syntax analysis in a...

引用

acm sigplan conference on programming language design and implementation, pldi 1988

作者： Baillance, Robert A. Butcher, Jacob Graham, Susan L. Computer Science Division-EECS University of California BerkeleyCA94 720 United States Department of Computer Science University of New Mexico AlbuquerqueNM87131 United States

ISBN: (纸本)0897912691

Processors for programming languages and other formal languages typically use a concrete syntax to describe the user's view of a program and an abstract syntax to represent language structures internally. Grammatical abstraction is defined as a relationship between two context-free grammars. It formalizes the notion of one syntax being "more abstract" than another. Two variants of abstraction are presented. Weak grammatical abstraction supports (i) the construction during LR parsing of an internal representation that is closely related to the abstract syntax and (ii) incremental LR parsing using that internal representation as its base, Strong grammatical abstraction tightens the correspondence so that top-down construction of incrementally-parsable internal representations is possible. These results arise from an investigation into language-based editing systems, but apply to any program that transforms a linguistic object from a representation in its concrete syntax to, a representation in its abstract syntax or vice versa. © 1988 acm.

关键词： Context free grammars

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the acm sigplan Workshop on Memory Systems Performance and Correctness, MSPC 2013

Proceedings of the ACM SIGPLAN Workshop on Memory Systems Pe...

引用

acm sigplan Workshop on Memory Systems Performance and Correctness, MSPC 2013, co-located with the 34th annual acm sigplan conference on programming language design and implementation, pldi

ISBN: (纸本)9781450321037

The proceedings contain 12 papers. The topics discussed include: APE: accelerator processor extensions to optimize data-compute co-location;a study of data structures with a deep heap shape;introducing kernel-level page reuse for high performance computing;a low overhead method for recovering unused memory inside regions;software-controlled transparent management of heterogeneous memory resources in virtualized systems;program-centric cost models for locality;a new perspective on processing-in-memory architecture design;a coldness metric for cache optimization;all-window data liveness;software-level scheduling to exploit non-uniformly shared data cache on GPGPU;cache rationing for multicore;and analyzing locality of memory references in GPU architectures.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

Fine-grain multithreading with minimal compiler support - A cost effective approach to implementing efficient multithreading languages

Fine-grain multithreading with minimal compiler support - A ...

引用

sigplan 97 conference on programming language design and implementation

作者： Taura, K Yonezawa, A Univ of Tokyo Tokyo Japan

It is difficult to map the execution model of multithreading languages (languages which support fine-grain dynamic thread creation) onto the single stack execution model of C. Consequently, previous work on efficient multithreading uses elaborate frame formats and allocation strategy, with compilers customized for them. This paper presents an alternative cost-effective implementation strategy for multithreading languages which can maximally exploit current sequential C compilers. We identify a set of primitives whereby efficient dynamic thread creation and switch can be achieved and clarify implementation issues and solutions which work under the stack frame layout and calling conventions of current C compilers. The primitives are implemented as a C library and named StackThreads. In StackThreads, a thread creation is done just by a C procedure call, maximizing thread creation performance. When a procedure suspends an execution, the context of the procedure, which is roughly a stack frame of the procedure, is saved into heap and resumed later. With StackThreads, the compiler writer can straightforwardly translate sequential constructs of the source language into corresponding C statements or expressions, while using StackThreads primitives as a blackbox mechanism which switches execution between C procedures.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Spreadsheet Table Transformations from Examples 11

Spreadsheet Table Transformations from Examples

引用

32nd acm sigplan conference on programming language design and implementation (pldi 11)

作者： Harris, William R. Gulwani, Sumit Univ Wisconsin Dept Comp Sci Madison WI 53706 USA

ISBN: (纸本)9781450306638

Every day, millions of computer end-users need to perform tasks over large, tabular data, yet lack the programming knowledge to do such tasks automatically. In this work, we present an automatic technique that takes from a user an example of how the user needs to transform a table of data, and provides to the user a program that implements the transformation described by the example. In particular, we present a language of programs TableProg that can describe transformations that real users require. We then present an algorithm ProgFrornEx that takes an example input and output table, and infers a program in TableProg that implements the transformation described by the example. When the program is applied to the example input, it reproduces the example output. When the program is applied to another, potentially larger, table with a "similar" layout as the example input table, then the program produces a corresponding table with a layout that is similar to the example output table. A user can apply ProgFrornEx interactively, providing multiple small examples to obtain a program that implements the transformation that the user desires. Moreover, ProgFromEx can help identify "noisy" examples that contain errors. To evaluate the practicality of TableProg and ProgFromEx, we implemented ProgFromEx as a module for the Microsoft Excel spreadsheet program. We applied the module to automatically implement over 50 table transformations specified by end-users through examples on online Excel help forums. In seconds, ProgFromEx found programs that satisfied the examples and could be applied to larger input tables. This experience demonstrates that TableProg and ProgFromEx can significantly automate the tasks over tabular data that users need to perform.

关键词： Program Synthesis End-user programming programming by Example Spreadsheet programming Table Manipulation User Intent

来源：评论

学校读者我要写书评

暂无评论

Lightweight Multi-language Syntax Transformation with Parser Parser Combinators 2019

Lightweight Multi-Language Syntax Transformation with Parser...

引用

40th acm sigplan conference on programming language design and implementation (pldi) part of acm's Federated Computing Research conference (FCRC)

作者： van Tonder, Rijnard Le Goues, Claire Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA

ISBN: (纸本)9781450367127

Automatically transforming programs is hard, yet critical for automated program refactoring, rewriting, and repair. Multi-language syntax transformation is especially hard due to heterogeneous representations in syntax, parse trees, and abstract syntax trees (ASTs). Our insight is that the problem can be decomposed such that (1) a common grammar expresses the central context-free language (CFL) properties shared by many contemporary languages and (2) open extension points in the grammar allow customizing syntax (e.g., for balanced delimiters) and hooks in smaller parsers to handle language-specific syntax (e.g., for comments). Our key contribution operationalizes this decomposition using a Parser Parser combinator (PPC), a mechanism that generates parsers for matching syntactic fragments in source code by parsing declarative user-supplied templates. This allows our approach to detach from translating input programs to any particular abstract syntax tree representation, and lifts syntax rewriting to a modularly-defined parsing problem. A notable effect is that we skirt the complexity and burden of defining additional translation layers between concrete user input templates and an underlying abstract syntax representation. We demonstrate that these ideas admit efficient and declarative rewrite templates across 12 languages, and validate effectiveness of our approach by producing correct and desirable lightweight transformations on popular real-world projects (over 50 syntactic changes produced by our approach have been merged into 40+). Our declarative rewrite patterns require an order of magnitude less code compared to analog implementations in existing, language-specific tools.

关键词： syntax transformation parsers rewriting

来源：评论

学校读者我要写书评

暂无评论

Descend: A Safe GPU Systems programming language

引用

PROCEEDINGS OF THE acm ON programming languageS-PacmPL 2024年第PLDI期8卷 841-864页

作者： Koepcke, Bastian Gorlatch, Sergei Steuwer, Michel Univ Munster Munster Germany Tech Univ Berlin Berlin Germany

Graphics Processing Units (GPU) offer tremendous computational power by following a throughput oriented paradigm where many thousand computational units operate in parallel. programming such massively parallel hardware is challenging. Programmers must correctly and efficiently coordinate thousands of threads and their accesses to various shared memory spaces. Existing mainstream GPU programming languages, such as CUDA and OpenCL, are based on C/C++ inheriting their fundamentally unsafe ways to access memory via raw pointers. This facilitates easy to make, but hard to detect bugs, such as data races and deadlocks. In this paper, we present Descend: a safe GPU programming language. In contrast to prior safe high-level GPU programming approaches, Descend is an imperative GPU systems programming language in the spirit of Rust, enforcing safe CPU and GPU memory management in the type system by tracking Ownership and Lifetimes. Descend introduces a new holistic GPU programming model where computations are hierarchically scheduled over the GPU's execution resources: grid, blocks, warps, and threads. Descend's extended Borrow checking ensures that execution resources safely access memory regions without data races. For this, we introduced views describing safe parallel access patterns of memory regions, as well as atomic variables. For memory accesses that can't be checked by our type system, users can annotate limited code sections as unsafe. We discuss the memory safety guarantees offered by Descend and evaluate our implementation using multiple benchmarks, demonstrating that Descend is capable of expressing real-world GPU programs showing competitive performance compared to manually written CUDA programs lacking Descend's safety guarantees.

关键词： GPU programming language design memory safety type systems

来源：评论

学校读者我要写书评

暂无评论

ABCD:: Eliminating array bounds checks on demand

<i>ABCD</i>:: Eliminating array bounds checks on demand

引用

acm sigplan' 00 conference on programming language design and implementation (pldi)

作者： Bodik, R Gupta, R Sarkar, V Univ Wisconsin Madison WI 53706 USA Univ Arizona Tucson AZ 85721 USA IBM Corp TJ Watson Res Ctr Yorktown Hts NY 10598 USA

To guarantee typesafe execution, Java and other strongly typed languages require bounds checking of array accesses. Because array-bounds checks may raise exceptions, they block code motion of instructions with side effects, thus preventing many useful code optimizations, such as partial redundancy elimination or instruction scheduling of memory operations. Furthermore, because it is not expressible at bytecode level, the elimination of bounds checks can only be performed at run time, after the bytecode program is loaded. Using existing powerful bounds-check optimizers at run time is not feasible, however, because they are too heavyweight for the dynamic compilation setting. ABCD is a light-weight algorithm for elimination of Array Bounds Checks on Demand. Its design emphasizes simplicity and efficiency. In essence, ABCD works by adding a few edges to the SSA value graph and performing a simple traversal of the graph. Despite its simplicity, ABCD is surprisingly powerful. On our benchmarks, ABCD removes on average 45% of dynamic bound check instructions, sometimes achieving near-ideal optimization. The efficiency of ABCD stems from two factors. First, ABCD works on a sparse representation. As a result, it requires on average fewer than 10 simple analysis steps per bounds check. Second, ABCD is demand-driven. It can be applied to a set of frequently executed (hot) bounds checks, which makes it suitable for the dynamic-compilation setting, in which compile-time cost is constrained but hot statements are known.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Communication optimizations for parallel C programs 98

Communication optimizations for parallel C programs

引用

Proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, pldi

作者： Zhu, Yingchun Hendren, Laurie J. McGill Univ Montreal Que Canada

ISBN: (纸本)9780897919876

This paper presents algorithms for reducing the communication overhead for parallel C programs that use dynamically-allocated data structures. The framework consists of an analysis phase called possible-placement analysis, and a transformation phase called communication selection. The fundamental idea of possible-placement analysis is to find all possible points for insertion of remote memory operations. Remote reads are propagated upwards, whereas remote writes are propagated downwards. Based on the results of the possible-placement analysis, the communication selection transformation selects the `best' place for inserting the communication, and determines if pipelining or blocking of communication should be performed. The framework has been implemented in the EARTH-McCAT optimizing/parallelizing C compiler, and experimental results are presented for five pointer-intensive benchmarks running on the EARTH-MANNA distributed-memory parallel architecture. These experiments show that the communication optimization can provide performance improvements of up to 16% over the unoptimized benchmarks.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Wire Sorts: A language Abstraction for Safe Hardware Composition 2021

Wire Sorts: A Language Abstraction for Safe Hardware Composi...

引用

42nd acm sigplan International conference on programming language design and implementation (pldi)

作者： Christensen, Michael Sherwood, Timothy Balkind, Jonathan Hardekopf, Ben Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)9781450383912

Effective digital hardware design fundamentally requires decomposing a design into a set of interconnected modules, each a distinct unit of computation and state. However, naively connecting hardware modules leads to real-world pathological cases which are surprisingly far from obvious when looking at the interfaces alone and which are very difficult to debug after synthesis. We show for the first time that it is possible to soundly abstract even complex combinational dependencies of arbitrary hardware modules through the assignment of IO ports to one of four new sorts which we call: to-sync, to-port, from-sync, and from-port. This new taxonomy, and the reasoning it enables, facilitates modularity by escalating problematic aspects of module input/output interaction to the language-level interface specification. We formalize and prove the soundness of our new wire sorts, implement them in a practical hardware description language, and demonstrate they can be applied and even inferred automatically at scale. Through an examination of the BaseJump STL, the OpenPiton manycore research platform, and a complete RISC-V implementation, we find that even on our biggest design containing 1.5 million primitive gates, analysis takes less than 31 seconds;that across 172 unique modules analyzed, the inferred sorts are widely distributed across our taxonomy;and that by using wire sorts, our tool is 2.6-33.9x faster at finding loops than standard synthesis-time cycle detection.

关键词： hardware description languages modules composition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：