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

2013 acm sigplan International conference on Object Oriented programming Systems languages

作者： Politz, Joe Gibbs Martinez, Alejandro Milano, Matthew Warren, Sumner Patterson, Daniel Li, Junsong Chitipothu, Anand Krishnamurthi, Shriram

ISBN: (纸本)9781450323741

We present a small-step operational semantics for the Python programming language. We present both a core language for Python, suitable for tools and proofs, and a translation process for converting Python source to this core. We have tested the composition of translation and evaluation of the core for conformance with the primary Python implementation, thereby giving confidence in the fidelity of the semantics. We briefly report on the engineering of these components. Finally, we examine subtle aspects of the language, identifying scope as a pervasive concern that even impacts features that might be considered orthogonal.

关键词： serpents

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the acm sigplan Workshop on Memory Systems Performance and Correctness, MSPC 2013

Proceedings of the ACM SIGPLAN Workshop on Memory Systems Pe...

引用

acm sigplan Workshop on Memory Systems Performance and Correctness, MSPC 2013, co-located with the 34th annual acm sigplan conference on programming language design and implementation, PLDI

ISBN: (纸本)9781450321037

The proceedings contain 12 papers. The topics discussed include: APE: accelerator processor extensions to optimize data-compute co-location;a study of data structures with a deep heap shape;introducing kernel-level page reuse for high performance computing;a low overhead method for recovering unused memory inside regions;software-controlled transparent management of heterogeneous memory resources in virtualized systems;program-centric cost models for locality;a new perspective on processing-in-memory architecture design;a coldness metric for cache optimization;all-window data liveness;software-level scheduling to exploit non-uniformly shared data cache on GPGPU;cache rationing for multicore;and analyzing locality of memory references in GPU architectures.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

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)

作者： Burckhardt, Sebastian Faehndrich, Manuel de Halleux, Peli McDirmid, Sean Moskal, Michal Tillmann, Nikolai Kato, Jun Univ Tokyo Tokyo 1138654 Japan

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.

关键词： languages Human Factors Live programming Graphical User Interface

来源：评论

学校读者我要写书评

暂无评论

Deadlock-freedom-by-design: Multiparty Asynchronous Global programming

Deadlock-freedom-by-design: Multiparty Asynchronous Global P...

引用

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

作者： Carbone, Marco Montesi, Fabrizio IT Univ Copenhagen Copenhagen Denmark

ISBN: (纸本)9781450318327

Over the last decade, global descriptions have been successfully employed for the verification and implementation of communicating systems, respectively as protocol specifications and choreographies. In this work, we bring these two practices together by proposing a purely-global programming model. We show a novel interpretation of asynchrony and parallelism in a global setting and develop a typing discipline that verifies choreographies against protocol specifications, based on multiparty sessions. Exploiting the nature of global descriptions, our type system defines a new class of deadlock-free concurrent systems (deadlock-freedom-by-design), provides type inference, and supports session mobility. We give a notion of Endpoint Projection (EPP) which generates correct entity code (as pi-calculus terms) from a choreography. Finally, we evaluate our approach by providing a prototype implementation for a concrete programming language and by applying it to some examples from multicore and service-oriented programming.

关键词： design languages Theory Concurrency Choreography Types Sessions

来源：评论

学校读者我要写书评

暂无评论

Option Contracts

引用

acm sigplan NOTICES 2013年第10期48卷 475-494页

作者： Dimoulas, Christos Findler, Robert Bruce Felleisen, Matthias Harvard Univ Cambridge MA 02138 USA Northwestern Univ Evanston IL 60208 USA Northeastern Univ Boston MA USA

Many languages support behavioral software contracts so that programmers can describe a component's obligations and promises via logical assertions in its interface. The contract system monitors program execution, checks whether the assertions hold, and, if not, blames the guilty component. Pinning down the violator gets the debugging process started in the right direction. Quality contracts impose a serious runtime cost, however, and programmers therefore compromise in many ways. Some turn off contracts for deployment, but then contracts and code quickly get out of sync during maintenance. Others test contracts randomly or probabilistically. In all cases, programmers have to cope with lack of blame information when the program eventually fails. In response, we propose option contracts as an addition to the contract tool box. Our key insight is that in ordinary contract systems, server components impose their contract on client components, giving them no choice whether to trust the server's promises or check them. With option contracts, server components may choose to tag a contract as an option and clients may choose to exercise the option or accept it, in which case they also shoulder some responsibility. We show that option contracts permit programmers to specify flexible checking policies, that their cost is reasonable, and that they satisfy a complete monitoring theorem.

关键词： programming language design behavioral software contracts random testing probabilistic spot checking

来源：评论

学校读者我要写书评

暂无评论

SPL^LIFT - Statically Analyzing Software Product Lines in Minutes Instead of Years 13

SPL<SUP>LIFT</SUP> - Statically Analyzing Software Product L...

引用

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

作者： Bodden, Eric Toledo, Tarsis Ribeiro, Marcio Brabrand, Claus Borba, Paulo Mezini, Mira Tech Univ Darmstadt EC SPRIDE Darmstadt Germany IT Univ Copenhagen Copenhagen Denmark Univ Fed Pernambuco Recife PE Brazil Univ Fed Alagoas Maceio Brazil

ISBN: (纸本)9781450320146

A software product line (SPL) encodes a potentially large variety of software products as variants of some common code base. Up until now, re-using traditional static analyses for SPLs was virtually intractable, as it required programmers to generate and analyze all products individually. In this work, however, we show how an important class of existing inter-procedural static analyses can be transparently lifted to SPLs. Without requiring programmers to change a single line of code, our approach SPLLIFT automatically converts any analysis formulated for traditional programs within the popular IFDS framework for inter-procedural, finite, distributive, subset problems to an SPL-aware analysis formulated in the IDE framework, a well-known extension to IFDS. Using a full implementation based on Heros, Soot, CIDE and JavaBDD, we show that with SPLLIFT one can reuse IFDS-based analyses without changing a single line of code. Through experiments using three static analyses applied to four Java-based product lines, we were able to show that our approach produces correct results and outperforms the traditional approach by several orders of magnitude.

关键词： Software product lines inter-procedural static analysis context sensitive flow sensitive design languages Performance

来源：评论

学校读者我要写书评

暂无评论

CLAP: Recording Local Executions to Reproduce Concurrency Failures

CLAP: Recording Local Executions to Reproduce Concurrency Fa...

引用

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

作者： Huang, Jeff Zhang, Charles Dolby, Julian Hong Kong Univ Sci & Technol Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781450320146

We present CLAP, a new technique to reproduce concurrency bugs. CLAP has two key steps. First, it logs thread local execution paths at runtime. Second, offline, it computes memory dependencies that accord with the logged execution and are able to reproduce the observed bug. The second step works by combining constraints from the thread paths and constraints based on a memory model, and computing an execution with a constraint solver. CLAP has four major advantages. First, logging purely local execution of each thread is substantially cheaper than logging memory interactions, which enables CLAP to be efficient compared to previous approaches. Second, our logging does not require any synchronization and hence with no added memory barriers or fences;this minimizes perturbation and missed bugs due to extra synchronizations foreclosing certain racy behaviors. Third, since it uses no synchronization, we extend CLAP to work on a range of relaxed memory models, such as TSO and PSO, in addition to sequential consistency. Fourth, CLAP can compute a much simpler execution than the original one, that reveals the bug with minimal thread context switches. To mitigate the scalability issues, we also present an approach to parallelize constraint solving, which theoretically scales our technique to programs with arbitrary execution length. Experimental results on a variety of multithreaded benchmarks and real world concurrent applications validate these advantages by showing that our technique is effective in reproducing concurrency bugs even under relaxed memory models;furthermore, it is significantly more efficient than a state-of-the-art technique that records shared memory dependencies, reducing execution time overhead by 45% and log size by 88% on average.

关键词： Algorithms design Performance Theory Concurrency Bug Reproduction Local Execution Constraint Solving

来源：评论

学校读者我要写书评

暂无评论

System FC with Explicit Kind Equality 13

System FC with Explicit Kind Equality

引用

18th acm sigplan International conference on Functional programming

作者： Weirich, Stephanie Hsu, Justin Eisenberg, Richard A. Univ Penn Dept Comp & Informat Sci Philadelphia PA 19104 USA

ISBN: (纸本)9781450323260

System FC, the core language of the Glasgow Haskell Compiler, is an explicitly-typed variant of System F with first-class type equality proofs called coercions. This extensible proof system forms the foundation for type system extensions such as type families (type-level functions) and Generalized Algebraic Datatypes (GADTs). Such features, in conjunction with kind polymorphism and datatype promotion, support expressive compile-time reasoning. However, the core language lacks explicit kind equality proofs. As a result, type-level computation does not have access to kind-level functions or promoted GADTs, the type-level analogues to expression-level features that have been so useful. In this paper, we eliminate such discrepancies by introducing kind equalities to System FC. Our approach is based on dependent type systems with heterogeneous equality and the "Type-in-Type" axiom, yet it preserves the metatheoretic properties of FC. In particular, type checking is simple, decidable and syntax directed. We prove the preservation and progress theorems for the extended language.

关键词： design languages Haskell Dependent types Equality

来源：评论

学校读者我要写书评

暂无评论

Fast RMWs for TSO: Semantics and implementation

Fast RMWs for TSO: Semantics and Implementation

引用

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

作者： Rajaram, Bhargava Nagarajan, Vijay Sarkar, Susmit Elver, Marco Univ Edinburgh Edinburgh EH8 9YL Midlothian Scotland Univ St Andrews St Andrews KY16 9AJ Fife Scotland

ISBN: (纸本)9781450320146

Read-Modify-Write (RMW) instructions are widely used as the building blocks of a variety of higher level synchronization constructs, including locks, barriers, and lock-free data structures. Unfortunately, they are expensive in architectures such as x86 and SPARC which enforce (variants of) Total-Store-Order (TSO). A key reason is that RMWs in these architectures are ordered like a memory barrier, incurring the cost of a write-buffer drain in the critical path. Such strong ordering semantics are dictated by the requirements of the strict atomicity definition (type-1) that existing TSO RMWs use. Programmers often do not need such strong semantics. Besides, weakening the atomicity definition of TSO RMWs, would also weaken their ordering - thereby leading to more efficient hardware implementations. In this paper we argue for TSO RMWs to use weaker atomicity definitions - we consider two weaker definitions: type-2 and type-3, with different relaxed ordering differences. We formally specify how such weaker RMWs would be ordered, and show that type-2 RMWs, in particular, can seamlessly replace existing type-1 RMWs in common synchronization idioms - except in situations where a type-1 RMW is used as a memory barrier. Recent work has shown that the new C/C++ 11 concurrency model can be realized by generating conventional (type-1) RMWs for C/C++ 11 SC-atomic-writes and/or SC-atomic-reads. We formally prove that this is equally valid using the proposed type-2 RMWs;type-3 RMWs, on the other hand, could be used for SC-atomic-reads (and optionally SC-atomic-writes). We further propose efficient microarchitectural implementations for type-2 (type-3) RMWs - simulation results show that our implementation reduces the cost of an RMW by up to 58.9% (64.3%), which translates into an overall performance improvement of up to 9.0% (9.2%) on a set of parallel programs, including those from the SPLASH-2, PARSEC, and STAMP benchmarks.

关键词： design Performance Experimentation Read-Modify-Write (RMW) Total-Store-Order (TSO) Atomics

来源：评论

学校读者我要写书评

暂无评论

Functional Reactive programming with Liveness Guarantees As relations are to set-valued functions, so event sources are to behaviours

Functional Reactive Programming with Liveness Guarantees As ...

引用

18th acm sigplan International conference on Functional programming

作者： Jeffrey, Alan Alcatel Lucent Bell Labs Murray Hill NJ USA

ISBN: (纸本)9781450323260

Functional Reactive programming (FRP) is an approach to the development of reactive systems which provides a pure functional interface, but which may be implemented as an abstraction of an imperative event-driven layer. FRP systems typically provide a model of behaviours (total time-indexed values, implemented as pull systems) and event sources (partial time-indexed values, implemented as push systems). In this paper, we investigate a type system for event-driven FRP programs which provide liveness guarantees, that is every input event is guaranteed to generate an output event. We show that FRP can be implemented on top of a model of sets and relations, and that the isomorphism between event sources and behaviours corresponds to the isomorphism between relations and set-valued functions. We then implement sets and relations using a model of continuations using the usual double-negation CPS transform. The implementation of behaviours as pull systems based on futures, and of event sources as push systems based on the observer pattern, thus arises from first principles. We also discuss a Java implementation of the FRP model.

关键词： design Theory Functional Reactive programming Concurrency Liveness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：