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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

278 篇 会议
39 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

273 篇 工学
- 266 篇 软件工程
- 139 篇 计算机科学与技术...
- 7 篇 电气工程
- 3 篇 生物工程
- 2 篇 信息与通信工程
- 2 篇 控制科学与工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 化学工程与技术
- 1 篇 纺织科学与工程
- 1 篇 生物医学工程（可授...
10 篇 理学
- 8 篇 数学
- 1 篇 化学
- 1 篇 地质学
- 1 篇 生物学
6 篇 管理学
- 3 篇 管理科学与工程(可...
- 3 篇 图书情报与档案管...
2 篇 农学
- 2 篇 作物学
1 篇 教育学
- 1 篇 教育学

主题

80 篇 design
73 篇 languages
32 篇 performance
17 篇 verification
16 篇 algorithms
14 篇 reliability
14 篇 probabilistic pr...
13 篇 object oriented ...
13 篇 program synthesi...
13 篇 domain-specific ...
13 篇 functional progr...
11 篇 java
10 篇 experimentation
10 篇 programming lang...
9 篇 type systems
9 篇 theory
9 篇 concurrency
7 篇 compilers
7 篇 optimization
6 篇 modules

机构

9 篇 carnegie mellon ...
8 篇 purdue univ w la...
6 篇 princeton univ p...
5 篇 northeastern uni...
5 篇 yale univ new ha...
5 篇 harvard univ cam...
5 篇 cornell univ ith...
5 篇 univ washington ...
5 篇 univ calif berke...
4 篇 univ wisconsin m...
4 篇 univ calif davis...
4 篇 univ utah salt l...
4 篇 univ penn philad...
4 篇 rice univ housto...
4 篇 univ chicago il ...
4 篇 stanford univ st...
4 篇 univ texas austi...
3 篇 mit csail cambri...
3 篇 univ cambridge c...
3 篇 microsoft res re...

作者

7 篇 walker david
6 篇 foster nate
5 篇 shao zhong
5 篇 gulwani sumit
5 篇 dillig isil
4 篇 rainey mike
4 篇 gu ronghui
4 篇 rompf tiark
4 篇 solar-lezama arm...
4 篇 chaudhuri swarat
4 篇 myers andrew c.
4 篇 wansbrough keith
3 篇 hirschfeld rober...
3 篇 flatt matthew
3 篇 rajamani sriram
3 篇 seshia sanjit a.
3 篇 rajan hridesh
3 篇 huang jeff
3 篇 liu yu david
3 篇 vechev martin

语言

283 篇 英文
33 篇 其他
1 篇 中文

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

共 317 条记录，以下是41-50 订阅

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

详细简洁

排序：

Bayonet: Probabilistic Inference for Networks 2018

Bayonet: Probabilistic Inference for Networks

引用

39th acm sigplan conference on programming language design and implementation (PLDI)

作者： Gehr, Timon Misailovic, Sasa Tsankov, Petar Vanbever, Laurent Wiesmann, Pascal Vechev, Martin Swiss Fed Inst Technol Zurich Switzerland UIUC Champaign IL USA

ISBN: (纸本)9781450356985

Network operators often need to ensure that important probabilistic properties are met, such as that the probability of network congestion is below a certain threshold. Ensuring such properties is challenging and requires both a suitable language for probabilistic networks and an automated procedure for answering probabilistic inference queries. We present BAYONET, a novel approach that consists of: (i) a probabilistic network programming language and (ii) a system that performs probabilistic inference on BAYONET programs. the key insight behind BAYONET is to phrase the problem of probabilistic network reasoning as inference in existing probabilistic languages. As a result, BAYONET directly leverages existing probabilistic inference systems and offers a flexible and expressive interface to operators. We present a detailed evaluation of BAYONET on common network scenarios, such as network congestion, reliability of packet delivery, and others. Our results indicate that BAYONET can express such practical scenarios and answer queries for realistic topology sizes (with up to 30 nodes).

关键词： Probabilistic programming Computer Networks

来源：评论

学校读者我要写书评

暂无评论

Code Completion with Statistical language Models 14

Code Completion with Statistical Language Models

引用

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

作者： Raychev, Veselin Vechev, Martin Yahav, Eran Swiss Fed Inst Technol Zurich Switzerland Technion Haifa Israel

ISBN: (纸本)9781450327848

We address the problem of synthesizing code completions for programs using APIs. Given a program with holes, we synthesize completions for holes with the most likely sequences of method calls. Our main idea is to reduce the problem of code completion to a natural-language processing problem of predicting probabilities of sentences. We design a simple and scalable static analysis that extracts sequences of method calls from a large codebase, and index these into a statistical language model. We then employ the language model to find the highest ranked sentences, and use them to synthesize a code completion. Our approach is able to synthesize sequences of calls across multiple objects together with their arguments. Experiments show that our approach is fast and effective. Virtually all computed completions typecheck, and the desired completion appears in the top 3 results in 90% of the cases.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Aspectual Caml: an aspect-oriented functional language 05

Aspectual Caml: an aspect-oriented functional language

引用

10th acm sigplan International conference on Functional programming (ICFP)

作者： Masuhara, H Tatsuzawa, H Yonezawa, A Univ Tokyo Grad Sch Arts & Sci Tokyo Japan Univ Tokyo Dept Comp Sci Tokyo Japan Univ Tokyo Dept Comp Sci Tokyo Japan

ISBN: (纸本)9781595930644

We propose an aspect-oriented programming (AOP) language called Aspectual Caml based on a strongly-typed functional language Objective Caml with two AOP mechanisms similar to those in AspectJ language. this paper describes the design and implementation issues of those AOP mechanisms that give us insights into the interaction between AOP features and common features in strongly-typed functional languages such as type inference, polymorphic types and curried functions. We implemented a prototype compiler of the language and used the language for separating crosscutting concerns in application programs, including for separating descriptions of a type system from compiler descriptions.

关键词： aspect-oriented programming objective Caml pointcut and advice

来源：评论

学校读者我要写书评

暂无评论

Incremental Precision-Preserving Symbolic Inference for Probabilistic Programs 2019

Incremental Precision-Preserving Symbolic Inference for Prob...

引用

40th acm sigplan conference on programming language design and implementation (PLDI) part of acm's Federated Computing Research conference (FCRC)

作者： Zhang, Jieyuan Xue, Jingling UNSW Sydney Sch Comp Sci & Engn Sydney NSW Australia

ISBN: (纸本)9781450367127

We present ISymb, an incremental symbolic inference framework for probabilistic programs in situations when some loop-manipulated array data, upon which their probabilistic models are conditioned, undergoes small changes. To tackle the path explosion challenge, ISymb is intra-procedurally path-sensitive except that it conducts a "meet-over-all-paths" analysis within an iteration of a loop (conditioned on some observed array data). By recomputing only the probability distributions for the paths affected, ISymb avoids expensive symbolic inference from scratch while also being precision-preserving. Our evaluation with a set of existing benchmarks shows that ISymb can lead to orders of magnitude performance improvements compared to its non-incremental counterpart (under small changes in observed array data).

关键词： Probabilistic programming Symbolic Inference Incremental Computation Static analysis

来源：评论

学校读者我要写书评

暂无评论

Reconciling Exhaustive Pattern Matching with Objects

Reconciling Exhaustive Pattern Matching with Objects

引用

34th acm sigplan conference on programming language design and implementation (PLDI)

作者： Isradisaikul, Chinawat Myers, Andrew C. Cornell Univ Dept Comp Sci Ithaca NY 14853 USA

ISBN: (纸本)9781450320146

Pattern matching, an important feature of functional languages, is in conflict with data abstraction and extensibility, which are central to object-oriented languages. Modal abstraction offers an integration of deep pattern matching and convenient iteration abstractions into an object-oriented setting;however, because of data abstraction, it is challenging for a compiler to statically verify properties such as exhaustiveness. In this work, we extend modal abstraction in the JMatch language to support static, modular reasoning about exhaustiveness and redundancy. New matching specifications allow these properties to be checked using an SMT solver. We also introduce expressive pattern-matching constructs. Our evaluation shows that these new features enable more concise code and that the performance of checking exhaustiveness and redundancy is acceptable.

关键词： JMatch pattern matching named constructor equality constructor matching specification exhaustiveness redundancy modal abstraction Java data abstraction subtyping design Verification languages

来源：评论

学校读者我要写书评

暂无评论

A Simpler, Safer programming and Execution Model for Intermittent Systems 15

A Simpler, Safer Programming and Execution Model for Intermi...

引用

36th acm sigplan conference on programming language design and implementation

作者： Lucia, Brandon Ransford, Benjamin Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ Washington Seattle WA 98195 USA

ISBN: (纸本)9781450334686

Energy harvesting enables novel devices and applications without batteries, but intermittent operation under energy harvesting poses new challenges to memory consistency that threaten to leave applications in failed states not reachable in continuous execution. this paper presents analytical models that aid in reasoning about intermittence. Using these, we develop DINO (Death Is Not an Option), a programming and execution model that simplifies programming for intermittent systems and ensures volatile and nonvolatile data consistency despite near-constant interruptions. DINO is the first system to address these consistency problems in the context of intermittent execution. We evaluate DINO on three energy-harvesting hardware platforms running different applications. the applications fail and exhibit error without DINO, but run correctly with DINO's modest 1.8-2.7x run-time overhead. DINO also dramatically simplifies programming, reducing the set of possible failure-related control transfers by 5-9x.

关键词： Intermittent computing

来源：评论

学校读者我要写书评

暂无评论

GraalSqueak Toward a Smalltalk-Based Tooling Platform for Polyglot programming 16

GraalSqueak Toward a Smalltalk-Based Tooling Platform for Po...

引用

16th acm sigplan International conference on Managed programming languages and Runtimes (MPLR)

作者： Niephaus, Fabio Felgentreff, Tim Hirschfeld, Robert Univ Potsdam Hasso Plattner Inst Potsdam Germany Oracle Labs Potsdam Germany

ISBN: (纸本)9781450369770

Polyglot programming provides software developers with a broader choice in terms of software libraries and frameworks available for building applications. Previous research and engineering activities have focused on language interoperability and the design and implementation of fast polyglot runtimes. To make polyglot programming more approachable for developers, novel software development tools are needed that help them build polyglot applications. We believe a suitable prototyping platform helps to more quickly evaluate new ideas for such tools. In this paper we present GraalSqueak, a Squeak/Smalltalk virtual machine implementation for the GraalVM. We report our experience implementing GraalSqueak, evaluate the performance of the language and the programming environment, and discuss how the system can be used as a tooling platform for polyglot programming.

关键词： Squeak/Smalltalk virtual machines Truffle GraalVM polyglot programming tools live development

来源：评论

学校读者我要写书评

暂无评论

CONCURRIT: A Domain Specific language for Reproducing Concurrency Bugs

CONCURRIT: A Domain Specific Language for Reproducing Concur...

引用

34th acm sigplan conference on programming language design and implementation (PLDI)

作者： Elmas, Tayfun Burnim, Jacob Necula, George Sen, Koushik Univ Calif Berkeley Dept Elect Engn & Comp Sci Berkeley CA 94720 USA

ISBN: (纸本)9781450320146

We present CONCURRIT, a domain-specific language (DSL) for reproducing concurrency bugs. Given some partial information about the nature of a bug in an application, a programmer can write a CONCURRIT script to formally and concisely specify a set of thread schedules to explore in order to find a schedule exhibiting the bug. Further, the programmer can specify how these thread schedules should be searched to find a schedule that reproduces the bug. We implemented CONCURRIT as an embedded DSL in C++, which uses manual or automatic source instrumentation to partially control the scheduling of the software under test. Using CONCURRIT, we were able to write concise tests to reproduce concurrency bugs in a variety of benchmarks, including the Mozilla's Spider-Monkey JavaScript engine, Memcached, Apache's HTTP server, and MySQL.

关键词： Concurrency Errors Domain-Specific languages Software Testing

来源：评论

学校读者我要写书评

暂无评论

Getting F-Bounded Polymorphism into Shape 14

Getting F-Bounded Polymorphism into Shape

引用

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

作者： Greenman, Ben Muehlboeck, Fabian Tate, Ross Cornell Univ Ithaca NY 14853 USA

ISBN: (纸本)9781450327848

We present a way to restrict recursive inheritance without sacrificing the benefits of F-bounded polymorphism. In particular, we distinguish two new concepts, materials and shapes, and demonstrate through a survey of 13.5 million lines of open-source generic-Java code that these two concepts never actually overlap in practice. With this Material-Shape Separation, we prove that even naive type-checking algorithms are sound and complete, some of which address problems that were unsolvable even under the existing proposals for restricting inheritance. We illustrate how the simplicity of our design reflects the design intuitions employed by programmers and potentially enables new features coming into demand for upcoming programming languages.

关键词： Algorithms design languages Materials Shapes Separation Subtyping F-Bounded Polymorphism Variance Decidability Joins Higher-Kinded Types

来源：评论

学校读者我要写书评

暂无评论

the design and implementation of Typed Scheme

The Design and Implementation of Typed Scheme

引用

35th acm-sigplan-SIGACT Symposium on Principles of programming languages

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

ISBN: (纸本)9781595936899

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. © 2008 acm.

关键词： Type Systems Scheme

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共32页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：