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

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

作者： Kats, Lennart C. L. Visser, Eelco Wachsmuth, Guido Delft Univ Technol NL-2600 AA Delft Netherlands

ISBN: (纸本)9781450302036

Syntax definitions are pervasive in modern software systems, and serve as the basis for language processing tools like parsers and compilers. Mainstream parser generators pose restrictions on syntax definitions that follow from their implementation algorithm. They hamper evolution, maintainability, and compositionality of syntax definitions. The pureness and declarativity of syntax definitions is lost. We analyze how these problems arise for different aspects of syntax definitions, discuss their consequences for language engineers, and show how the pure and declarative nature of syntax definitions can be regained.

关键词： design languages

来源：评论

学校读者我要写书评

暂无评论

Smooth Interpretation 10

Smooth Interpretation

引用

acm sigplan conference on programming language design and implementation

作者： Chaudhuri, Swarat Solar-Lezama, Armando Penn State Univ University Pk PA 16802 USA MIT Cambridge MA 02139 USA

ISBN: (纸本)9781450300193

We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of numerical search techniques like gradient descent for program analysis and synthesis. The method extends to programs the notion of Gaussian smoothing, a popular signal-processing technique that filters out noise and discontinuities from a signal by taking its convolution with a Gaussian function. In our setting, Gaussian smoothing executes a program according to a probabilistic semantics;the execution of program P on an input x after Gaussian smoothing can be summarized as follows: (1) Apply a Gaussian perturbation to x-the perturbed input is a random variable following a normal distribution with mean x. (2) Compute and return the expected output of P on this perturbed input. Computing the expectation explicitly would require the execution of P on all possible inputs, but smooth interpretation bypasses this requirement by using a form of symbolic execution to approximate the effect of Gaussian smoothing on P. The result is an efficient but approximate implementation of Gaussian smoothing of programs. Smooth interpretation has the effect of attenuating features of a program that impede numerical searches of its input space-for example, discontinuities resulting from conditional branches are replaced by continuous transitions. We apply smooth interpretation to the problem of synthesizing values of numerical control parameters in embedded control applications. This problem is naturally formulated as one of numerical optimization: the goal is to find parameter values that minimize the error between the resulting program and a programmer-provided behavioral specification. Solving this problem by directly applying numerical optimization techniques is often impractical due to the discontinuities in the error function. By eliminating these discontinuities, smooth interpretation makes it possible to

关键词： Theory design Verification Program Smoothing Continuity Parameter Synthesis Abstract Interpretation Operational Semantics

来源：评论

学校读者我要写书评

暂无评论

A Context-free Markup language for Semi-structured Text 10

A Context-free Markup Language for Semi-structured Text

引用

acm sigplan conference on programming language design and implementation

作者： Xi, Qian Walker, David Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781450300193

An ad hoc data format is any nonstandard, semi-structured data format for which robust data processing tools are not easily available. In this paper, we present ANNE, a new kind of markup language designed to help users generate documentation and data processing tools for ad hoc text data. More specifically, given a new ad hoc data source, an ANNE programmer edits the document to add a number of simple annotations, which serve to specify its syntactic structure. Annotations include elements that specify constants, optional data, alternatives, enumerations, sequences, tabular data, and recursive patterns. The ANNE system uses a combination of user annotations and the raw data itself to extract a context-free grammar from the document. This context-free grammar can then be used to parse the data and transform it into an XML parse tree, which may be viewed through a browser for analysis or debugging purposes. In addition, the ANNE system generates a PADS/ML description [19], which may be saved as lasting documentation of the data format or compiled into a host of useful data processing tools. In addition to designing and implementing ANNE, we have devised a semantic theory for the core elements of the language. This semantic theory describes the editing process, which translates a raw, unannotated text document into an annotated document, and the grammar extraction process, which generates a context-free grammar from an annotated document. We also present an alternative characterization of system behavior by drawing upon ideas from the field of relevance logic. This secondary characterization, which we call relevance analysis, specifies a direct relationship between unannotated documents and the context-free grammars that our system can generate from them. Relevance analysis allows us to prove important theorems concerning the expressiveness and utility of our system.

关键词： Domain-specific languages Tool Generation Ad Hoc Data PADS ANNE

来源：评论

学校读者我要写书评

暂无评论

Jinn: Synthesizing Dynamic Bug Detectors for Foreign language Interfaces 10

Jinn: Synthesizing Dynamic Bug Detectors for Foreign Languag...

引用

acm sigplan conference on programming language design and implementation

作者： Lee, Byeongcheol Wiedermann, Ben Hirzel, Martin Grimm, Robert McKinley, Kathryn S. Univ Texas Austin Austin TX 78712 USA

ISBN: (纸本)9781450300193

programming language specifications mandate static and dynamic analyses to preclude syntactic and semantic errors. Although individual languages are usually well-specified, composing languages is not, and this poor specification is a source of many errors in multilingual programs. For example, virtually all Java programs compose Java and C using the Java Native Interface (JNI). Since JNI is informally specified, developers have difficulty using it correctly, and current Java compilers and virtual machines (VMs) inconsistently check only a subset of JNI constraints. This paper's most significant contribution is to show how to synthesize dynamic analyses from state machines to detect foreign function interface (FFI) violations. We identify three classes of FFI constraints encoded by eleven state machines that capture thousands of JNI and Python/C FFI rules. We use a mapping function to specify which state machines, transitions, and program entities (threads, objects, references) to check at each FFI call and return. From this function, we synthesize a context-specific dynamic analysis to find FFI bugs. We build bug detection tools for JNI and Python/C using this approach. For JNI, we dynamically and transparently interpose the analysis on Java and C language transitions through the JVM tools interface. The resulting tool, called Jinn, is compiler and virtual machine independent. It detects and diagnoses a wide variety of FFI bugs that other tools miss. This approach greatly reduces the annotation burden by exploiting common FFI constraints: whereas the generated Jinn code is 22,000+ lines, we wrote only 1,400 lines of state machine and mapping code. Overall, this paper lays the foundation for a more principled approach to developing correct multilingual software and a more concise and automated approach to FFI specification.

关键词： Multilingual Programs Foreign Function Interfaces (FFI) Java Native Interface (JNI) Python/C Dynamic Analysis FFI Bugs Specification Specification Generation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

language extension and composition with language workbenches

Language extension and composition with language workbenches

引用

acm International conference Companion on Object Oriented programming Systems languages and Applications Companion, SPLASH '10

作者： Völter, Markus Visser, Eelco Independent/Itemis Germany Delft University of Technology Netherlands

ISBN: (纸本)9781450302401

Domain-specific languages (DSLs) provide high expressive power focused on a particular problem domain. They provide linguistic abstractions and specialized syntax specifically designed for a domain, allowing developers to avoid boilerplate code and low-level implementation details. language workbenches are tools that integrate all aspects of the definition of domain-specific or general-purpose software languages and the creation of a programming environment from such a definition. To count as a language workbench, a tool needs to satisfy basic requirements for the integrated definition of syntax, semantics, and editor services, and preferably also support language extension and composition. Within these requirements there is ample room for variation in the design of a language workbench. In this tutorial, we give an introduction to the state of the art in textual DSLs and language workbenches. We discuss the main requirements and variation points in the design of language workbenches, and describe two points in the design space using two state-of-the-art language workbenches. Spoofax is an example of a parser-based language workbench, while MPS represents language workbenches based on projectional editors.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Cross-language, Type-Safe, and Transparent Object Sharing For Co-Located Managed Runtimes 10

Cross-Language, Type-Safe, and Transparent Object Sharing Fo...

引用

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

作者： Wegiel, Michal Krintz, Chandra Univ Calif Santa Barbara Dept Comp Sci Santa Barbara CA 93106 USA

ISBN: (纸本)9781450302036

As software becomes increasingly complex and difficult to analyze, it is more and more common for developers to use high-level, type-safe, object-oriented (OO) programming languages and to architect systems that comprise multiple components. Different components are often implemented in different programming languages. In state-of-the-art multicomponent, multi-language systems, cross-component communication relies on remote procedure calls (RPC) and message passing. As components are increasingly co-located on the same physical machine to ensure high utilization of multi-core systems, there is a growing potential for using shared memory for cross-language cross-runtime communication. We present the design and implementation of Co-Located Runtime Sharing (CoLoRS), a system that enables cross-language, cross-runtime type-safe, transparent shared memory. CoLoRS provides object sharing for co-located OO runtimes for both static and dynamic languages. CoLoRS defines a language-neutral object/class model, which is a static-dynamic hybrid and enables class evolution while maintaining the space/time efficiency of a static model. CoLoRS uses type mapping and class versioning to transparently map shared types to private types. CoLoRS also contributes a synchronization mechanism and a parallel, concurrent, on-thefly GC algorithm, both designed to facilitate cross-language cross-runtime object sharing. We implement CoLoRS in open-source, production-quality runtimes for Python and Java. Our empirical evaluation shows that CoLoRS extensions impose low overhead. We also investigate RPC over CoLoRS and find that using shared memory to implement co-located RPC significantly improves both communication throughput and latency by avoiding data structure serialization.

关键词： design languages Management Measurement Performance

来源：评论

学校读者我要写书评

暂无评论

Task Types for Pervasive Atomicity 10

Task Types for Pervasive Atomicity

引用

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

作者： Kulkarni, Aditya Liu, Yu David Smith, Scott F. SUNY Binghamton Binghamton NY 13902 USA Johns Hopkins Univ Baltimore MD 21218 USA

ISBN: (纸本)9781450302036

Atomic regions are an important concept in correct concurrent programming: since atomic regions can be viewed as having executed in a single step, atomicity greatly reduces the number of possible interleavings the programmer needs to consider. This paper describes a method for building atomicity into a programming language in an organic fashion. We take the view that atomicity holds for whole threads by default, and a division into smaller atomic regions occurs only at points where an explicit need for sharing is needed and declared. A corollary of this view is every line of code is part of some atomic region. We define a polymorphic type system, Task Types, to enforce most of the desired atomicity properties statically. We show the reasonableness of our type system by proving that type soundness, isolation invariance, and atomicity enforcement properties hold at run time. We also present initial results of a Task Types implementation built on Java.

关键词： design languages Theory Pervasive Atomicity Type Systems Sharing-Aware programming

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词： Multi-core processors Parallel Lines Synclitism data parallel THREADED parallelism Spectra applications language Parallel languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：