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

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

作者： Bourgeat, Thomas Pit-Claudel, Clement Chlipala, Adam Arvind MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781450376136

The Bluespec hardware-description language presents a significantly higher-level view than hardware engineers are used to, exposing a simpler concurrency model that promotes formal proof, without compromising on performance of compiled circuits. Unfortunately, the cost model of Bluespec has been unclear, with performance details depending on a mix of user hints and opaque static analysis of potential concurrency conflicts within a design. In this paper we present Koika, a derivative of Bluespec that preserves its desirable properties and yet gives direct control over the scheduling decisions that determine performance. Koika has a novel and deterministic operational semantics that uses dynamic analysis to avoid concurrency anomalies. Our implementation includes Coq definitions of syntax, semantics, key metatheorems, and a verified compiler to circuits. We argue that most of the extra circuitry required for dynamic analysis can be eliminated by compile-time BSV-style static analysis.

关键词： HDL Semantics Compiler Correctness

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Asynchronous exceptions in Haskell 01

Asynchronous exceptions in Haskell

引用

acm sigplan'01 conference on programming language design and implementation (PLDI)

作者： Marlow, S. Peyton Jones, S. Moran, A. Reppy, J. Microsoft Research Cambridge MA United States

ISBN: (纸本)9781581134148

Asynchronous exceptions, such as timeouts, are important for robust, modular programs, but are extremely difficult to program with - so much so that most programming languages either heavily restrict them or ban them altogether. We extend our earlier work, in which we added synchronous exceptions to Haskell, to support asynchronous exceptions too. Our design introduces scoped combinators for blocking and unblocking asynchronous interrupts, along with a somewhat surprising semantics for operations that can suspend. Uniquely, we also give a formal semantics for our system.

关键词： Modula (programming language)

来源：评论

学校读者我要写书评

暂无评论

Temporal NetKAT 16

Temporal NetKAT

引用

37th acm sigplan conference on programming language design and implementation

作者： Beckett, Ryan Greenberg, Michael Walker, David Princeton Univ Princeton NJ 08544 USA Pomona Coll Claremont CA 91711 USA

ISBN: (纸本)9781450342612

Over the past 5-10 years, the rise of software-defined networking (SDN) has inspired a wide range of new systems, libraries, hypervisors and languages for programming, monitoring, and debugging network behavior. Oftentimes, these systems are disjoint-one language for programming and another for verification, and yet another for run-time monitoring and debugging. In this paper, we present a new, unified framework, called Temporal NetKAT, capable of facilitating all of these tasks at once. As its name suggests, Temporal NetKAT is the synthesis of two formal theories: past-time (finite trace) linear temporal logic and (network) Kleene Algebra with Tests. Temporal predicates allow programmers to write down concise properties of a packet's path through the network and to make dynamic packet-forwarding, access control or debugging decisions on that basis. In addition to being useful for programming, the combined equational theory of LTL and NetKAT facilitates proofs of pathbased correctness properties. Using new, general, proof techniques, we show that the equational semantics is sound with respect to the denotational semantics, and, for a class of programs we call network-wide programs, complete. We have also implemented a compiler for temporal NetKAT, evaluated its performance on a range of benchmarks, and studied the effectiveness of several optimizations.

关键词： Software-defined networking Network programming languages Domain-specific languages Kleene algebra with tests NetKAT Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Generational stack collection and profile-driven pretenuring

Generational stack collection and profile-driven pretenuring

引用

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

作者： Cheng, Perry Harper, Robert Lee, Peter Carnegie Mellon Univ Pittsburgh United States

Two techniques for improving garbage collection were presented, namely, generational stack collection and profile-driven pretenuring. The first is applicable to stack based implementations of functional languages while the second is useful for any generational collector. Both techniques were implemented in a generational collector used by the TIL compiler and have observed decreases in garbage collection times of as much as 70% and 30%, respectively.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

The design of a virtual machine for Ada 80

The design of a virtual machine for Ada

引用

1980 acm-sigplan Symposium on Ada programming language, sigplan 1980

作者： Groves, L.J. Rogers, W.J. University of Waikato Hamilton New Zealand

ISBN: (纸本)0897910303

An implementation of Ada should be based on a machine-independent translater generating code for a Virtual Machine, which can be realised on a variety of machines. This approach, which leads to a high degree of compiler portability, has been very successful in a number of recent language implementation projects and is the approach which has been specified by the U.S. Army and Air Force in their requirements for Ada implementations. This paper discusses the rationale, requirements and design of such a Virtual Machine for Ada. The discussion concentrates on a number of fundamental areas in which problems arise: basic Virtual Machine structure, including Storage structure and addressing;data Storage and manipulation;flow of control;subprograms, blocks and exceptions;and task handling. © proceedings of the 1980 acm conference on LISP and Functional programming, LFP 1980. All rights reserved.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Defining the Undefinedness of C 15

Defining the Undefinedness of C

引用

36th acm sigplan conference on programming language design and implementation

作者： Hathhorn, Chris Ellison, Chucky Rosu, Grigore Univ Missouri Columbia MO 65211 USA Univ Illinois Urbana IL 61801 USA

ISBN: (纸本)9781450334686

We present a "negative" semantics of the C11 language-a semantics that does not just give meaning to correct programs, but also rejects undefined programs. We investigate undefined behavior in C and discuss the techniques and special considerations needed for formally specifying it. We have used these techniques to modify and extend a semantics of C into one that captures undefined behavior. The amount of semantic infrastructure and effort required to achieve this was unexpectedly high, in the end nearly doubling the size of the original semantics. From our semantics, we have automatically extracted an undefinedness checker, which we evaluate against other popular analysis tools, using our own test suite in addition to a third-party test suite. Our checker is capable of detecting examples of all 77 categories of core language undefinedness appearing in the C11 standard, more than any other tool we considered. Based on this evaluation, we argue that our work is the most comprehensive and complete semantic treatment of undefined behavior in C, and thus of the C language itself.

关键词： Undefined behavior programming language semantics C11 K Framework

来源：评论

学校读者我要写书评

暂无评论

The design and implementation of Typed Scheme

The Design and Implementation of Typed Scheme

引用

35th acm-sigplan-SIGACT Symposium on Principles of programming languages

作者： Tobin-Hochstadt, Sam Felleisen, Matthias Northeastern Univ PLT Boston MA 02115 USA

ISBN: (纸本)9781595936899

When scripts in untyped languages grow into large programs, maintaining them becomes difficult. A lack of types in typical scripting languages means that programmers must (re)discover critical pieces of design information every time they wish to change a program. This analysis step both slows down the maintenance process and may even introduce mistakes due to the violation of undiscovered invariants. This paper presents Typed Scheme, an explicitly typed extension of an untyped scripting language. Its type system is based on the novel notion of occurrence typing, which we formalize and mechanically prove sound. The implementation of Typed Scheme additionally borrows elements from a range of approaches, including recursive types, true unions and subtyping, plus polymorphism combined with a modicum of local inference. Initial experiments with the implementation suggest that Typed Scheme naturally accommodates the programming style of the underlying scripting language, at least for the first few thousand lines of ported code. © 2008 acm.

关键词： Type Systems Scheme

来源：评论

学校读者我要写书评

暂无评论

Effective sign extension elimination 02

Effective sign extension elimination

引用

conference on programming language design and implementation (PLDI 02)

作者： Kawahito, M Komatsu, H Nakatani, T IBM Tokyo Res Lab Kanagawa 2428502 Japan

ISBN: (纸本)9781581134636

Computer designs are shifting from 32-bit architectures to 64-bit architectures, while most of the programs available today are still designed for 32-bit architectures, Java(TM), for example, specifies the frequently used "int" as a 32-bit data type. If such Java programs are executed on a 64-bit architecture, many 32-bit values must be sign-extended to 64-bit values for integer operations. This causes serious performance overhead. In this paper, we present a fast and effective algorithm for eliminating sign extensions. We implemented this algorithm in the IBM Java Just-in-Time (JIT) compiler for IA-64(TM). Our experimental results show that our algorithm effectively eliminates the majority of sign extensions, They also show that it significantly improves performance, while it increases JIT compilation time by only 0.11%. We implemented our algorithm for programs in Java, but it can be applied to any language requiring sign extensions.

关键词： algorithms performance design experimentation sign extension 64-bit architectures Java JIT compilers IA-64

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：