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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

264 篇 会议
2 册 图书
2 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

216 篇 工学
- 209 篇 软件工程
- 91 篇 计算机科学与技术...
- 6 篇 电气工程
- 3 篇 控制科学与工程
- 2 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 信息与通信工程
- 1 篇 石油与天然气工程
- 1 篇 生物工程
7 篇 管理学
- 4 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 1 篇 工商管理
6 篇 理学
- 5 篇 数学
- 1 篇 生物学
1 篇 教育学
- 1 篇 教育学

主题

49 篇 design
39 篇 languages
21 篇 performance
14 篇 algorithms
14 篇 probabilistic pr...
14 篇 verification
12 篇 object oriented ...
11 篇 program synthesi...
11 篇 functional progr...
10 篇 reliability
10 篇 programming lang...
9 篇 concurrency
8 篇 experimentation
8 篇 type systems
8 篇 domain-specific ...
7 篇 java
7 篇 theory
6 篇 program analysis
6 篇 optimization
5 篇 compilers

机构

8 篇 purdue univ w la...
7 篇 carnegie mellon ...
5 篇 harvard univ cam...
5 篇 univ penn philad...
5 篇 stanford univ st...
4 篇 univ wisconsin m...
4 篇 princeton univ p...
4 篇 univ calif davis...
4 篇 northeastern uni...
4 篇 cornell univ ith...
4 篇 univ washington ...
3 篇 microsoft res re...
3 篇 swiss fed inst t...
3 篇 mit cambridge ma...
3 篇 yale univ new ha...
3 篇 rice univ housto...
3 篇 univ calif berke...
3 篇 univ texas austi...
2 篇 microsoft corp r...
2 篇 oracle labs pots...

作者

5 篇 foster nate
5 篇 gulwani sumit
5 篇 walker david
4 篇 dillig isil
3 篇 huang jeff
3 篇 vechev martin
3 篇 shao zhong
3 篇 su zhendong
3 篇 chaudhuri swarat
3 篇 myers andrew c.
3 篇 zhang xiangyu
3 篇 mansinghka vikas...
2 篇 hirschfeld rober...
2 篇 flatt matthew
2 篇 gupta gagan
2 篇 shull thomas
2 篇 yahav eran
2 篇 rajamani sriram
2 篇 niephaus fabio
2 篇 choi jiho

语言

266 篇 英文
2 篇 中文

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

共 268 条记录，以下是81-90 订阅

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

详细简洁

排序：

A Domain-Specific language for Exploratory Data Visualization 2018

A Domain-Specific Language for Exploratory Data Visualizatio...

引用

17th acm sigplan International conference on Generative programming - Concepts and Experiences (GPCE) part of the SPLASH Collection of conferences and Workshops

作者： Smeltzer, Karl Erwig, Martin Oregon State Univ Corvallis OR 97331 USA

ISBN: (纸本)9781450360456

With an ever-growing amount of collected data, the importance of visualization as an analysis component is growing in concert. the creation of good visualizations often doesn't happen in one step but is rather an iterative and exploratory process. However, this process is currently not well supported in most of the available visualization tools and systems. Visualization authors are forced to commit prematurely to particular design aspects of their creations, and when exploring potential variant visualizations, they are forced to adopt ad hoc techniques such as copying code snippets or keeping a collection of separate files. We propose variational visualizations as a model supporting open-ended exploration of the design space of information visualization. Together with that model, we present a prototype implementation in the form of a domain-specific language embedded in Purescript.

关键词： Data Visualization Exploratory programming

来源：评论

学校读者我要写书评

暂无评论

Scalable Verification of Probabilistic Networks 2019

Scalable Verification of Probabilistic Networks

引用

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

作者： Smolka, Steffen Kumar, Praveen Kahn, David M. Foster, Nate Hsu, Justin Kozen, Dexter Silva, Alexandra Cornell Univ Ithaca NY 14850 USA Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ Wisconsin Madison WI USA UCL London England

ISBN: (纸本)9781450367127

this paper presents McNetKAT, a scalable tool for verifying probabilistic network programs. McNetKAT is based on a new semantics for the guarded and history-free fragment of Probabilistic NetKAT in terms of finite-state, absorbing Markov chains. this view allows the semantics of all programs to be computed exactly, enabling construction of an automatic verification tool. Domain-specific optimizations and a parallelizing backend enable McNetKAT to analyze networks with thousands of nodes, automatically reasoning about general properties such as probabilistic program equivalence and refinement, as well as networking properties such as resilience to failures. We evaluate McNetKAT's scalability using real-world topologies, compare its performance against state-of-the-art tools, and develop an extended case study on a recently proposed data center network design.

关键词： Network verification Probabilistic programming

来源：评论

学校读者我要写书评

暂无评论

Fast Algorithms for Dyck-CFL-Reachability with Applications to Alias Analysis

Fast Algorithms for Dyck-CFL-Reachability with Applications ...

引用

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

作者： Zhang, Qirun Lyu, Michael R. Yuan, Hao Su, Zhendong Chinese Univ Hong Kong Hong Kong Hong Kong Peoples R China Univ Calif Davis Davis CA 95616 USA City Univ Hong Kong Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781450320146

the context-free language (CFL) reachability problem is a well-known fundamental formulation in program analysis. In practice, many program analyses, especially pointer analyses, adopt a restricted version of CFL-reachability, Dyck-CFL-reachability, and compute on edge-labeled bidirected graphs. Solving the all-pairs Dyck-CFL-reachability on such bidirected graphs is expensive. For a bidirected graph with n nodes and m edges, the traditional dynamic programming style algorithm exhibits a subcubic time complexity for the Dyck language with k kinds of parentheses. When the underlying graphs are restricted to bidirected trees, an algorithm with O(n log n log k) time complexity was proposed recently. this paper studies the Dyck-CFL-reachability problems on bidirected trees and graphs. In particular, it presents two fast algorithms with O(n) and O(n+m log m) time complexities on trees and graphs respectively. We have implemented and evaluated our algorithms on a state-of-the-art alias analysis for Java. Results on standard benchmarks show that our algorithms achieve orders of magnitude speedup and consume less memory.

关键词： Algorithms design Experimentation languages Dyck-CFL-reachability alias analysis

来源：评论

学校读者我要写书评

暂无评论

Higher-Order and Tuple-Based Massively-Parallel Prefix Sums 16

Higher-Order and Tuple-Based Massively-Parallel Prefix Sums

引用

37th acm sigplan conference on programming language design and implementation

作者： Maleki, Sepideh Yang, Annie Burtscher, Martin Texas State Univ Dept Comp Sci San Marcos TX 78666 USA

ISBN: (纸本)9781450342612

Prefix sums are an important parallel primitive, especially in massively-parallel programs. this paper discusses two orthogonal generalizations thereof, which we call higher-order and tuple-based prefix sums. Moreover, it describes and evaluates SAM, a GPU-friendly algorithm for computing prefix sums and other scans that directly supports higher orders and tuple values. Its templated CUDA implementation unifies all of these computations in a single 100-statement kernel. SAM is communication-efficient in the sense that it minimizes main-memory accesses. When computing prefix sums of a million or more values, it outperforms thrust and CUDPP on both a Titan X and a K40 GPU. On the Titan X, SAM reaches memory-copy speeds for large input sizes, which cannot be surpassed. SAM outperforms CUB, the currently fastest conventional prefix sum implementation, by up to a factor of 2.9 on eighth-order prefix sums and by up to a factor of 2.6 on eight-tuple prefix sums.

关键词： Algorithms Performance design Higher-order prefix sums tuple-based prefix sums carry propagation GPU programming

来源：评论

学校读者我要写书评

暂无评论

Static Analysis for Probabilistic Programs: Inferring Whole Program Properties from Finitely Many Paths

Static Analysis for Probabilistic Programs: Inferring Whole ...

引用

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

作者： Sankaranarayanan, Sriram Chakarov, Aleksandar Gulwani, Sumit Univ Colorado Boulder CO 80309 USA Microsoft Res Redmond WA USA

ISBN: (纸本)9781450320146

We propose an approach for the static analysis of probabilistic programs that sense, manipulate, and control based on uncertain data. Examples include programs used in risk analysis, medical decision making and cyber-physical systems. Correctness properties of such programs take the form of queries that seek the probabilities of assertions over program variables. We present a static analysis approach that provides guaranteed interval bounds on the values (assertion probabilities) of such queries. First, we observe that for probabilistic programs, it is possible to conclude facts about the behavior of the entire program by choosing a finite, adequate set of its paths. We provide strategies for choosing such a set of paths and verifying its adequacy. the queries are evaluated over each path by a combination of symbolic execution and probabilistic volume-bound computations. Each path yields interval bounds that can be summed up with a "coverage" bound to yield an interval that encloses the probability of assertion for the program as a whole. We demonstrate promising results on a suite of benchmarks from many different sources including robotic manipulators and medical decision making programs.

关键词： Probabilistic programming Program Verification Volume Bounding Symbolic Execution Monte-Carlo Sampling

来源：评论

学校读者我要写书评

暂无评论

Developing a Monadic Type Checker for an Object-Oriented language: An Experience Report 12

Developing a Monadic Type Checker for an Object-Oriented Lan...

引用

12th acm sigplan International conference on Software language Engineering (SLE)

作者： Castegren, Elias Fernandez-Reyes, Kiko KTH Royal Inst Technol Software & Comp Syst Stockholm Sweden Uppsala Univ Informat Technol Uppsala Sweden

ISBN: (纸本)9781450369817

Functional programming languages are well-suited for developing compilers, and compilers for functional languages are often themselves written in a functional language. Functional abstractions, such as monads, allow abstracting away some of the repetitive structure of a compiler, removing boilerplate code and making extensions simpler. Even so, functional languages are rarely used to implement compilers for languages of other paradigms. this paper reports on the experience of a four-year long project where we developed a compiler for a concurrent, object-oriented language using the functional language Haskell. the focus of the paper is the implementation of the type checker, but the design works well in static analysis tools, such as tracking uniqueness of variables to ensure data-race freedom. the paper starts from a simple type checker to which we add more complex features, such as type state, with minimal changes to the overall initial design.

关键词： functional programming object-oriented languages type systems compilers

来源：评论

学校读者我要写书评

暂无评论

Extensible algebraic datatypes with defaults 01

Extensible algebraic datatypes with defaults

引用

6th International conference on Functional programming (ICFP 2001)

作者： Zenger, M Odersky, M Swiss Fed Inst Technol INR Ecublens CH-1015 Lausanne Switzerland

ISBN: (纸本)9781581134155

A major problem for writing extensible software arises when recursively defined datatypes and operations on these types have to be extended simultaneously without modifying existing code. this paper introduces Extensible Algebraic Datatypes with Defaults which promote a simple programming pattern to solve this well known problem. We show that it is possible to encode extensible algebraic datatypes in an object-oriented language, using a new design pattern for extensible visitors. Extensible algebraic datatypes have been successfully applied in the implementation of an extensible Java compiler. Our technique allows for the reuse of existing components in compiler extensions without the need for any adaptations.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

VeriML: Typed Computation of Logical Terms inside a language with Effects 10

VeriML: Typed Computation of Logical Terms inside a Language...

引用

15th acm sigplan International conference on Functional programming

作者： Stampoulis, Antonis Shao, Zhong Yale Univ Dept Comp Sci New Haven CT 06520 USA

ISBN: (纸本)9781605587943

Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explicit machine-checkable proof objects. Unfortunately, large scale proof development in these proof assistants is still an extremely difficult and time-consuming task. One major weakness of these proof assistants is the lack of a single language where users can develop complex tactics and decision procedures using a rich programming model and in a typeful manner. this limits the scalability of the proof development process, as users avoid developing domain-specific tactics and decision procedures. In this paper, we present VeriML-a novel language design that couples a type-safe effectful computational language with first-class support for manipulating logical terms such as propositions and proofs. the main idea behind our design is to integrate a rich logical framework-similar to the one supported by Coq-inside a computational language inspired by ML. the language design is such that the added features are orthogonal to the rest of the computational language, and also do not require significant additions to the logic language, so soundness is guaranteed. We have built a prototype implementation of VeriML including both its type-checker and an interpreter. We demonstrate the effectiveness of our design by showing a number of type-safe tactics and decision procedures written in VeriML.

关键词： proof assistants type theory dependent types logical frameworks

来源：评论

学校读者我要写书评

暂无评论

What exactly is inexact computation good for?

What exactly is inexact computation good for?

引用

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

作者： Palem, Krishna Rice Univ Dept Comp Sci Houston TX 77251 USA

ISBN: (纸本)9781450327848

Our willingness to deliberately trade accuracy of computing systems for significant resource savings, notably energy consumption, got a boost from two directions. First, energy (or power, the more popularly used measure) consumption started emerging as a serious hurdle to our ability to continue scaling the complexity of processors, and thus enable ever richer computing applications. this "energy hurdle" spanned the gamut from large data-centers to portable embedded computing systems. Second, many believed that an engine of growth that supported scaling, captured by Gordon Moore's remarkable prophecy (Moore's law), was headed towards an irrevocable cliff edge - when this happens, our ability to produce computing systems whose hardware would support precise or exact computing would diminish greatly. In this talk which emphasizes the physical and hardware layers of abstraction where all of these troubles start (after all energy is rooted in thermodynamics), I will first review reasons that compelled and encouraged us to consider trading accuracy for energy savings deliberately resulting in inexact computing. Copyright © 2014 acm.

关键词： Algorithms design languages Performance Inexact or approximate computing power efficiency energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Extensible language implementation with Object Algebras (Short Paper) 2014

Extensible Language Implementation with Object Algebras (Sho...

引用

13th conference on Generative programming - Concepts and Experiences (GPCE)

作者： Gouseti, Maria Peters, Chiel van der Storm, Tijs CWI NL-1009 AB Amsterdam Netherlands

ISBN: (纸本)9781450331616

Object Algebras are a recently introduced design pattern to make the implementation of recursive data types more extensible. In this short paper we report our experience in using Object Algebras in building a realistic domain- specific language (DSL) for questionnaires, called QL. this experience has led to a simple, yet powerful set of tools for the practical and flexible implementation of highly extensible languages.

关键词： Object Algebras extensibility interpreter design languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共27页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：