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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

26 篇 会议

馆藏范围

26 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

21 篇 工学
- 21 篇 软件工程
- 1 篇 计算机科学与技术...

主题

11 篇 design
10 篇 languages
6 篇 performance
4 篇 algorithms
3 篇 experimentation
3 篇 reliability
2 篇 scripting langua...
2 篇 program synthesi...
2 篇 type systems
2 篇 probabilistic pr...
2 篇 end-user program...
2 篇 measurement
2 篇 programming lang...
2 篇 concurrency
1 篇 deterministic mu...
1 篇 separation
1 篇 macros
1 篇 precise exceptio...
1 篇 symbolic virtual...
1 篇 fast

机构

2 篇 univ wisconsin m...
2 篇 stanford univ st...
2 篇 univ washington ...
1 篇 epfl
1 篇 natl taipei univ...
1 篇 univ massachuset...
1 篇 technion haifa
1 篇 university of co...
1 篇 ufrj rio de jane...
1 篇 acad sinica taiw...
1 篇 univ calif davis...
1 篇 swiss fed inst t...
1 篇 beijing inst tec...
1 篇 puc-rio rio de j...
1 篇 microsoft corp m...
1 篇 chinese acad sci...
1 篇 univ calif berke...
1 篇 microsoft resear...
1 篇 rice univ dept c...
1 篇 cornell univ ith...

作者

2 篇 gupta gagan
2 篇 grossman dan
2 篇 gulwani sumit
2 篇 sohi gurindar s.
2 篇 sridharan srinat...
1 篇 mascarenhas fabi...
1 篇 mckinley kathryn...
1 篇 shull thomas
1 篇 yahav eran
1 篇 garzaran maria j...
1 篇 vilk john
1 篇 maidl andré murb...
1 篇 sujeeth arvind k...
1 篇 choi jiho
1 篇 devito zachary
1 篇 li yong
1 篇 ceze luis
1 篇 rajamani sriram ...
1 篇 paulo marques
1 篇 aiken alex

语言

26 篇 英文

检索条件"任意字段=35th ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2014"

共 26 条记录，以下是11-20 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Adaptive, Efficient, Parallel Execution of Parallel Programs 14

Adaptive, Efficient, Parallel Execution of Parallel Programs

引用

35th acm sigplan conference on programming language design and implementation (pldi)

作者： Sridharan, Srinath Gupta, Gagan Sohi, Gurindar S. Univ Wisconsin Madison WI 53706 USA

ISBN: (纸本)9781450327848

Future multicore processors will be heterogeneous, be increasingly less reliable, and operate in dynamically changing operating conditions. Such environments will result in a constantly varying pool of hardware resources which can greatly complicate the task of efficiently exposing a program's parallelism onto these resources. Coupled with this uncertainty is the diverse set of efficiency metrics that users may desire. this paper proposes Varuna, a system that dynamically, continuously, rapidly and transparently adapts a program's parallelism to best match the instantaneous capabilities of the hardware resources while satisfying different efficiency metrics. Varuna is applicable to both multithreaded and task-based programs and can be seamlessly inserted between the program and the operating system without needing to change the source code of either. We demonstrate Varuna's effectiveness in diverse execution environments using unaltered C/C++ parallel programs from various benchmark suites. Regardless of the execution environment, Varuna always outperformed the state-of-the-art approaches for the efficiency metrics considered.

关键词： design Experimentation Measurement Performance Autotuning parallel programming performance portability performance tuning run-time optimization

来源：评论

学校读者我要写书评

暂无评论

A Lightweight Symbolic Virtual Machine for Solver-Aided Host languages 14

A Lightweight Symbolic Virtual Machine for Solver-Aided Host...

引用

35th acm sigplan conference on programming language design and implementation (pldi)

作者： Torlak, Emina Bodik, Rastislav Univ Calif Berkeley Berkeley CA 94608 USA

ISBN: (纸本)9781450327848

Solver-aided domain-specific languages (SDSLs) are an emerging class of computer-aided programming systems. they ease the construction of programs by using satisfiability solvers to automate tasks such as verification, debugging, synthesis, and non-deterministic execution. But reducing programming tasks to satisfiability problems involves translating programs to logical constraints, which is an engineering challenge even for domain-specific languages. We have previously shown that translation to constraints can be avoided if SDSLs are implemented by (traditional) embedding into a host language that is itself solver-aided. this paper describes how to implement a symbolic virtual machine (SVM) for such a host language. Our symbolic virtual machine is lightweight because it compiles to constraints only a small subset of the host's constructs, while allowing SDSL designers to use the entire language, including constructs for DSL embedding. this lightweight compilation employs a novel symbolic execution technique with two key properties: it produces compact encodings, and it enables concrete evaluation to strip away host constructs that are outside the subset compilable to constraints. Our symbolic virtual machine architecture is at the heart of ROSETTE, a solver-aided language that is host to several new SDSLs.

关键词： design languages Solver-Aided languages Symbolic Virtual Machine

来源：评论

学校读者我要写书评

暂无评论

Globally Precise-restartable Execution of Parallel Programs 14

Globally Precise-restartable Execution of Parallel Programs

引用

35th acm sigplan conference on programming language design and implementation (pldi)

作者： Gupta, Gagan Sridharan, Srinath Sohi, Gurindar S. Univ Wisconsin Madison WI 53706 USA

ISBN: (纸本)9781450327848

Emerging trends in computer design and use are likely to make exceptions, once rare, the norm, especially as the system size grows. Due to exceptions, arising from hardware faults, approximate computing, dynamic resource management, etc., successful and error-free execution of programs may no longer be assured. Yet, designers will want to tolerate the exceptions so that the programs execute completely, efficiently and without external intervention. Modern computers easily handle exceptions in sequential programs, using precise interrupts. But they are ill-equipped to handle exceptions in parallel programs, which are growing in prevalence. In this work we introduce the notion of globally precise-restartable execution of parallel programs, analogous to precise-interruptible execution of sequential programs. We present a software runtime recovery system based on the approach to handle exceptions in suitably-written parallel programs. Qualitative and quantitative analyses show that the proposed system scales with the system size, especially when exceptions are frequent, unlike the conventional checkpoint-and-recovery method.

关键词： design Experimentation Measurement Performance Reliability Deterministic Multithreading Precise Exceptions

来源：评论

学校读者我要写书评

暂无评论

DOPPIO: Breaking the Browser language Barrier 14

DOPPIO: Breaking the Browser Language Barrier

引用

35th acm sigplan conference on programming language design and implementation (pldi)

作者： Vilk, John Berger, Emery D. Univ Massachusetts Sch Comp Sci Amherst MA 01003 USA

ISBN: (纸本)9781450327848

Web browsers have become a de facto universal operating system, and JavaScript its instruction set. Unfortunately, running other languages in the browser is not generally possible. Translation to JavaScript is not enough because browsers are a hostile environment for other languages. Previous approaches are either non-portable or require extensive modifications for programs to work in a browser. this paper presents DOPPIO, a JavaScript-based runtime system that makes it possible to run unaltered applications written in general-purpose languages directly inside the browser. DOPPIO provides a wide range of runtime services, including a file system that enables local and external (cloud-based) storage, an unmanaged heap, sockets, blocking I/O, and multiple threads. We demonstrate DOPPIO's usefulness with two case studies: we extend Emscripten with DOPPIO, letting it run an unmodified C++ application in the browser with full functionality, and present DOPPIOJVM, an interpreter that runs unmodified JVM programs directly in the browser. While substantially slower than a native JVM (between 24 x and 42 x slower on CPU-intensive benchmarks in Google Chrome), DOPPIOJVM makes it feasible to directly reuse existing, non compute-intensive code.

关键词： languages design Web Browsers programming languages JVM Operating Systems JavaScript

来源：评论

学校读者我要写书评

暂无评论

Improving JavaScript Performance by Deconstructing the Type System 14

Improving JavaScript Performance by Deconstructing the Type ...

引用

35th acm sigplan conference on programming language design and implementation (pldi)

作者： Ahn, Wonsun Choi, Jiho Shull, thomas Garzaran, Maria J. Torrellas, Josep Univ Illinois Champaign IL 61820 USA

ISBN: (纸本)9781450327848

Increased focus on Java Script performance has resulted in vast performance improvements for many benchmarks. However, for actual code used in websites, the attained improvements often lag far behind those for popular benchmarks. this paper shows that the main reason behind this shortfall is how the compiler understands types. Java Script has no concept of types, but the compiler assigns types to objects anyway for ease of code generation. We examine the way that the Chrome V8 compiler defines types, and identify two design decisions that are the main reasons for the lack of improvement: (1) the inherited prototype object is part of the current object's type definition, and (2) method bindings are also part of the type definition. these requirements make types very unpredictable, which hinders type specialization by the compiler. Hence, we modify V8 to remove these requirements, and use it to compile the Java Script code assembled by JSBench from real websites. On average, we reduce the execution time of JSBench by 36%, and the dynamic instruction count by 49%.

关键词： design languages Performance Java Script Scripting language Dynamic Typing Type Specialization Hidden Class Inline Caching Prototype

来源：评论

学校读者我要写书评

暂无评论

Test-Driven Synthesis 14

Test-Driven Synthesis

引用

35th acm sigplan conference on programming language design and implementation (pldi)

作者： Perelman, Daniel Gulwani, Sumit Grossman, Dan Provost, Peter Univ Washington Seattle WA 98195 USA Microsoft Corp Mountain View CA USA

ISBN: (纸本)9781450327848

programming-by-example technologies empower end-users to create simple programs merely by providing input/output examples. Existing systems are designed around solvers specialized for a specific set of data types or domain-specific language (DSL). We present a program synthesizer which can be parameterized by an arbitrary DSL that may contain conditionals and loops and therefore is able to synthesize programs in any domain. In order to use our synthesizer, the user provides a sequence of increasingly sophisticated input/output examples along with an expert-written DSL definition. these two inputs correspond to the two key ideas that allow our synthesizer to work in arbitrary domains. First, we developed a novel iterative synthesis technique inspired by test-driven development-which also gives our technique the name of test-driven synthesis-where the input/output examples are consumed one at a time as the program is refined. Second, the DSL allows our system to take an efficient component-based approach to enumerating possible programs. We present applications of our synthesis methodology to end-user programming for transformations over strings, XML, and table layouts. We compare our synthesizer on these applications to state-of-the-art DSL-specific synthesizers as well to the general purpose synthesizer Sketch.

关键词： languages Experimentation program synthesis end-user programming test driven development

来源：评论

学校读者我要写书评

暂无评论

Expressing and Verifying Probabilistic Assertions 14

Expressing and Verifying Probabilistic Assertions

引用

35th acm sigplan conference on programming language design and implementation (pldi)

作者： Sampson, Adrian Panchekha, Pavel Mytkowicz, Todd McKinley, Kathryn S. Grossman, Dan Ceze, Luis Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781450327848

Traditional assertions express correctness properties that must hold on every program execution. However, many applications have probabilistic outcomes and consequently their correctness properties are also probabilistic (e. g., they identify faces in images, consume sensor data, or run on unreliable hardware). Traditional assertions do not capture these correctness properties. this paper proposes that programmers express probabilistic correctness properties with probabilistic assertions and describes a new probabilistic evaluation approach to efficiently verify these assertions. Probabilistic assertions are Boolean expressions that express the probability that a property will be true in a given execution rather than asserting that the property must always be true. Given either specific inputs or distributions on the input space, probabilistic evaluation verifies probabilistic assertions by first performing distribution extraction to represent the program as a Bayesian network. Probabilistic evaluation then uses statistical properties to simplify this representation to efficiently compute assertion probabilities directly or with sampling. Our approach is a mix of both static and dynamic analysis: distribution extraction statically builds and optimizes the Bayesian network representation and sampling dynamically interprets this representation. We implement our approach in a tool called MAYHAP for C and C++ programs. We evaluate expressiveness, correctness, and performance of MAYHAP on programs that use sensors, perform approximate computation, and obfuscate data for privacy. Our case studies demonstrate that probabilistic assertions describe useful correctness properties and that MAYHAP efficiently verifies them.

关键词： languages Reliability Probabilistic programming approximate computing data obfuscation differential privacy sensors symbolic execution

来源：评论

学校读者我要写书评

暂无评论

Slicing Probabilistic Programs 14

Slicing Probabilistic Programs

引用

35th acm sigplan conference on programming language design and implementation (pldi)

作者： Hur, Chung-Kil Nori, Aditya V. Rajamani, Sriram K. Samuel, Selva Seoul Natl Univ Seoul 151 South Korea

ISBN: (纸本)9781450327848

Probabilistic programs use familiar notation of programming languages to specify probabilistic models. Suppose we are interested in estimating the distribution of the return expression r of a probabilistic program P. We are interested in slicing the probabilistic program P and obtaining a simpler program SLI (P) which retains only those parts of P that are relevant to estimating r, and elides those parts of P that are not relevant to estimating r. We desire that the SLI transformation be both correct and efficient. By correct, we mean that P and SLI (P) have identical estimates on r. By efficient, we mean that estimation over SLI (P) be as fast as possible. We show that the usual notion of program slicing, which traverses control and data dependencies backward from the return expression r, is unsatisfactory for probabilistic programs, since it produces incorrect slices on some programs and sub-optimal ones on others. Our key insight is that in addition to the usual notions of control dependence and data dependence that are used to slice non-probabilistic programs, a new kind of dependence called observe dependence arises naturally due to observe statements in probabilistic programs. We propose a new definition of SLI (P) which is both correct and efficient for probabilistic programs, by including observe dependence in addition to control and data dependences for computing slices. We prove correctness mathematically, and we demonstrate efficiency empirically. We show that by applying the SLI transformation as a pre-pass, we can improve the efficiency of probabilistic inference, not only in our own inference tool R2, but also in other systems for performing inference such as Church and Infer. NET.

关键词： Probabilistic programming Program Slicing Bayesian Reasoning

来源：评论

学校读者我要写书评

暂无评论

Maximal Sound Predictive Race Detection with Control Flow Abstraction 14

Maximal Sound Predictive Race Detection with Control Flow Ab...

引用

35th acm sigplan conference on programming language design and implementation (pldi)

作者： Huang, Jeff Meredith, Patrick O'Neil Rosu, Grigore Univ Illinois Dept Comp Sci Urbana IL 61801 USA

ISBN: (纸本)9781450327848

Despite the numerous static and dynamic program analysis techniques in the literature, data races remain one of the most common bugs in modern concurrent software. Further, the techniques that do exist either have limited detection capability or are unsound, meaning that they report false positives. We present a sound race detection technique that achieves a provably higher detection capability than existing sound techniques. A key insight of our technique is the inclusion of abstracted control flow information into the execution model, which increases the space of the causal model permitted by classical happens-before or causally-precedes based detectors. By encoding the control flow and a minimal set of feasibility constraints as a group of first-order logic formulae, we formulate race detection as a constraint solving problem. Moreover, we formally prove that our formulation achieves the maximal possible detection capability for any sound dynamic race detector with respect to the same input trace under the sequential consistency memory model. We demonstrate via extensive experimentation that our technique detects more races than the other state-of-the-art sound race detection techniques, and that it is scalable to executions of real world concurrent applications with tens of millions of critical events. these experiments also revealed several previously unknown races in real systems (e. g., Eclipse) that have been confirmed or fixed by the developers. Our tool is also adopted by Eclipse developers.

关键词： Algorithms design theory Maximal Sound Data Race Prediction Control Flow

来源：评论

学校读者我要写书评

暂无评论

Surgical Precision JIT Compilers 14

Surgical Precision JIT Compilers

引用

35th acm sigplan conference on programming language design and implementation (pldi)

作者： Rompf, Tiark Sujeeth, Arvind K. Brown, Kevin J. Lee, HyoukJoong Chafi, Hassan Olukotun, Kunle EPFL Zurich Switzerland Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450327848

Just-in-time (JIT) compilation of running programs provides more optimization opportunities than offline compilation. Modern JIT compilers, such as those in virtual machines like Oracle's HotSpot for Java or Google's V8 for JavaScript, rely on dynamic profiling as their key mechanism to guide optimizations. While these JIT compilers offer good average performance, their behavior is a black box and the achieved performance is highly unpredictable. In this paper, we propose to turn JIT compilation into a precision tool by adding two essential and generic metaprogramming facilities: First, allow programs to invoke JIT compilation explicitly. this enables controlled specialization of arbitrary code at run-time, in the style of partial evaluation. It also enables the JIT compiler to report warnings and errors to the program when it is unable to compile a code path in the demanded way. Second, allow the JIT compiler to call back into the program to perform compile-time computation. this lets the program itself define the translation strategy for certain constructs on the fly and gives rise to a powerful JIT macro facility that enables "smart" libraries to supply domain-specific compiler optimizations or safety checks. We present Lancet, a JIT compiler framework for Java bytecode that enables such a tight, two-way integration with the running program. Lancet itself was derived from a high-level Java bytecode interpreter: staging the interpreter using LMS (Lightweight Modular Staging) produced a simple bytecode compiler. Adding abstract interpretation turned the simple compiler into an optimizing compiler. this fact provides compelling evidence for the scalability of the staged-interpreter approach to compiler construction. In the case of Lancet, JIT macros also provide a natural interface to existing LMS-based toolchains such as the Delite parallelism and DSL framework, which can now serve as accelerator macros for arbitrary JVM bytecode.

关键词： design languages Performance JIT Compilation Staging Program Generation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共3页 << < 1 2 3 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：