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

35th acm sigplan conference on programming language design and implementation (pldi)

作者： Perelman, Daniel Gulwani, Sumit Grossman, Dan Provost, Peter Univ Washington Seattle WA 98195 USA Microsoft Corp Mountain View CA USA

ISBN: (纸本)9781450327848

programming-by-example technologies empower end-users to create simple programs merely by providing input/output examples. Existing systems are designed around solvers specialized for a specific set of data types or domain-specific language (DSL). We present a program synthesizer which can be parameterized by an arbitrary DSL that may contain conditionals and loops and therefore is able to synthesize programs in any domain. In order to use our synthesizer, the user provides a sequence of increasingly sophisticated input/output examples along with an expert-written DSL definition. These two inputs correspond to the two key ideas that allow our synthesizer to work in arbitrary domains. First, we developed a novel iterative synthesis technique inspired by test-driven development-which also gives our technique the name of test-driven synthesis-where the input/output examples are consumed one at a time as the program is refined. Second, the DSL allows our system to take an efficient component-based approach to enumerating possible programs. We present applications of our synthesis methodology to end-user programming for transformations over strings, XML, and table layouts. We compare our synthesizer on these applications to state-of-the-art DSL-specific synthesizers as well to the general purpose synthesizer Sketch.

关键词： languages Experimentation program synthesis end-user programming test driven development

来源：评论

学校读者我要写书评

暂无评论

Reticle: A Virtual Machine for programming Modern FPGAs 2021

Reticle: A Virtual Machine for Programming Modern FPGAs

引用

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

作者： Vega, Luis McMahan, Joseph Sampson, Adrian Grossman, Dan Ceze, Luis Univ Washington Seattle WA 98195 USA Cornell Univ Ithaca NY 14853 USA

ISBN: (纸本)9781450383912

Modern field-programmable gate arrays (FPGAs) have recently powered high-profile efficiency gains in systems from datacenters to embedded devices by offering ensembles of heterogeneous, reconfigurable hardware units. programming stacks for FPGAs, however, are stuck in the past-they are based on traditional hardware languages, which were appropriate when FPGAs were simple, homogeneous fabrics of basic programmable primitives. We describe Reticle, a new low-level abstraction for FPGA programming that, unlike existing languages, explicitly represents the special-purpose units available on a particular FPGA device. Reticle has two levels: a portable intermediate language and a target-specific assembly language. We show how to use a standard instruction selection approach to lower intermediate programs to assembly programs, which can be both faster and more effective than the complex metaheuristics that existing FPGA toolchains use. We use Reticle to implement linear algebra operators and coroutines and find that Reticle compilation runs up to 100 times faster than current approaches while producing comparable or better run-time and utilization.

关键词： compilers FPGAs

来源：评论

学校读者我要写书评

暂无评论

VESTA: Power Modeling with language Runtime Events

引用

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

作者： Raskind, Joseph Babakol, Timur Mahmoud, Khaled Liu, Yu David SUNY Binghamton Binghamton NY 13902 USA

Power modeling is an essential building block for computer systems in support of energy optimization, energy profiling, and energy-aware application development. We introduce VESTA, a novel approach to modeling the power consumption of applications with one key insight: language runtime events are often correlated with a sustained level of power consumption. When compared with the established approach of power modeling based on hardware performance counters (HPCs), VESTA has the benefit of solely requiring application-scoped information and enabling a higher level of explainability, while achieving comparable or even higher precision. Through experiments performed on 37 real-world applications on the Java Virtual Machine (JVM), we find the power model built by VESTA is capable of predicting energy consumption with a mean absolute percentage error of 1.56%, while the monitoring of language runtime events incurs small performance and energy overhead.

关键词： power modeling language runtimes Java virtual machines BPF

来源：评论

学校读者我要写书评

暂无评论

Thin locks: Featherweight synchronization for Java

Thin locks: Featherweight synchronization for Java

引用

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

作者： Bacon, David F. Konuru, Ravi Murthy, Chet Serrano, Mauricio IBM T.J. Watson Research Cent Yorktown Heights United States

language-supported synchronization is a source of serious performance problems in many Java programs. Even single-threaded applications may spend up to half their time performing useless synchronization due to the thread-safe nature of the Java libraries. We solve this performance problem with a new algorithm that allows lock and unlock operations to be performed with only a few machine instructions in the most common cases. Our locks only require a partial word per object, and were implemented without increasing object size. We present measurements from our implementation in the JDK 1.1.2 for AIX, demonstrating speedups of up to a factor of 5 in micro-benchmarks and up to a factor of 1.7 in real programs.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Demand-driven pointer analysis 01

Demand-driven pointer analysis

引用

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

作者： Heintze, N Tardieu, O Ecole Mines Paris France

ISBN: (纸本)9781581134148

Known algorithms for pointer analysis are "global" in the sense that-they perform an exhaustive analysis of a program or program component. In this paper we introduce a demand-driven approach for pointer analysis. Specifically, we describe a demand-driven flow-insensitive, subset-based, context-insensitive points-to analysis. Given a list of pointer variables (a query), our analysis performs just enough computation to determine the points-to sets for these query variables. Using deductive reachability formulations of both the exhaustive and the demand-driven analyses, we prove that our algorithm is correct. We also show that our analysis is optimal in the sense that it does not do more work than necessary. We illustrate the feasibility and efficiency of our analysis with an implementation of demand-driven points-to analysis for computing the call-graphs of C programs with function pointers. The performance of our system varies substantially across benchmarks - the main factor is how much of the points-to graph must be computed to determine the call-graph. For some benchmarks, only a small part of the points-to graph is needed (e.g povray, emacs and gee), and here we see more than a 10x speedup. For other benchmarks (e.g. burlap and gimp), we need to compute most (> 95%) of the points-to graph, and here the demand-driven algorithm is considerably slower, because using the demand-driven algorithm is a slow method of computing the full points-to graph.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Gillian, Part I: A Multi-language Platform for Symbolic Execution 2020

Gillian, Part I: A Multi-language Platform for Symbolic Exec...

引用

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

作者： Santos, Jose Fragoso Maksimovic, Petar Ayoun, Sacha-Elie Gardner, Philippa Univ Lisbon INESC ID Inst Super Tecn Lisbon Portugal Imperial Coll London London England

ISBN: (纸本)9781450376136

We introduce Gillian, a platform for developing symbolic analysis tools for programming languages. Here, we focus on the symbolic execution engine at the heart of Gillian, which is parametric on the memory model of the target language. We give a formal description of the symbolic analysis and a modular implementation that closely follows this description. We prove a parametric soundness result, introducing restriction on abstract states, which generalises path conditions used in classical symbolic execution. We instantiate Gillian to obtain trusted symbolic testing tools for JavaScript and C, and use these tools to find bugs in real-world code, thus demonstrating the viability of our parametric approach.

关键词： Symbolic execution parametric semantics bug-finding bounded verification JavaScript C

来源：评论

学校读者我要写书评

暂无评论

programming language design and implementation

Programming language design and implementation

引用

2008 acm sigplan conference on programming language design and implementation 2008, pldi'08

ISBN: (纸本)9781595938602

The proceedings contain 34 papers. The topics discussed include: checking race freedom via linear programming;race directed random testing on concurrent programs;Immix: a mark-region garbage collector with space efficiency, fast collection, and imitator performance;a study of concurrent real-time garbage collectors;conditional correlation analysis for safe region-based memory management;automatic volume management for programmable microfluidics;expressive and safe static reflection with MorphJ;a practical automatic polyhedral parallelizer and locality optimizer;orchestrating the execution of stream programs on multicore platforms;deriving linearizable fine-grained concurrent objects;sketching concurrent data structures;SharC: checking data sharing strategies for multithreaded C;and dataflow analysis for concurrent programs using datarace detection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mint: Java Multi-stage programming Using Weak Separability 10

Mint: Java Multi-stage Programming Using Weak Separability

引用

acm sigplan conference on programming language design and implementation

作者： Westbrook, Edwin Ricken, Mathias Inoue, Jun Yao, Yilong Abdelatif, Tamer Taha, Walid Rice Univ Houston TX 77251 USA

ISBN: (纸本)9781450300193

Multi-stage programming (MSP) provides a disciplined approach to run-time code generation. In the purely functional setting, it has been shown how MSP can be used to reduce the overhead of abstractions, allowing clean, maintainable code without paying performance penalties. Unfortunately, MSP is difficult to combine with imperative features, which are prevalent in mainstream languages. The central difficulty is scope extrusion, wherein free variables can inadvertently be moved outside the scopes of their binders. This paper proposes a new approach to combining MSP with imperative features that occupies a "sweet spot" in the design space in terms of how well useful MSP applications can be expressed and how easy it is for programmers to understand. The key insight is that escapes (or "anti-quotes") must be weakly separable from the rest of the code, i.e. the computational effects occurring inside an escape that are visible outside the escape are guaranteed to not contain code. To demonstrate the feasibility of this approach, we formalize a type system based on Lightweight Java which we prove sound, and we also provide an implementation, called Mint, to validate both the expressivity of the type system and the effect of staging on the performance of Java programs.

关键词： languages Multi-staged languages Multi-stage programming Type systems Java

来源：评论

学校读者我要写书评

暂无评论

It's alive! Continuous feedback in UI programming

It's alive! Continuous feedback in UI programming

引用

34th acm sigplan conference on programming language design and implementation, pldi 2013

作者： Burckhardt, Sebastian De Halleux, Peli Moskal, Michal Fähndrich, Manuel McDirmid, Sean Tillmann, Nikolai Kato, Jun Microsoft Research United States University of Tokyo Japan

ISBN: (纸本)9781450320146

Live programming allows programmers to edit the code of a running program and immediately see the effect of the code changes. This tightening of the traditional edit-compile-run cycle reduces the cognitive gap between program code and execution, improving the learning experience of beginning programmers while boosting the productivity of seasoned ones. Unfortunately, live programming is difficult to realize in practice as imperative languages lack well-defined abstraction boundaries that make live programming responsive or its feedback comprehensible. This paper enables live programming for user interface programming by cleanly separating the rendering and non-rendering aspects of a UI program, allowing the display to be refreshed on a code change without restarting the program. A type and effect system formalizes this separation and provides an evaluation model that incorporates the code update step. By putting live programming on a more formal footing, we hope to enable critical and technical discussion of live programming systems. Copyright © 2013 acm.

关键词： Graphical user interfaces

来源：评论

学校读者我要写书评

暂无评论

Persistency for Synchronization-Free Regions 2018

Persistency for Synchronization-Free Regions

引用

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

作者： Gogte, Vaibhav Diestelhorst, Stephan Wang, William Narayanasamy, Satish Chen, Peter M. Wenisch, Thomas F. Univ Michigan Ann Arbor MI 48109 USA Arm Res Cambridge England

ISBN: (纸本)9781450356985

Nascent persistent memory (PM) technologies promise the performance of DRAM with the durability of disk, but how best to integrate them into programming systems remains an open question. Recent work extends language memory models with a persistency model prescribing semantics for updates to PM. These semantics enable programmers to design data structures in PM that are accessed like memory and yet are recoverable upon crash or failure. Alas, we find the semantics and performance of existing approaches unsatisfying. Existing approaches require high-overhead mechanisms, are restricted to certain synchronization constructs, provide incomplete semantics, and/or may recover to state that cannot arise in fault-free execution. We propose persistency semantics that guarantee failure atomicity of synchronization-free regions (SFRs) -program regions delimited by synchronization operations. Our approach provides clear semantics for the PM state recovery code may observe and extends C++11's "sequential consistency for data-race-free" guarantee to post-failure recovery code. We investigate two designs for failure-atomic SFRs that vary in performance and the degree to which commit of persistent state may lag execution. We demonstrate both approaches in LLVM v3.6.0 and compare to a state-of-the-art baseline to show performance improvement up to 87.5% (65.5% avg).

关键词： Persistent memories persistency models language memory models failure-atomicity synchronization-free regions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：