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

acm sigplan NOTICES 2008年第9期43卷 39-50页

作者： Oury, Nicolas Swierstra, Wouter Univ Nottingham Nottingham NG7 2RD England

This paper exhibits the power of programming with dependent types by dint of embedding three domain-specific languages: Cryptol, a language for cryptographic protocols;a small data description language;and relational algebra. Each example demonstrates particular design patterns inherent to dependently-typed programming. Documenting these techniques paves the way for further research in domain-specific embedded type systems.

关键词： design languages theory

来源：评论

学校读者我要写书评

暂无评论

The design and implementation of typed scheme

引用

acm sigplan NOTICES 2008年第1期43卷 395-406页

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

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.

关键词： languages design type systems Scheme

来源：评论

学校读者我要写书评

暂无评论

Implicitly-threaded parallelism in Manticore

引用

acm sigplan NOTICES 2008年第9期43卷 119-130页

作者： Fluet, Matthew Rainey, Mike Reppy, John Shaw, Adam Toyota Technol Inst Chicago IL 60637 USA Univ Chicago Chicago IL 60637 USA

The increasing availability of commodity multicore processors is making parallel computing available to the masses. Traditional parallel languages are largely intended for large-scale scientific computing and tend not to be well-suited to programming the applications one typically finds on a desktop system. Thus we need new parallel-language designs that address a broader spectrum of applications. In this paper, we present Manticore, a language for building parallel applications on commodity multicore hardware including a diverse collection of parallel constructs for different granularities of work. We focus on the implicitly-threaded parallel constructs in our high-level functional language. We concentrate on those elements that distinguish our design from related ones, namely, a novel parallel binding form, a nondeterministic parallel case form, and exceptions in the presence of data parallelism. These features differentiate the present work from related work on functional data parallel language designs, which has focused largely on parallel problems with regular structure and the compiler transformations - most notably, flattening - that make such designs feasible. We describe our implementation strategies and present some detailed examples utilizing various mechanisms of our language.

关键词： design languages implicitly-threaded parallelism data parallelism parallel binding parallel case exceptions

来源：评论

学校读者我要写书评

暂无评论

Expressive and safe static reflection with MorphJ

引用

acm sigplan NOTICES 2008年第6期43卷 79-89页

作者： Huang, Shan Shan Smaragdakis, Yannis Georgia Inst Technol Coll Comp Atlanta GA 30332 USA Univ Oregon Dept Comp & Informat Sci Eugene OR 97403 USA

Recently, language extensions have been proposed for Java and C# to support pattern-based reflective declaration. These extensions introduce a disciplined form of meta-programming and aspect-oriented programming to mainstream languages: They allow members of a class (i.e., fields and methods) to be declared by statically iterating over and pattern-matching on members of other classes. Such techniques, however, have been unable to safely express simple, but common, idioms such as declaring getter and setter methods for fields. In this paper, we present a mechanism that addresses the lack of expressiveness in past work without sacrificing safety. Our technique is based on the idea of nested patterns that elaborate the outer-most pattern with blocking or enabling conditions. We implemented this mechanism in a language, MorphJ. We demonstrate the expressiveness of MorphJ with real-world applications. In particular, the MorphJ reimplementation of DSTM2, a software transactional memory library, reduces 1,107 lines of Java reflection and bytecode engineering library calls to just 374 lines of MorphJ code. At the same time, the MorphJ solution is both high level and safer, as MorphJ can separately type check generic classes and catch errors early. We present and formalize the MorphJ type system, and offer a type-checking algorithm.

关键词： languages object-oriented programming structural abstraction class morphing aspect-oriented programming meta-programming language extensions

来源：评论

学校读者我要写书评

暂无评论

Orchestrating the execution of stream programs on multicore platforms

引用

acm sigplan NOTICES 2008年第6期43卷 114-124页

作者： Kudlur, Manjunath Mahlke, Scott Univ Michigan Adv Comp Architecture Lab Ann Arbor MI 48109 USA

While multicore hardware has become ubiquitous, explicitly parallel programming models and compiler techniques for exploiting parallelism on these systems have noticeably lagged behind. Stream programming is one model that has wide applicability in the multimedia, graphics, and signal processing domains. Streaming models execute as a set of independent actors that explicitly communicate data through channels. This paper presents a compiler technique for planning and orchestrating the execution of streaming applications on multicore platforms. An integrated unfolding and partitioning step based on integer linear programming is presented that unfolds data parallel actors as needed and maximally packs actors onto cores. Next, the actors are assigned to pipeline stages in such a way that all communication is maximally overlapped with computation on the cores. To facilitate experimentation, a generalized code generation template for mapping the software pipeline onto the Cell architecture is presented. For a range of streaming applications, a geometric mean speedup of 14.7x is achieved on a 16-core Cell platform compared to a single core.

关键词： languages algorithms performance StreamIt cell processor multicore stream programming software pipelining

来源：评论

学校读者我要写书评

暂无评论

AURA: a programming language for authorization and audit

引用

acm sigplan NOTICES 2008年第9期43卷 27-38页

作者： Jia, Limin Vaughan, Jeffrey A. Mazurak, Karl Zhao, Jianzhou Zarko, Luke Schorr, Joseph Zdancewic, Steve Univ Penn Philadelphia PA 19104 USA

This paper presents AURA, a programming language for access control that treats ordinary programming constructs (e.g., integers and recursive functions) and authorization logic constructs (e.g., principals and access control policies) in a uniform way. AURA is based on polymorphic DCC and uses dependent types to permit assertions that refer directly to AURA values while keeping computation out of the assertion level to ensure tractability. The main technical results of this paper include fully mechanically verified proofs of the decidability and soundness for AURA's type system, and a prototype typechecker and interpreter.

关键词： design language security access control authorization logic audit type systems

来源：评论

学校读者我要写书评

暂无评论

Checking Race Freedom via Linear programming 08

Checking Race Freedom via Linear Programming

引用

acm sigplan conference on programming language design and implementation

作者： Terauchi, Tachio Tohoku Univ Sendai Miyagi 980 Japan

ISBN: (纸本)9781595938602

We present a new static analysis for race freedom and race detection. The analysis checks race freedom by reducing the problem to (rational) linear programming. Unlike conventional static analyses for race freedom or race detection, our analysis avoids explicit computation of locksets and lock linearity/must-aliasness. Our analysis can handle a variety of synchronization idioms that more conventional approaches often have difficulties with, such as thread joining, semaphores, and signals. We achieve efficiency by utilizing modem linear programming solvers that can quickly solve large linear programming instances. This paper reports on the formal properties of the analysis and the experience with applying an implementation to real world C programs.

关键词： Fractional Capabilities Linear programming

来源：评论

学校读者我要写书评

暂无评论

Injecting programming language Concepts Throughout the Curriculum: An Inclusive Strategy

引用

acm sigplan NOTICES 2008年第11期43卷 36-38页

作者： Bailey, Mark W. Hamilton Coll Dept Comp Sci Clinton NY 13323 USA

As research in programming language design, implementation, and application advances, we must regularly revisit the undergraduate curriculum to ensure course content advances similarly. However, no matter how diligent our efforts, the undergraduate curriculum will continue to undergo pressure from all fields of the discipline to include courses covering those fields. Though we could advocate for core placement of programming language courses, it is likely, even inevitable, that a growing number of colleges and universities will choose not to mandate programming language courses for their degree programs. Thus, we must develop an inclusive strategy that encourages the teaching of programming language topics even in colleges and universities that choose not to devote an entire course to the study of them. I have proposed one such strategy that supports the injection of programming language concepts into other courses of interest to both students and faculty.

关键词： languages programming language curriculum

来源：评论

学校读者我要写书评

暂无评论

EventScript: An event-processing language based on regular expressions with actions

引用

acm sigplan NOTICES 2008年第7期43卷 111-120页

作者： Cohen, Norman H. Kalleberg, Karl Trygve IBM Thomas J Watson Res Ctr Hawthorne NY USA Univ Bergen N-5020 Bergen Norway

EventScript is a simple but powerful language for programming reactive processes. A stream of incoming events is matched against a regular expression. Actions embedded within the regular expression are executed in response to the matching of patterns of events. These actions include assigning computed values to variables and emitting output events. The definition of EventScript presented a number of novel and interesting language-design choices. EventScript has an efficient implementation, and has been used in a development environment for complex event-based applications. We have used EventScript to program both small examples and large industrial applications. Readers of EventScript programs find them easy to understand, and are comfortable with the familiar model of matching regular expressions.

关键词： algorithms performance design experimentation languages theory event processing regular expressions reactive programs sensors actuators

来源：评论

学校读者我要写书评

暂无评论

Sketching concurrent data structures

引用

acm sigplan NOTICES 2008年第6期43卷 136-148页

作者： Solar-Lezama, Armando Jones, Christopher Grant Bodik, Rastislav Univ Calif Berkeley Berkeley CA 94720 USA

We describe PSKETCH, a program synthesizer that helps programmers implement concurrent data structures. The system is based on the concept of sketching, a form of synthesis that allows programmers to express their insight about an implementation as a partial program: a sketch. The synthesizer automatically completes the sketch to produce an implementation that matches a given correctness criteria. PSKETCH is based on a new counterexample-guided inductive synthesis algorithm (CEGIS) that generalizes the original sketch synthesis algorithm from [ 20] to cope efficiently with concurrent programs. The new algorithm produces a correct implementation by iteratively generating candidate implementations, running them through a verifier, and if they fail, learning from the counterexample traces to produce a better candidate;converging to a solution in a handful of iterations. PSKETCH also extends SKETCH with higher-level sketching constructs that allow the programmer to express her insight as a "soup" of ingredients from which complicated code fragments must be assembled. Such sketches can be viewed as syntactic descriptions of huge spaces of candidate programs ( over 1 0 8 candidates for some sketches we resolved). We have used the PSKETCH system to implement several classes of concurrent data structures, including lock-free queues and concurrent sets with fine-grained locking. We have also sketched some other concurrent objects including a sense-reversing barrier and a protocol for the dining philosophers problem;all these sketches resolved in under an hour.

关键词： languages design sketching synthesis concurrency SAT SPIN

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：