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

Proceedings of the 35th acm sigplan conference on programming language design and implementation

作者： Tony Hoare Microsoft Research Cambridge United Kingdom

ISBN: (纸本)9781450327848

the talk extends the Laws of programming [1] by four laws governing concurrent composition of programs. this operator is associative and commutative and distributive through union; and it has the same unit (do nothing) as sequential composition. Furthermore, sequential and concurrent composition distribute through each other, in accordance with an exchange law; this permits an implementation of concurrency by partial interleaving.

关键词： separation logic CCS verification concurrency

来源：评论

学校读者我要写书评

暂无评论

Æminium: a permission based concurrent-by-default programming language approach 14

Æminium: a permission based concurrent-by-default programmi...

引用

Proceedings of the 35th acm sigplan conference on programming language design and implementation

作者： Sven Stork Karl Naden Joshua Sunshine Manual Mohr Alcides Fonseca Paulo Marques Jonathan Aldrich Carnegie Mellon University Karlsruhe Institute of Technology University of Coimbra

ISBN: (纸本)9781450327848

the aim of ÆMINIUM is to study the implications of having a concurrent-by-default programming language. this includes language design, runtime system, performance and software engineering *** conduct our study through the design of the concurrent-by-default ÆMINIUM programming language. ÆMINIUM leverages the permission flow of object and group permissions through the program to validate the program's correctness and to automatically infer a possible parallelization strategy via a dataflow graph. ÆMINIUM supports not only fork-join parallelism but more general dataflow patterns of *** this paper we present a formal system, called μÆMINIUM, modeling the core concepts of ÆMINIUM. μÆMINIUM's static type system is based on Featherweight Java with ÆMINIUM-specific extensions. Besides checking for correctness ÆMINIUM's type system it also uses the permission flow to compute a potential parallel execution strategy for the program. μÆMINIUM's dynamic semantics use a concurrent-by-default evaluation approach. Along with the formal system we present its soundness *** provide a full description of the implementation along with the description of various optimization techniques we used. We implemented ÆMINIUM as an extension of the Plaid programming language, which has first-class support for permissions built-in. the ÆMINIUM implementation and all case studies are publicly available under the General Public *** use various case studies to evaluate ÆMINIUM's applicability and to demonstrate that ÆMINIUM parallelized code has performance improvements compared to its sequential counterpart. We chose to use case studies from common domains or problems that are known to benefit from parallelization, to show that ÆMINIUM is powerful enough to encode them. We demonstrate through a webserver application, which evaluates ÆMINIUM's impact on latency-bound applications, that ÆMINIUM can achieve a 70% performance improvement over the sequential counterp

关键词： concurrency access permissions permissions data groups

来源：评论

学校读者我要写书评

暂无评论

the Bedrock Structured programming System Combining Generative Metaprogramming and Hoare Logic in an Extensible Program Verifier

引用

acm sigplan NOTICES 2013年第9期48卷 391-402页

作者： Chlipala, Adam MIT CSAIL United States

We report on the design and implementation of an extensible programming language and its intrinsic support for formal verification. Our language is targeted at low-level programming of infrastructure like operating systems and runtime systems. It is based on a cross-platform core combining characteristics of assembly languages and compiler intermediate languages. From this foundation, we take literally the saying that C is a "macro assembly language": we introduce an expressive notion of certified low-level macros, sufficient to build up the usual features of C and beyond as macros with no special support in the core. Furthermore, our macros have integrated support for strongest postcondition calculation and verification condition generation, so that we can provide a high-productivity formal verification environment within Coq for programs composed from any combination of macros. Our macro interface is expressive enough to support features that low-level programs usually only access through external tools with no formal guarantees, such as declarative parsing or SQL-inspired querying. the abstraction level of these macros only imposes a compile-time cost, via the execution of functional Coq programs that compute programs in our intermediate language;but the run-time cost is not substantially greater than for more conventional C code. We describe our experiences constructing a full C-like language stack using macros, with some experiments on the verifiability and performance of individual programs running on that stack.

关键词： generative metaprogramming interactive proof assistants low-level programming languages functional programming

来源：评论

学校读者我要写书评

暂无评论

Terra: A Multi-Stage language for High-Performance Computing

Terra: A Multi-Stage Language for High-Performance Computing

引用

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

作者： DeVito, Zachary Hegarty, James Aiken, Alex Hanrahan, Pat Vitek, Jan Stanford Univ Stanford CA 94305 USA Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9781450320146

High-performance computing applications, such as auto-tuners and domain-specific languages, rely on generative programming techniques to achieve high performance and portability. However, these systems are often implemented in multiple disparate languages and perform code generation in a separate process from program execution, making certain optimizations difficult to engineer. We leverage a popular scripting language, Lua, to stage the execution of a novel low-level language, Terra. Users can implement optimizations in the high-level language, and use built-in constructs to generate and execute high-performance Terra code. To simplify meta-programming, Lua and Terra share the same lexical environment, but, to ensure performance, Terra code can execute independently of Lua's runtime. We evaluate our design by reimplementing existing multi-language systems entirely in Terra. Our Terra-based auto-tuner for BLAS routines performs within 20% of ATLAS, and our DSL for stencil computations runs 2.3x faster than hand-written C.

关键词： design Performance Lua Staged computation DSL

来源：评论

学校读者我要写书评

暂无评论

Quipper: A Scalable Quantum programming language

Quipper: A Scalable Quantum Programming Language

引用

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

作者： Green, Alexander S. Lumsdaine, Peter LeFanu Ross, Neil J. Selinger, Peter Valiron, Benoit Dalhousie Univ Halifax NS B3H 3J5 Canada Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781450320146

the field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higher-order quantum programming language. Quipper has been used to program a diverse set of non-trivial quantum algorithms, and can generate quantum gate representations using trillions of gates. It is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Quipper has proven effective and easy to use, and opens the door towards using formal methods to analyze quantum algorithms.

关键词： Quipper Quantum programming languages

来源：评论

学校读者我要写书评

暂无评论

Asynchronous Functional Reactive programming for GUIs

Asynchronous Functional Reactive Programming for GUIs

引用

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

作者： Czaplicki, Evan Chong, Stephen Harvard Univ Cambridge MA 02138 USA

ISBN: (纸本)9781450320146

Graphical user interfaces (GUIs) mediate many of our interactions with computers. Functional Reactive programming (FRP) is a promising approach to GUI design, providing high-level, declarative, compositional abstractions to describe user interactions and time-dependent computations. We present Elm, a practical FRP language focused on easy creation of responsive GUIs. Elm has two major features: simple declarative support for Asynchronous FRP;and purely functional graphical layout. Asynchronous FRP allows the programmer to specify when the global ordering of event processing can be violated, and thus enables efficient concurrent execution of FRP programs;long-running computation can be executed asynchronously and not adversely affect the responsiveness of the user interface. Layout in Elm is achieved using a purely functional declarative framework that makes it simple to create and combine text, images, and video into rich multimedia displays. Together, Elm's two major features simplify the complicated task of creating responsive and usable GUIs.

关键词： languages design Functional Reactive programming Graphical User Interfaces

来源：评论

学校读者我要写书评

暂无评论

Reconciling Exhaustive Pattern Matching with Objects

Reconciling Exhaustive Pattern Matching with Objects

引用

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

作者： Isradisaikul, Chinawat Myers, Andrew C. Cornell Univ Dept Comp Sci Ithaca NY 14853 USA

ISBN: (纸本)9781450320146

Pattern matching, an important feature of functional languages, is in conflict with data abstraction and extensibility, which are central to object-oriented languages. Modal abstraction offers an integration of deep pattern matching and convenient iteration abstractions into an object-oriented setting;however, because of data abstraction, it is challenging for a compiler to statically verify properties such as exhaustiveness. In this work, we extend modal abstraction in the JMatch language to support static, modular reasoning about exhaustiveness and redundancy. New matching specifications allow these properties to be checked using an SMT solver. We also introduce expressive pattern-matching constructs. Our evaluation shows that these new features enable more concise code and that the performance of checking exhaustiveness and redundancy is acceptable.

关键词： JMatch pattern matching named constructor equality constructor matching specification exhaustiveness redundancy modal abstraction Java data abstraction subtyping design Verification languages

来源：评论

学校读者我要写书评

暂无评论

Automated Feedback Generation for Introductory programming Assignments

Automated Feedback Generation for Introductory Programming A...

引用

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

作者： Singh, Rishabh Gulwani, Sumit Solar-Lezama, Armando MIT CSAIL Cambridge MA USA Microsoft Res Redmond WA USA

ISBN: (纸本)9781450320146

We present a new method for automatically providing feedback for introductory programming problems. In order to use this method, we need a reference implementation of the assignment, and an error model consisting of potential corrections to errors that students might make. Using this information, the system automatically derives minimal corrections to student's incorrect solutions, providing them with a measure of exactly how incorrect a given solution was, as well as feedback about what they did wrong. We introduce a simple language for describing error models in terms of correction rules, and formally define a rule-directed translation strategy that reduces the problem of finding minimal corrections in an incorrect program to the problem of synthesizing a correct program from a sketch. We have evaluated our system on thousands of real student attempts obtained from the Introduction to programming course at MIT (6.00) and MITx (6.00x). Our results show that relatively simple error models can correct on average 64% of all incorrect submissions in our benchmark set.

关键词： Automated Grading Computer-Aided Education Program Synthesis

来源：评论

学校读者我要写书评

暂无评论

CONCURRIT: A Domain Specific language for Reproducing Concurrency Bugs

CONCURRIT: A Domain Specific Language for Reproducing Concur...

引用

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

作者： Elmas, Tayfun Burnim, Jacob Necula, George Sen, Koushik Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

ISBN: (纸本)9781450320146

We present CONCURRIT, a domain-specific language (DSL) for reproducing concurrency bugs. Given some partial information about the nature of a bug in an application, a programmer can write a CONCURRIT script to formally and concisely specify a set of thread schedules to explore in order to find a schedule exhibiting the bug. Further, the programmer can specify how these thread schedules should be searched to find a schedule that reproduces the bug. We implemented CONCURRIT as an embedded DSL in C++, which uses manual or automatic source instrumentation to partially control the scheduling of the software under test. Using CONCURRIT, we were able to write concise tests to reproduce concurrency bugs in a variety of benchmarks, including the Mozilla's Spider-Monkey JavaScript engine, Memcached, Apache's HTTP server, and MySQL.

关键词： Concurrency Errors Domain-Specific languages Software Testing

来源：评论

学校读者我要写书评

暂无评论

P: Safe Asynchronous Event-Driven programming

P: Safe Asynchronous Event-Driven Programming

引用

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

作者： Desai, Ankush Gupta, Vivek Jackson, Ethan Qadeer, Shaz Rajamani, Sriram Zufferey, Damien Microsoft Corp Redmond WA 98052 USA

ISBN: (纸本)9781450320146

We describe the design and implementation of P, a domain-specific language to write asynchronous event driven code. P allows the programmer to specify the system as a collection of interacting state machines, which communicate with each other using events. P unifies modeling and programming into one activity for the programmer. Not only can a P program be compiled into executable code, but it can also be tested using model checking techniques. P allows the programmer to specify the environment, used to "close" the system during testing, as nondeterministic ghost machines. Ghost machines are erased during compilation to executable code;a type system ensures that the erasure is semantics preserving. the P language is designed so that a P program can be checked for responsiveness-the ability to handle every event in a timely manner. By default, a machine needs to handle every event that arrives in every state. But handling every event in every state is impractical. the language provides a notion of deferred events where the programmer can annotate when she wants to delay processing an event. the default safety checker looks for presence of unhandled events. the language also provides default liveness checks that an event cannot be potentially deferred forever. P was used to implement and verify the core of the USB device driver stack that ships with Microsoft Windows 8. the resulting driver is more reliable and performs better than its prior incarnation (which did not use P);we have more confidence in the robustness of its design due to the language abstractions and verification provided by P.

关键词： domain-specific language device driver event-driven programming state machine verification systematic testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：