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

conference on Object Oriented programming Systems, languages and Applications/SPLASH 2010

作者： Arnold, Kenneth C. Lieberman, Henry MIT Media Lab Mind Machine Project Cambridge MA 02139 USA

ISBN: (纸本)9781450302036

We propose a new way to raise the level of discourse in the programming process: permit ambiguity, but manage it by linking it to unambiguous examples. This allows programming environments to work with informal descriptions that lack precise semantics, such as natural language descriptions or conceptual diagrams, without requiring programmers to formulate their ideas in a formal language first. As an example of this idea, we present Zones, a code search and reuse interface that connects code with ambiguous natural language statements about its purpose. The backend, called ProcedureSpace, relates purpose statements, static code analysis features, and natural language background knowledge. ProcedureSpace can search for code given statements of purpose or vice versa, and can find code that was never annotated or commented. Since completed Zones searches become annotations, system coverage grows with user interaction. Users in a preliminary study found that reasoning jointly over natural language and programming language helped them reuse code.

关键词： design Human Factors ambiguity Blending common sense informal representation natural language reuse

来源：评论

学校读者我要写书评

暂无评论

Evaluating Iterative Optimization Across 1000 Data Sets 10

Evaluating Iterative Optimization Across 1000 Data Sets

引用

acm sigplan conference on programming language design and implementation

作者： Chen, Yang Huang, Yuanjie Eeckhout, Lieven Fursin, Grigori Peng, Liang Temam, Olivier Wu, Chengyong Chinese Acad Sci ICT LCSA Key Lab Comp Syst & Architecture Beijing Peoples R China Chinese Acad Sci Grad Sch Beijing Peoples R China INRIA Saclay France Univ Ghent Ghent Belgium

ISBN: (纸本)9781450300193

While iterative optimization has become a popular compiler optimization approach, it is based on a premise which has never been truly evaluated: that it is possible to learn the best compiler optimizations across data sets. Up to now, most iterative optimization studies find the best optimizations through repeated runs on the same data set. Only a handful of studies have attempted to exercise iterative optimization on a few tens of data sets. In this paper, we truly put iterative compilation to the test for the first time by evaluating its effectiveness across a large number of data sets. We therefore compose KDataSets, a data set suite with 1000 data sets for 32 programs, which we release to the public. We characterize the diversity of KDataSets, and subsequently use it to evaluate iterative optimization. We demonstrate that it is possible to derive a robust iterative optimization strategy across data sets: for all 32 programs, we find that there exists at least one combination of compiler optimizations that achieves 86% or more of the best possible speedup across all data sets using Intel's ICC (83% for GNU's GCC). This optimal combination is program-specific and yields speedups up to 1.71 on ICC and 2.23 on GCC over the highest optimization level (-fast and -03, respectively). This finding makes the task of optimizing programs across data sets much easier than previously anticipated, and it paves the way for the practical and reliable usage of iterative optimization. Finally, we derive pre-shipping and post-shipping optimization strategies for software vendors.

关键词： design Experimentation Measurement Performance

来源：评论

学校读者我要写书评

暂无评论

SPUR: A Trace-Based JIT Compiler for CIL 10

SPUR: A Trace-Based JIT Compiler for CIL

引用

conference on Object Oriented programming Systems, languages and Applications/SPLASH 2010

作者： Bebenita, Michael Brandner, Florian Fahndrich, Manuel Logozzo, Francesco Schulte, Wolfram Tillmann, Nikolai Venter, Herman Microsoft Research Redmond WA USA

ISBN: (纸本)9781450302036

Tracing just-in-time compilers (TJITs) determine frequently executed traces (hot paths and loops) in running programs and focus their optimization effort by emitting optimized machine code specialized to these traces. Prior work has established this strategy to be especially beneficial for dynamic languages such as JavaScript, where the TJIT interfaces with the interpreter and produces machine code from the JavaScript trace. This direct coupling with a JavaScript interpreter makes it difficult to harness the power of a TJIT for other components that are not written in JavaScript, e. g., the DOM implementation or the layout engine inside a browser. Furthermore, if a TJIT is tied to a particular high-level language interpreter, it is difficult to reuse it for other input languages as the optimizations are likely targeted at specific idioms of the source language. To address these issues, we designed and implemented a TJIT for Microsoft's Common Intermediate language CIL (the target language of C#, VisualBasic, F#, and many other languages). Working on CIL enables TJIT optimizations for any program compiled to this platform. In addition, to validate that the performance gains of a TJIT for JavaScript do not depend on specific idioms of JavaScript that are lost in the translation to CIL, we provide a performance evaluation of our JavaScript runtime which translates JavaScript to CIL and then runs on top of our CIL TJIT.

关键词： design languages Performance dynamic compilation tracing just-in-time CIL JavaScript

来源：评论

学校读者我要写书评

暂无评论

Verifying Event-Driven Programs using Ramified Frame Properties

Verifying Event-Driven Programs using Ramified Frame Propert...

引用

5th acm sigplan Workshop on Types in language design and implementation

作者： Krishnaswami, Neelakantan R. Birkedal, Lars Aldrich, Jonathan Microsoft Research IT University of Copenhagen Denmark Carnegie Mellon University United States

ISBN: (纸本)9781605588919

Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not only the objects its own invariant depends on, but also all of the objects which depend upon it, in order to notify them when it changes. These bidirectional linkages pose a serious challenge to verification, because their correctness relies upon a global invariant over the object graph. We show how to modularly verify programs written using dynamically-generated bidirectional dependency information. The critical idea is to distinguish between the footprint of a command, and the state whose invariants depends upon the footprint. To do so, we define an application-specific semantics of updates, and introduce the concept of a ramification operator to explain how local changes can alter our knowledge of the rest of the heap. We illustrate the applicability of this style of proof with a case study from functional reactive programming, and formally justify reasoning about an extremely imperative implementation as if it were pure.

关键词： separation logic frame rule ramification problem dataflow functional reactive programming subject-observer

来源：评论

学校读者我要写书评

暂无评论

Lolliproc: to Concurrency from Classical Linear Logic via Curry-Howard and Control 10

Lolliproc: to Concurrency from Classical Linear Logic via Cu...

引用

15th acm sigplan International conference on Functional programming

作者： Mazurak, Karl Zdancewic, Steve Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781605587943

While many type systems based on the intuitionistic fragment of linear logic have been proposed, applications in programming languages of the full power of linear logic-including double-negation elimination-have remained elusive. Meanwhile, linearity has been used in many type systems for concurrent programs-e.g., session types-which suggests applicability to the problems of concurrent programming, but the ways in which linearity has interacted with concurrency primitives in lambda calculi have remained somewhat ad-hoc. In this paper we connect classical linear logic and concurrent functional programming in the language Lolliproc, which provides simple primitives for concurrency that have a direct logical interpretation and that combine to provide the functionality of session types. Lolliproc features a simple process calculus "under the hood" but hides the machinery of processes from programmers. We illustrate Lolliproc by example and prove soundness, strong normalization, and confluence results, which, among other things, guarantees freedom from deadlocks and race conditions.

关键词： design languages Theory Linear logic Concurrency Type systems

来源：评论

学校读者我要写书评

暂无评论

Space profiling for parallel functional programs

引用

JOURNAL OF FUNCTIONAL programming 2010年第5-6期20卷 417-461页

作者： Spoonhower, Daniel Blelloch, Guy E. Harper, Robert Gibbons, Phillip B. Carnegie Mellon Univ Sch Comp Sci Pittsburgh PA 15213 USA Intel Labs Pittsburgh Pittsburgh PA 15213 USA

We present a semantic space profiler for parallel functional programs. Building on previous work in sequential profiling, our tools help programmers to relate runtime resource use back to program source code. Unlike many profiling tools, our profiler is based on a cost semantics. This provides a means to reason about performance without requiring a detailed understanding of the compiler or runtime system. It also provides a specification for language implementers. This is critical in that it enables us to separate cleanly the performance of the application from that of the language implementation. Some aspects of the implementation can have significant effects on performance. Our cost semantics enables programmers to understand the impact of different scheduling policies while hiding many of the details of their implementations. We show applications where the choice of scheduling policy has asymptotic effects on space use. We explain these use patterns through a demonstration of our tools. We also validate our methodology by observing similar performance in our implementation of a parallel extension of Standard ML.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Generating Safe Template languages 09

Generating Safe Template Languages

引用

8th International conference on Generative programming and Component Engineering

作者： Heidenreich, Florian Johannes, Jendrik Seifert, Mirko Wende, Christian Boehme, Marcel Tech Univ Dresden Fak Informat Lehrstuhl Softwaretechnol Dresden Germany

ISBN: (纸本)9781605584942

Template languages are widely used within generative programming, because they provide intuitive means to generate software artefacts expressed in a specific object language. However, most template languages perform template instantiation on the level of string literals, which allows neither syntax checks nor semantics analysis. To make sure that generated artefacts always conform to the object language, we propose to perform static analysis at template design time. In addition, the increasing popularity of domain-specific languages (DSLs) demands an approach that allows to reuse both the concepts of template languages and the corresponding tools. In this paper we address the issues mentioned above by presenting how existing languages can be automatically extended with generic template concepts (e.g., placeholders, loops, conditions) to obtain safe template languages. These languages provide means for syntax checking and static semantic analysis w.r.t. the object language at template design time. We discuss the prerequisites for this extension, analyse the types of correctness properties that can be assured at template design time, and exemplify the key benefits of this approach on a textual DSL and Java.

关键词： languages generative programming template language safe authoring language extension

来源：评论

学校读者我要写书评

暂无评论

Implicitly threaded parallelism in Manticore

引用

JOURNAL OF FUNCTIONAL programming 2010年第5-6期20卷 537-576页

作者： Fluet, Matthew Rainey, Mike Reppy, John Shaw, Adam Rochester Inst Technol Dept Comp Sci Rochester NY 14623 USA Univ Chicago Dept Comp Sci Chicago IL 60637 USA Toyota Technol Inst Chicago IL USA

The increasing availability of commodity multicore processors is making parallel computing ever more widespread. In order to exploit its potential, programmers need languages that make the benefits of parallelism accessible and understandable. Previous parallel languages have traditionally been intended for large-scale scientific computing, and they 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. The Manticore project is our effort to address this need. At its core is Parallel ML, a high-level functional language for programming parallel applications on commodity multicore hardware. Parallel ML provides a diverse collection of parallel constructs for different granularities of work. In this paper, we focus on the implicitly threaded parallel constructs of the language, which support fine-grained parallelism. We concentrate on those elements that distinguish our design from related ones, namely, a novel parallel binding form, a nondeterministic parallel case form, and the treatment of exceptions in the presence of data parallelism. These features differentiate the present work from related work on functional data-parallel language designs, which have focused largely on parallel problems with regular structure and the compiler transformations-most notably, flattening-that make such designs feasible. We present detailed examples utilizing various mechanisms of the language and give a formal description of our implementation.

关键词： Multicore programming

来源：评论

学校读者我要写书评

暂无评论

Modular Logic Metaprogramming 10

Modular Logic Metaprogramming

引用

conference on Object Oriented programming Systems, languages and Applications/SPLASH 2010

作者： Klose, Karl Ostermann, Klaus Aarhus Univ DK-8000 Aarhus C Denmark Univ Marburg D-35032 Marburg Germany

ISBN: (纸本)9781450302036

In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are obvious, its incompatibility with separate checking limits its applicability to large-scale projects. We analyze the problems inhibiting separate checking and propose a class of logics that reconcile logic metaprogramming and separate checking. We have formalized the resulting module system and have proven the soundness of separate checking. We validate its feasibility by presenting the design and implementation of a specific logic that is able to express many metaprogramming examples from the literature.

关键词： design languages Theory Modularity Separate Checking Logic Metaprogramming

来源：评论

学校读者我要写书评

暂无评论

A Generative programming Approach to Developing Pervasive Computing Systems 09

A Generative Programming Approach to Developing Pervasive Co...

引用

8th International conference on Generative programming and Component Engineering

作者： Cassou, Damien Bertran, Benjamin Loriant, Nicolas Consel, Charles INRIA LaBRI ENSEIRB Paris France

ISBN: (纸本)9781605584942

Developing pervasive computing applications is a difficult task because it requires to deal with a wide range of issues: heterogeneous devices, entity distribution, entity coordination, low-level hardware knowledge... Besides requiring various areas of expertise, programming such applications involves writing a lot of administrative code to glue technologies together and to interface with both hardware and software components. This paper proposes a generative programming approach to providing programming, execution and simulation support dedicated to the pervasive computing domain. This approach relies on a domain-specific language, named DiaSpec, dedicated to the description of pervasive computing systems. Our generative approach factors out features of distributed systems technologies, making DiaSpec-specified software systems portable. The DiaSpec compiler is implemented and has been used to generate dedicated programming frameworks for a variety of pervasive computing applications, including detailed ones to manage the building of an engineering school.

关键词： design languages pervasive computing generative programming DSL

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：