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

43rd acm sigplan International conference on programming language design and implementation (PLDI)

作者： Dong, Rui Huang, Zhicheng Lam, Ian Iong Chen, Yan Wang, Xinyu Univ Michigan Ann Arbor MI 48109 USA Univ Toronto Toronto ON Canada

ISBN: (纸本)9781450392655

It is imperative to democratize robotic process automation (RPA), as RPA has become a main driver of the digital transformation but is still technically very demanding to construct, especially for non-experts. In this paper, we study how to automate an important class of RPA tasks, dubbed web RPA, which are concerned with constructing software bots that automate interactions across data and a web browser. Our main contributions are twofold. First, we develop a formal foundation which allows semantically reasoning about web RPA programs and formulate its synthesis problem in a principled manner. Second, we propose a web RPA program synthesis algorithm based on a new idea called speculative rewriting. This leads to a novel speculate-and-validate methodology in the context of rewrite-based program synthesis, which has also shown to be both theoretically simple and practically efficient for synthesizing programs from demonstrations. We have built these ideas in a new interactive synthesizer called WEBROBOT and evaluate it on 76 web RPA benchmarks. Our results show that WEBROBOT automated a majority of them effectively. Furthermore, we show that WEBROBOT compares favorably with a conventional rewrite-based synthesis baseline implemented using egg. Finally, we conduct a small user study demonstrating WEBROBOT is also usable.

关键词： Program Synthesis programming by Demonstration Rewrite-based Synthesis Robotic Process Automation Web Automation Human-in-the-loop

来源：评论

学校读者我要写书评

暂无评论

Allo: A programming Model for Composable Accelerator design

引用

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

作者： Chen, Hongzheng Zhang, Niansong Xiang, Shaojie Zeng, Zhichen Dai, Mengjia Zhang, Zhiru Cornell Univ Ithaca NY 14853 USA Univ Sci & Technol China Hefei Peoples R China

Special-purpose hardware accelerators are increasingly pivotal for sustaining performance improvements in emerging applications, especially as the benefits of technology scaling continue to diminish. However, designers currently lack effective tools and methodologies to construct complex, high-performance accelerator architectures in a productive manner. Existing high-level synthesis (HLS) tools often require intrusive source-level changes to attain satisfactory quality of results. Despite the introduction of several new accelerator design languages (ADLs) aiming to enhance or replace HLS, their advantages are more evident in relatively simple applications with a single kernel. Existing ADLs prove less effective for realistic hierarchical designs with multiple kernels, even if the design hierarchy is flattened. In this paper, we introduce Allo, a composable programming model for efficient spatial accelerator design. Allo decouples hardware customizations, including compute, memory, communication, and data type from algorithm specification, and encapsulates them as a set of customization primitives. Allo preserves the hierarchical structure of an input program by combining customizations from different functions in a bottom-up, type-safe manner. This approach facilitates holistic optimizations that span across function boundaries. We conduct comprehensive experiments on commonly-used HLS benchmarks and several realistic deep learning models. Our evaluation shows that Allo can outperform state-of-the-art HLS tools and ADLs on all test cases in the PolyBench. For the GPT2 model, the inference latency of the Allo generated accelerator is 1.7x faster than the NVIDIA A100 GPU with 5.4x higher energy efficiency, demonstrating the capability of Allo to handle large-scale designs.

关键词： Hardware accelerators schedule language accelerator design language compiler optimization

来源：评论

学校读者我要写书评

暂无评论

Filling Typed Holes with Live GUIs 2021

Filling Typed Holes with Live GUIs

引用

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

作者： Omar, Cyrus Moon, David Blinn, Andrew Voysey, Ian Collins, Nick Chugh, Ravi Univ Michigan Ann Arbor MI 48109 USA Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ Chicago Chicago IL 60637 USA

ISBN: (纸本)9781450383912

Text editing is powerful, but some types of expressions are more naturally represented and manipulated graphically. Examples include expressions that compute colors, music, animations, tabular data, plots, diagrams, and other domain-specific data structures. This paper introduces live literals, or livelits, which allow clients to fill holes of types like these by directly manipulating a user-defined GUI embedded persistently into code. Uniquely, livelits are compositional: a livelit GUI can itself embed spliced expressions, which are typed, lexically scoped, and can in turn embed other livelits. Livelits are also uniquely live: a livelit can provide continuous feedback about the run-time implications of the client's choices even when splices mention bound variables, because the system continuously gathers closures associated with the hole that the livelit is filling. We integrate livelits into Hazel, a live hole-driven programming environment, and describe case studies that exercise these novel capabilities. We then define a simply typed livelit calculus, which specifies how livelits operate as live graphical macros. The metatheory of macro expansion has been mechanized in Agda.

关键词： live programming macros typed holes GUIs

来源：评论

学校读者我要写书评

暂无评论

Shared memory programming for large scale machines 06

Shared memory programming for large scale machines

引用

PLDI 2006 - 2006 acm sigplan conference on programming language design and implementation

作者： Barton, Christopher Caşcaval, CǍlin Almási, George Zheng, Yili Farreras, Montse Chatterjee, Siddhartha Amaral, José Nelson Department of Computing Science University of Alberta Edmonton Canada School of Electrical and Computer Engineering Purdue University West Lafayette IN IBM T.J. Watson Researcn Center Yorktown Heights NY 10598 Department of Computer Architecture Universitat Politecnica de Catalunya Barcelona Spain

ISBN: (纸本)1595933204

This paper describes the design and implementation of a scalable run-time system and an optimizing compiler for Unified Parallel C (UPC). An experimental evaluation on BlueGene/L®, a distributed-memory machine, demonstrates that the combination of the compiler with the runtime system produces programs with performance comparable to that of efficient MPI programs and good performance scalability up to hundreds of thousands of processors. Our runtime system design solves the problem of maintaining shared object consistency efficiently in a distributed memory machine. Our compiler infrastructure simplifies the code generated for parallel loops in UPC through the elimination of affinity tests, eliminates several levels of indirection for accesses to segments of shared arrays that the compiler can prove to be local, and implements remote update operations through a lower-cost asynchronous message. The performance evaluation uses three well-known benchmarks - HPC RandomAccess, HPC STREAM and NAS CG - to obtain scaling and absolute performance numbers for these benchmarks on up to 131072 processors, the full BlueGene/L machine. These results were used to win the HPC Challenge Competition at SC05 in Seattle WA, demonstrating that PGAS languages support both productivity and performance. Copyright © 2006 acm.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Term Rewriting with Variable Binding: An Initial Algebra Approach

Term Rewriting with Variable Binding: An Initial Algebra App...

引用

Fifth acm sigplan conference on Principle and Practice of Declarative programming

作者： Hamana, Makoto Department of Computer Science Gunma University Japan

ISBN: (纸本)1581137052

We present an extension of first-order term rewriting systems, which involves variable binding in the term language. We develop the systems called binding term rewriting systems (BTRSs) in a stepwise manner;firstly we present the term language, then formulate equational logic, and finally define rewrite systems by two styles: rewrite logic and pattern matching styles. The novelty of this development is that we follow an initial algebra approach in an extended notion of σ-algebras in various functor categories. These are based on Fiore-Plotkin-Turi's presheaf semantics of variable binding and Lüth-Ghani's monadic semantics of term rewriting systems. We characterise the terms, equational logic and rewrite systems for BTRSs are initial algebras in suitable categories. Finally, we discuss our design choice of BTRSs from a semantic perspective.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

End-to-End Verification of Information-Flow Security for C and Assembly Programs 16

End-to-End Verification of Information-Flow Security for C a...

引用

37th acm sigplan conference on programming language design and implementation

作者： Costanzo, David Shao, Zhong Gu, Ronghui Yale Univ New Haven CT 06520 USA

ISBN: (纸本)9781450342612

Protecting the confidentiality of information manipulated by a computing system is one of the most important challenges facing today's cybersecurity community. A promising step toward conquering this challenge is to formally verify that the end-to-end behavior of the computing system really satisfies various information-flow policies. Unfortunately, because today's system software still consists of both C and assembly programs, the end-to-end verification necessarily requires that we not only prove the security properties of individual components, but also carefully preserve these properties through compilation and cross-language linking. In this paper, we present a novel methodology for formally verifying end-to-end security of a software system that consists of both C and assembly programs. We introduce a general definition of observation function that unifies the concepts of policy specification, state indistinguishability, and whole-execution behaviors. We show how to use different observation functions for different levels of abstraction, and how to link different security proofs across abstraction levels using a special kind of simulation that is guaranteed to preserve state indistinguishability. To demonstrate the effectiveness of our new methodology, we have successfully constructed an end-to-end security proof, fully formalized in the Coq proof assistant, of a nontrivial operating system kernel (running on an extended CompCert x86 assembly machine model). Some parts of the kernel are written in C and some are written in assembly;we verify all of the code, regardless of language.

关键词： Verification Security Reliability languages design Information Flow Control Security Policy Specification Security-Preserving Simulation Program Verification Certified OS Kernels

来源：评论

学校读者我要写书评

暂无评论

Gleipnir: Toward Practical Error Analysis for Quantum Programs 2021

Gleipnir: Toward Practical Error Analysis for Quantum Progra...

引用

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

作者： Tao, Runzhou Shi, Yunong Yao, Jianan Hui, John Chong, Frederic T. Gu, Ronghui Columbia Univ New York NY 10027 USA Univ Chicago Chicago IL 60637 USA Amazon New York NY USA Supertech Chicago IL USA Quantum Circuits Inc Chicago IL USA

ISBN: (纸本)9781450383912

Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs is a grand challenge, because the effects of quantum errors depend on exponentially large quantum states. In this work, we present Gleipnir, a novel methodology toward practically computing verified error bounds in quantum programs. Gleipnir introduces the ((rho) over cap,delta)-diamond norm, an error metric constrained by a quantum predicate consisting of the approximate state (rho) over cap and its distance d to the ideal state rho?. This predicate ((rho) over cap,delta) can be computed adaptively using tensor networks based on the Matrix Product States. Gleipnir features a lightweight logic for reasoning about error bounds in noisy quantum programs, based on the ((rho) over cap,delta)-diamond norm metric. Our experimental results show that Gleipnir is able to efficiently generate tight error bounds for real-world quantum programs with 10 to 100 qubits, and can be used to evaluate the error mitigation performance of quantum compiler transformations.

关键词： quantum programming error analysis approximate computing

来源：评论

学校读者我要写书评

暂无评论

programming Support for Autonomizing Software 2019

Programming Support for Autonomizing Software

引用

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

作者： Lee, Wen-Chuan Liu, Peng Liu, Yingqi Ma, Shiqing Zhang, Xiangyu Purdue Univ W Lafayette IN 47907 USA IBM Res San Jose CA USA

ISBN: (纸本)9781450367127

Most traditional software systems are not built with the artificial intelligence support (AI) in mind. Among them, some may require human interventions to operate, e.g., the manual specification of the parameters in the data processing programs, or otherwise, would behave poorly. We propose a novel framework called Autonomizer to autonomize these systems by installing the AI into the traditional programs. Autonomizer is general so it can be applied to many real-world applications. We provide the primitives and the runtime support, where the primitives abstract common tasks of autonomization and the runtime support realizes them transparently. With the support of Autonomizer, the users can gain the AI support with little engineering efforts. Like many other AI applications, the challenge lies in the feature selection, which we address by proposing multiple automated strategies based on the program analysis. Our experiment results on nine real-world applications show that the autonomization only requires adding a few lines to the source code. Besides, for the data-processing programs, Autonomizer improves the output quality by 161% on average over the default settings. For the interactive programs such as game/driving, Autonomizer achieves higher success rate with lower training time than existing autonomized programs.

关键词： AI Deep Learning Software Autonomization Dynamic Program Analysis

来源：评论

学校读者我要写书评

暂无评论

Evaluating Iterative Optimization Across 1000 Data Sets 10

Evaluating Iterative Optimization Across 1000 Data Sets

引用

acm sigplan conference on programming language design and implementation

作者： Chen, Yang Huang, Yuanjie Eeckhout, Lieven Fursin, Grigori Peng, Liang Temam, Olivier Wu, Chengyong Chinese Acad Sci ICT LCSA Key Lab Comp Syst & Architecture Beijing Peoples R China Chinese Acad Sci Grad Sch Beijing Peoples R China INRIA Saclay France Univ Ghent Ghent Belgium

ISBN: (纸本)9781450300193

While iterative optimization has become a popular compiler optimization approach, it is based on a premise which has never been truly evaluated: that it is possible to learn the best compiler optimizations across data sets. Up to now, most iterative optimization studies find the best optimizations through repeated runs on the same data set. Only a handful of studies have attempted to exercise iterative optimization on a few tens of data sets. In this paper, we truly put iterative compilation to the test for the first time by evaluating its effectiveness across a large number of data sets. We therefore compose KDataSets, a data set suite with 1000 data sets for 32 programs, which we release to the public. We characterize the diversity of KDataSets, and subsequently use it to evaluate iterative optimization. We demonstrate that it is possible to derive a robust iterative optimization strategy across data sets: for all 32 programs, we find that there exists at least one combination of compiler optimizations that achieves 86% or more of the best possible speedup across all data sets using Intel's ICC (83% for GNU's GCC). This optimal combination is program-specific and yields speedups up to 1.71 on ICC and 2.23 on GCC over the highest optimization level (-fast and -03, respectively). This finding makes the task of optimizing programs across data sets much easier than previously anticipated, and it paves the way for the practical and reliable usage of iterative optimization. Finally, we derive pre-shipping and post-shipping optimization strategies for software vendors.

关键词： design Experimentation Measurement Performance

来源：评论

学校读者我要写书评

暂无评论

Efficiently compiling a functional language on AMD64: The HiPE experience 05

Efficiently compiling a functional language on AMD64: The Hi...

引用

PPDP'05 - 7th acm sigplan conference on Principles and Practice of Declarative programming

作者： Luna, Daniel Pettersson, Mikael Sagonas, Konstantinos Department of Information Technology Uppsala University Sweden

ISBN: (纸本)1595930906

We describe and document our experience from developing an AMD64 backend for the HiPE (High Performance Erlang) native code compiler. We consider implementation alternatives and critically examine design choices for obtaining an efficient AMD64 backend. In particular, we consider in detail how other functional language implementors can migrate their existing x86 backends to the AMD64 architecture, a platform which is becoming increasingly important these days. We mention backend components that can be shared between x86 and AMD64, and those that better be different for achieving high performance on AMD64. Finally, we measure the performance of several different alternatives in the hope that this information can save development effort for others who intend to engage in a similar feat. Copyright 2005 acm.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：