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

41st acm sigplan conference on programming language design and implementation (PLDI)

作者： Bichsel, Benjamin Baader, Maximilian Gehr, Timon Vechev, Martin Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450376136

Existing quantum languages force the programmer to work at a low level of abstraction leading to unintuitive and cluttered code. A fundamental reason is that dropping temporary values from the program state requires explicitly applying quantum operations that safely uncompute these values. We present Silq, the first quantum language that addresses this challenge by supporting safe, automatic uncomputation. This enables an intuitive semantics that implicitly drops temporary values, as in classical computation. To ensure physicality of Silq's semantics, its type system leverages novel annotations to reject unphysical programs. Our experimental evaluation demonstrates that Silq programs are not only easier to read and write, but also significantly shorter than equivalent programs in other quantum languages (on average -46% for Q#, -38% for Quipper), while using only half the number of quantum primitives.

关键词： Quantum language Uncomputation Semantics

来源：评论

学校读者我要写书评

暂无评论

Thread-modular shape analysis 07

Thread-modular shape analysis

引用

conference on programming language design and implementation

作者： Gotsman, Alexey Berdine, Josh Cook, Byron Sagiv, Mooly Univ Cambridge Cambridge CB2 1TN England Microsoft Corp Redmond WA 98052 USA

ISBN: (纸本)9781595936332

We present the first shape analysis for multithreaded programs that avoids the explicit enumeration of execution-interleavings. Our approach is to automatically infer a resource invariant associated with each lock that describes the part of the heap protected by the lock. This allows us to use a sequential shape analysis on each thread. We show that resource invariants of a certain class can be characterized as least fixed points and computed via repeated applications of shape analysis only on each individual thread. Based on this approach, we have implemented a thread-modular shape analysis tool and applied it to concurrent heap-manipulating code from Windows device drivers.

关键词： abstract interpretation concurrent programming shape analysis static analysis

来源：评论

学校读者我要写书评

暂无评论

Bamboo: A Data-Centric, Object-Oriented Approach to Many-core Software 10

Bamboo: A Data-Centric, Object-Oriented Approach to Many-cor...

引用

acm sigplan conference on programming language design and implementation

作者： Zhou, Jin Demsky, Brian Univ Calif Irvine Dept Elect Engn & Comp Sci Irvine CA 92697 USA

ISBN: (纸本)9781450300193

Traditional data-oriented programming languages such as dataflow languages and stream languages provide a natural abstraction for parallel programming. In these languages, a developer focuses on the flow of data through the computation and these systems free the developer from the complexities of low-level, thread-oriented concurrency primitives. This simplification comes at a cost traditional data-oriented approaches restrict the mutation of state and, in practice, the types of data structures a program can effectively use. Bamboo borrows from work in typestate and software transactions to relax the traditional restrictions of data-oriented programming models to support mutation of arbitrary data structures. We have implemented a compiler for Bamboo which generates code for the TILEPro64 many-core processor. We have evaluated this implementation on six benchmarks: Tracking, a feature tracking algorithm from computer vision;KMeans, a K-means clustering algorithm;Monte Carlo, a Monte Carlo simulation;Filter Bank, a multi-channel filter bank;Fractal, a Mandelbrot set computation;and Series, a Fourier series computation. We found that our compiler generated implementations that obtained speedups ranging from 26.2 x to 61.6 x when executed on 62 cores.

关键词： Many-core programming Data-Centric languages

来源：评论

学校读者我要写书评

暂无评论

implementation and evaluation of fusion and contraction in array languages

Implementation and evaluation of fusion and contraction in a...

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Lewis, E.Christopher Lin, Calvin Snyder, Lawrence Univ of Washington Seattle WA United States

Array languages such as Fortran 90, HPF and ZPL have many benefits in simplifying array-based computations and expressing data parallelism. However, they can suffer large performance penalties because they introduce intermediate arrays - both at the source level and during the compilation process - which increase memory usage and pollute the cache. Most compilers address this problem by simply scalarizing the array language and relying on a scalar language compiler to perform loop fusion and array contraction. We instead show that there are advantages to performing a form of loop fusion and array contraction at the array level. This paper describes this approach and explains its advantages. Experimental results show that our scheme typically yields runtime improvements of greater than 20% and sometimes up to 400%. In addition, it yields superior memory use when compared against commercial compilers and exhibits comparable memory use when compared with scalar languages. We also explore the interaction between these transformations and communication optimizations.

关键词： FORTRAN (programming language)

来源：评论

学校读者我要写书评

暂无评论

Associated Effects Flexible Abstractions for Effectful programming

引用

proceedings OF THE acm ON programming languageS-PacmPL 2024年第PLDI期8卷 394-416页

作者： Lutze, Matthew Madsen, Magnus Aarhus Univ Aarhus Denmark

We present associated effects, a programming language feature that enables type classes to abstract over the effects of their function signatures, allowing each type class instance to specify its concrete effects. Associated effects significantly increase the flexibility and expressive power of a programming language that combines a type and effect system with type classes. In particular, associated effects allow us to (i) abstract over total and partial functions, where partial functions may throw exceptions, (ii) abstract over immutable data structures and mutable data structures that have heap effects, and (iii) implement adaptors that combine type classes with algebraic effects. We implement associated effects as an extension of the Flix programming language and refactor the Flix Standard Library to use associated effects, significantly increasing its flexibility and expressive power. Specifically, we add associated effects to 11 type classes, which enables us to add 28 new type class instances.

关键词： effect systems associated effects associated types generic programming type classes type functions ad-hoc polymorphism

来源：评论

学校读者我要写书评

暂无评论

implementation of the Cilk-5 multithreaded language

Implementation of the Cilk-5 multithreaded language

引用

proceedings of the 1998 Annual acm sigplan conference on programming language design and implementation, PLDI

作者： Frigo, Matteo Leiserson, Charles E. Randall, Keith H. MIT Lab for Computer Science Cambridge MA United States

The fifth release of the multithreaded language Cilk uses a provably good `work-stealing' scheduling algorithm similar to the first system, but the language has been completely redesigned and the runtime system completely reengineered. The efficiency of the new implementation was aided by a clear strategy that arose from a theoretical analysis of the scheduling algorithm: concentrate on minimizing overheads that contribute to the work, even at the expense of overheads that contribute to the critical path. Although it may seem counterintuitive to move overheads onto the critical path, this `work-first' principle has led to a portable Cilk-5 implementation in which the typical cost of spawning a parallel thread is only between 2 and 6 times the cost of a C function call on a variety of contemporary machines. Many Cilk programs run on one processor with virtually no degradation compared to equivalent C programs. This paper describes how the work-first principle was exploited in the design of Cilk-5's compiler and its runtime system. In particular, we present Cilk-5's novel `two-clone' compilation strategy and its Dijkstra-like mutual-exclusion protocol for implementing the ready deque in the work-stealing scheduler.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Transformations on Hierarchically Structured Data 16

Synthesizing Transformations on Hierarchically Structured Da...

引用

37th acm sigplan conference on programming language design and implementation

作者： Yaghmazadeh, Navid Klinger, Christian Dillig, Isil Chaudhuri, Swarat Univ Texas Austin Austin TX 78712 USA Univ Freiburg Freiburg Germany Rice Univ Houston TX 77251 USA

ISBN: (纸本)9781450342612

This paper presents a new approach for synthesizing transformations on tree-structured data, such as Unix directories and XML documents. We consider a general abstraction for such data, called hierarchical data trees (HDTs) and present a novel example-driven synthesis algorithm for HDT transformations. Our central insight is to reduce the problem of synthesizing tree transformers to the synthesis of list transformations that are applied to the paths of the tree. The synthesis problem over lists is solved using a new algorithm that combines SMT solving and decision tree learning. We have implemented our technique in a system called HADES and show that HADES can automatically synthesize a variety of interesting transformations collected from online forums.

关键词： languages Program synthesis programming by example data transformations

来源：评论

学校读者我要写书评

暂无评论

Probabilistic programming with Programmable Inference 2018

Probabilistic Programming with Programmable Inference

引用

39th acm sigplan conference on programming language design and implementation (PLDI)

作者： Mansinghka, Vikash K. Schaechtle, Ulrich Handa, Shivam Radul, Alexey Chen, Yutian Rinard, Martin MIT Cambridge MA 02139 USA Google DeepMind London England

ISBN: (纸本)9781450356985

We introduce inference metaprogramming for probabilistic programming languages, including new language constructs, a formalism, and the first demonstration of effectiveness in practice. Instead of relying on rigid black-box inference algorithms hard-coded into the language implementation as in previous probabilistic programming languages, inference metaprogramming enables developers to 1) dynamically decompose inference problems into subproblems, 2) apply inference tactics to subproblems, 3) alternate between incorporating new data and performing inference over existing data, and 4) explore multiple execution traces of the probabilistic program at once. Implemented tactics include gradient-based optimization, Markov chain Monte Carlo, variational inference, and sequental Monte Carlo techniques. Inference metaprogramming enables the concise expression of probabilistic models and inference algorithms across diverse fields, such as computer vision, data science, and robotics, within a single probabilistic programming language.

关键词： Probabilistic programming Semantics Inference

来源：评论

学校读者我要写书评

暂无评论

An optimizer for ada-design, experiences and results 88

An optimizer for ada-design, experiences and results

引用

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

作者： Schwarz, Birgit Kirchgiissner, Walter Landwehr, Rudolf GMD Forschungsstelle An der Universität Karlsruhe Haid-und-Neu-Str. 7 Karlsruhe 1D-7500 Germany

ISBN: (纸本)0897912691

In this paper we describe the design of a global machine independent low level optimizer for the Karlsruhe Ada Compiler. We give a short overview on the optimizations and data structures used in the optimizer as well as some experiences with the optimizer. Detailed measurements are prcl vided for a collection of benchmarks. The average improve ment of code speed is 40%. © 1988 acm.

关键词： Structural optimization

来源：评论

学校读者我要写书评

暂无评论

Data flow frequency analysis

Data flow frequency analysis

引用

acm sigplan 96 conference on programming language design and implementation

作者： Ramalingam, G IBM T.J. Watson Research Cent Yorktown Heights United States

Conventional dataflow analysis computes information about what facts may or will not hold during the execution of a program. Sometimes it is useful, for program optimization, to know how often or with what probability a fact holds true during program execution. In this paper, we provide a precise formulation of this problem for a large class of dataflow problems - the class of finite bi-distributive subset problems. We show how it can be reduced to a generalization of the standard dataflow analysis problem, one that requires a sum-over-all-paths quantity instead of the usual meet-overall-paths quantity. We show that Kildall's result expressing the meet-over-all-paths value as a maximal-fixed-point carries over to the generalized setting, We then outline ways to adapt the standard dataflow analysis algorithms to solve this generalized problem, both in the intraprocedural and the interprocedural case.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：