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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

19 篇 会议

馆藏范围

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

日期分布

学科分类号

17 篇 工学
- 17 篇 计算机科学与技术...
- 17 篇 软件工程
1 篇 理学
- 1 篇 数学
- 1 篇 系统科学
1 篇 管理学
- 1 篇 图书情报与档案管...

主题

3 篇 semantics
2 篇 program synthesi...
2 篇 probabilistic pr...
2 篇 javascript
2 篇 reactive program...
1 篇 synchronous prog...
1 篇 sparse tensor al...
1 篇 comparison
1 篇 compilers
1 篇 uncomputation
1 篇 homomorphic encr...
1 篇 c
1 篇 privacy-preservi...
1 篇 computer-aided d...
1 篇 control plane an...
1 篇 weak memory mode...
1 篇 refinement
1 篇 x86-tso
1 篇 intermediate ver...
1 篇 neural networks

机构

2 篇 univ michigan an...
2 篇 microsoft res re...
2 篇 swiss fed inst t...
2 篇 univ texas austi...
1 篇 univ lisbon ines...
1 篇 mpi sws saarbruc...
1 篇 coll france
1 篇 ecole polytech f...
1 篇 certora raleigh ...
1 篇 princeton univ p...
1 篇 ibm res mit ibm ...
1 篇 google mountain ...
1 篇 calibra seattle ...
1 篇 mit csail 77 mas...
1 篇 microsoft res re...
1 篇 psl res univ eco...
1 篇 mit cambridge ma...
1 篇 mit csail cambri...
1 篇 yale univ new ha...
1 篇 univ maryland co...

作者

2 篇 gehr timon
2 篇 wilcox james r.
2 篇 vechev martin
1 篇 saarikivi olli
1 篇 musuvathi madan
1 篇 willsey max
1 篇 wang xinyu
1 篇 kostova blagoves...
1 篇 mandel louis
1 篇 tatlock zachary
1 篇 berry gerard
1 篇 giannarakis nick
1 篇 ayoun sacha-elie
1 篇 grossman dan
1 篇 dai wei
1 篇 bichsel benjamin
1 篇 baudart guillaum...
1 篇 chen qiaochu
1 篇 gardner philippa
1 篇 loehr devon

语言

19 篇 英文

检索条件"任意字段=41st ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2020"

共 19 条记录，以下是1-10 订阅

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

详细简洁

排序：

pldi 2020 - Proceedings of the 41st acm sigplan conference on programming language design and implementation

PLDI 2020 - Proceedings of the 41st ACM SIGPLAN Conference o...

引用

41st acm sigplan conference on programming language design and implementation, pldi 2020

ISBN: (纸本)9781450376136

The proceedings contain 77 papers. The topics discussed include: data-driven inference of representation invariants;type error feedback via analytic program repair;synthesizing structured CAD models with equality saturation and inverse transformations;compiler and runtime support for continuation marks;from folklore to fact: comparing implementations of stacks and continuations;learning nonlinear loop invariants with gated continuous logic networks;blended, precise semantic program embeddings;and BlankIt library debloating: getting what you want instead of cutting what you don't.

关键词：

来源：评论

学校读者我要写书评

暂无评论

***: (A)Synchronous Reactive Web programming 2020

***: (A)Synchronous Reactive Web Programming

引用

41st acm sigplan conference on programming language design and implementation (pldi)

作者： Berry, Gerard Serrano, Manuel Coll France Paris France UCA INRIA Sophia Antipolis France

ISBN: (纸本)9781450376136

We present ***, a synchronous reactive language that adds synchronous concurrency and preemption to JavaScript. Inspired from Esterel, *** simplifies the programming of non-trivial temporal behaviors as found in complex web interfaces or IoT controllers and the cooperation between synchronous and asynchronous activities. *** is compiled into plain sequential JavaScript and executes on unmodified runtime environments. We use three examples to present and discuss ***: a simple web login form to introduce the language and show how it differs from JavaScript, and two real life examples, a medical prescription pillbox and an interactive music system that show why concurrency and preemption help programming such temporal applications.

关键词： Reactive programming Synchronous programming Web programming JavaScript

来源：评论

学校读者我要写书评

暂无评论

λPSI: Exact Inference for Higher-Order Probabilistic Programs 2020

λPSI: Exact Inference for Higher-Order Probabilistic Progra...

引用

41st acm sigplan conference on programming language design and implementation (pldi)

作者： Gehr, Timon steffen, Samuel Vechev, Martin Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450376136

We present lambda PSI, the first probabilistic programming language and system that supports higher-order exact inference for probabilistic programs with first-class functions, nested inference and discrete, continuous and mixed random variables. lambda PSI's solver is based on symbolic reasoning and computes the exact distribution represented by a program. We show that lambda PSI is practically effective-it automatically computes exact distributions for a number of interesting applications, from rational agents to information theory, many of which could so far only be handled approximately.

关键词： Probabilistic programming Exact Higher-order

来源：评论

学校读者我要写书评

暂无评论

Silq: A High-Level Quantum language with Safe Uncomputation and Intuitive Semantics 2020

Silq: A High-Level Quantum Language with Safe Uncomputation ...

引用

41st acm sigplan conference on programming language design and implementation (pldi)

作者： Bichsel, Benjamin Baader, Maximilian Gehr, Timon Vechev, Martin Swiss Fed Inst Technol Zurich Switzerland

ISBN: (纸本)9781450376136

Existing quantum languages force the programmer to work at a low level of abstraction leading to unintuitive and cluttered code. A fundamental reason is that dropping temporary values from the program state requires explicitly applying quantum operations that safely uncompute these values. We present Silq, the first quantum language that addresses this challenge by supporting safe, automatic uncomputation. This enables an intuitive semantics that implicitly drops temporary values, as in classical computation. To ensure physicality of Silq's semantics, its type system leverages novel annotations to reject unphysical programs. Our experimental evaluation demonstrates that Silq programs are not only easier to read and write, but also significantly shorter than equivalent programs in other quantum languages (on average -46% for Q#, -38% for Quipper), while using only half the number of quantum primitives.

关键词： Quantum language Uncomputation Semantics

来源：评论

学校读者我要写书评

暂无评论

The Essence of Bluespec A Core language for Rule-Based Hardware design 2020

The Essence of Bluespec A Core Language for Rule-Based Hardw...

引用

41st acm sigplan conference on programming language design and implementation (pldi)

作者： Bourgeat, Thomas Pit-Claudel, Clement Chlipala, Adam Arvind MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781450376136

The Bluespec hardware-description language presents a significantly higher-level view than hardware engineers are used to, exposing a simpler concurrency model that promotes formal proof, without compromising on performance of compiled circuits. Unfortunately, the cost model of Bluespec has been unclear, with performance details depending on a mix of user hints and opaque static analysis of potential concurrency conflicts within a design. In this paper we present Koika, a derivative of Bluespec that preserves its desirable properties and yet gives direct control over the scheduling decisions that determine performance. Koika has a novel and deterministic operational semantics that uses dynamic analysis to avoid concurrency anomalies. Our implementation includes Coq definitions of syntax, semantics, key metatheorems, and a verified compiler to circuits. We argue that most of the extra circuitry required for dynamic analysis can be eliminated by compile-time BSV-style static analysis.

关键词： HDL Semantics Compiler Correctness

来源：评论

学校读者我要写书评

暂无评论

Reactive Probabilistic programming 2020

Reactive Probabilistic Programming

引用

41st acm sigplan conference on programming language design and implementation (pldi)

作者： Baudart, Guillaume Mandel, Louis Atkinson, Eric Sherman, Benjamin Pouzet, Marc Carbin, Michael IBM Res MIT IBM Watson AI Lab Armonk NY 10504 USA MIT Cambridge MA 02139 USA PSL Res Univ Ecole Normale Super Paris France

ISBN: (纸本)9781450376136

Synchronous modeling is at the heart of programming languages like Lustre, Esterel, or SCADE used routinely for implementing safety critical control software, e.g., fly-by-wire and engine control in planes. However, to date these languages have had limited modern support for modeling uncertainty - probabilistic aspects of the software's environment or behavior - even though modeling uncertainty is a primary activity when designing a control system. In this paper we present ProbZelus the first synchronous probabilistic programming language. ProbZelus conservatively provides the facilities of a synchronous language to write control software, with probabilistic constructs to model uncertainties and perform inference-in-the-loop. We present the design and implementation of the language. We propose a measure-theoretic semantics of probabilistic stream functions and a simple type discipline to separate deterministic and probabilistic expressions. We demonstrate a semantics-preserving compilation into a first-order functional language that lends itself to a simple presentation of inference algorithms for streaming models. We also redesign the delayed sampling inference algorithm to provide efficient streaming inference. Together with an evaluation on several reactive applications, our results demonstrate that ProbZelus enables the design of reactive probabilistic applications and efficient, bounded memory inference.

关键词： Probabilistic programming Reactive programming streaming inference Semantics Compilation

来源：评论

学校读者我要写书评

暂无评论

From Folklore to Fact: Comparing implementations of stacks and Continuations 2020

From Folklore to Fact: Comparing Implementations of Stacks a...

引用

41st acm sigplan conference on programming language design and implementation (pldi)

作者： Farvardin, Kavon Reppy, John Univ Chicago Comp Sci Chicago IL 60637 USA

ISBN: (纸本)9781450376136

The efficient implementation of function calls and non-local control transfers is a critical part of modern language implementations and is important in the implementation of everything from recursion, higher-order functions, concurrency and coroutines, to task-based parallelism. In a compiler, these features can be supported by a variety of mechanisms, including call stacks, segmented stacks, and heap-allocated continuation closures. An implementor of a high-level language with advanced control features might ask the question lwhat is the best choice for my implementation?z Unfortunately, the current literature does not provide much guidance, since previous studies suffer from various flaws in methodology and are outdated for modern hardware. In the absence of recent, well-normalized measurements and a holistic overview of their implementation specifics, the path of least resistance when choosing a strategy is to trust folklore, but the folklore is also suspect. This paper attempts to remedy this situation by providing an lapples-to-applesz comparison of six different approaches to implementing call stacks and continuations. This comparison uses the same source language, compiler pipeline, LLVM-backend, and runtime system, with the only differences being those required by the differences in implementation strategy. We compare the implementation challenges of the different approaches, their sequential performance, and their suitability to support advanced control mechanisms, including supporting heavily threaded code. In addition to the comparison of implementation strategies, the paper's contributions also include a number of useful implementation techniques that we discovered along the way.

关键词： Call stacks Concurrency Continuations Compilers Functional programming

来源：评论

学校读者我要写书评

暂无评论

NV: An Intermediate language for Verification of Network Control Planes 2020

NV: An Intermediate Language for Verification of Network Con...

引用

41st acm sigplan conference on programming language design and implementation (pldi)

作者： Giannarakis, Nick Loehr, Devon Beckett, Ryan Walker, David Princeton Univ Princeton NJ 08544 USA Microsoft Res Redmond WA USA

ISBN: (纸本)9781450376136

Network misconfiguration has caused a raft of high-profile outages over the past decade, spurring researchers to develop a variety of network analysis and verification tools. Unfortunately, developing and maintaining such tools is an enormous challenge due to the complexity of network configuration languages. Inspired by work on intermediate languages for verification such as Boogie and Why3, we develop NV, an intermediate language for verification of network control planes. NV carefully walks the line between expressiveness and tractability, making it possible to build models for a practical subset of real protocols and their configurations, and also facilitate rapid development of tools that outperform state-of-the-art simulators (seconds vs minutes) and verifiers (often 10x faster). Furthermore, we show that it is possible to develop novel analyses just by writing new NV programs. In particular, we implement a new fault-tolerance analysis that scales to far larger networks than existing tools.

关键词： Network Verification Network Simulation Control Plane Analysis Router Configuration Analysis Intermediate Verification language

来源：评论

学校读者我要写书评

暂无评论

Gillian, Part I: A Multi-language Platform for Symbolic Execution 2020

Gillian, Part I: A Multi-language Platform for Symbolic Exec...

引用

41st acm sigplan conference on programming language design and implementation (pldi)

作者： Santos, Jose Fragoso Maksimovic, Petar Ayoun, Sacha-Elie Gardner, Philippa Univ Lisbon INESC ID Inst Super Tecn Lisbon Portugal Imperial Coll London London England

ISBN: (纸本)9781450376136

We introduce Gillian, a platform for developing symbolic analysis tools for programming languages. Here, we focus on the symbolic execution engine at the heart of Gillian, which is parametric on the memory model of the target language. We give a formal description of the symbolic analysis and a modular implementation that closely follows this description. We prove a parametric soundness result, introducing restriction on abstract states, which generalises path conditions used in classical symbolic execution. We instantiate Gillian to obtain trusted symbolic testing tools for JavaScript and C, and use these tools to find bugs in real-world code, thus demonstrating the viability of our parametric approach.

关键词： Symbolic execution parametric semantics bug-finding bounded verification JavaScript C

来源：评论

学校读者我要写书评

暂无评论

Towards an API for the Real Numbers 2020

Towards an API for the Real Numbers

引用

41st acm sigplan conference on programming language design and implementation (pldi)

作者： Boehm, Hans-J Google Mountain View CA 94043 USA

ISBN: (纸本)9781450376136

The real numbers are pervasive, both in daily life, and in mathematics. students spend much time studying their properties. Yet computers and programming languages generally provide only an approximation geared towards performance, at the expense of many of the nice properties we were taught in high school. Although this is entirely appropriate for many applications, particularly those that are sensitive to arithmetic performance in the usual sense, we argue that there are others where it is a poor choice. If arithmetic computations and result are directly exposed to human users who are not floating point experts, floating point approximations tend to be viewed as bugs. For applications such as calculators, spreadsheets, and various verification tasks, the cost of precision sacrifices is high, and the performance benefit is often not critical. We argue that previous attempts to provide accurate and understandable results for such applications using the recursive reals were great steps in the right direction, but they do not suffice. Comparing recursive reals diverges if they are equal. In many cases, comparison of numbers, including equal ones, is both important, particularly in simple cases, and intractable in the general case. We propose an API for a real number type that explicitly provides decidable equality in the easy common cases, in which it is often unnatural not to. We describe a surprisingly compact and simple implementation in detail. The approach relies heavily on classical number theory results. We demonstrate the utility of such a facility in two applications: testing floating point functions, and to implement arithmetic in Google's Android calculator application.

关键词： real numbers API design comparison decidability

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：