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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是31-40 订阅

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

详细简洁

排序：

Practical Partial Evaluation for High-Performance Dynamic language Runtimes 2017

Practical Partial Evaluation for High-Performance Dynamic La...

引用

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

作者： Wurthinger, thomas Wimmer, Christian Humer, Christian Woess, Andreas Stadler, Lukas Seaton, Chris Duboscq, Gilles Simon, Doug Grimmer, Matthias Oracle Labs Zurich Switzerland Johannes Kepler Univ Linz Inst Syst Software Linz Austria

ISBN: (纸本)9781450349888

Most high-performance dynamic language virtual machines duplicate language semantics in the interpreter, compiler, and runtime system. this violates the principle to not repeat yourself. In contrast, we define languages solely by writing an interpreter. the interpreter performs specializations, e.g., augments the interpreted program with type information and profiling information. Compiled code is derived automatically using partial evaluation while incorporating these specializations. this makes partial evaluation practical in the context of dynamic languages: It reduces the size of the compiled code while still compiling all parts of an operation that are relevant for a particular program. When a speculation fails, execution transfers back to the interpreter, the program re-specializes in the interpreter, and later partial evaluation again transforms the new state of the interpreter to compiled code. We evaluate our approach by comparing our implementations of JavaScript, Ruby, and R with best-inclass specialized production implementations. Our general-purpose compilation system is competitive with production systems even when they have been heavily optimized for the one language they support. For our set of benchmarks, our speedup relative to the V8 JavaScript VM is 0.83x, relative to JRuby is 3.8x, and relative to GNU R is 5x.

关键词： dynamic languages virtual machine language implementation optimization partial evaluation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

language support for regions 01

Language support for regions

引用

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

作者： Gay, D Aiken, A Univ Calif Berkeley Dept EECS Berkeley CA 94720 USA

ISBN: (纸本)9781581134148

Region-based memory management systems structure memory by grouping objects in regions under program control. Memory is reclaimed by deleting regions, freeing all objects stored therein. Our compiler for C with regions, RC, prevents unsafe region deletions by keeping a count of references to each region. Using type annotations that make the structure of a program's regions more explicit, we reduce the overhead of reference counting from a maximum of 27% to a maximum of 11% on a suite of realistic benchmarks. We generalise these annotations in a region type system whose main novelty is the use of existentially quantified abstract regions to represent pointers to objects whose region is partially or totally unknown. A distribution of RC is available at http://***/(similar to)dgay/***. gz.

关键词： Data storage equipment

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

From Datalog to FLIX: A Declarative language for Fixed Points on Lattices 16

From Datalog to FLIX: A Declarative Language for Fixed Point...

引用

37th acm sigplan conference on programming language design and implementation

作者： Madsen, Magnus Yee, Ming-Ho Lhotak, Ondrej Univ Waterloo Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9781450342612

We present FLIX, a declarative programming language for specifying and solving least fixed point problems, particularly static program analyses. FLIX is inspired by Datalog and extends it with lattices and monotone functions. Using FLIX, implementors of static analyses can express a broader range of analyses than is currently possible in pure Datalog, while retaining its familiar rule-based syntax. We define a model-theoretic semantics of FLIX as a natural extension of the Datalog semantics. this semantics captures the declarative meaning of FLIX programs without imposing any specific evaluation strategy. An efficient strategy is semi-naive evaluation which we adapt for FLIX. We have implemented a compiler and runtime for FLIX, and used it to express several well-known static analyses, including the IFDS and IDE algorithms. the declarative nature of FLIX clearly exposes the similarity between these two algorithms.

关键词： logic programming static analysis Datalog Logic programming Static Analysis

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Renaissance: Benchmarking Suite for Parallel Applications on the JVM 2019

Renaissance: Benchmarking Suite for Parallel Applications on...

引用

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

作者： Prokopec, Aleksandar Rosa, Andrea Leopoldseder, David Duboscq, Gilles Tuma, Petr Studener, Martin Bulej, Lubomir Zheng, Yudi Villazon, Alex Simon, Doug Wurthinger, thomas Binder, Walter Oracle Labs Zurich Switzerland Univ Svizzera Italiana Lugano Switzerland Johannes Kepler Univ Linz Linz Austria Charles Univ Prague Prague Czech Republic Univ Privada Boliviana Colcapirhua Bolivia

ISBN: (纸本)9781450367127

Established benchmark suites for the Java Virtual Machine (JVM), such as DaCapo, ScalaBench, and SPECjvm2008, lack workloads that take advantage of the parallel programming abstractions and concurrency primitives offered by the JVM and the Java Class Library. However, such workloads are fundamental for understanding the way in which modern applications and data-processing frameworks use the JVM's concurrency features, and for validating new just-in-time (JIT) compiler optimizations that enable more efficient execution of such workloads. We present Renaissance, a new benchmark suite composed of modern, real-world, concurrent, and object-oriented workloads that exercise various concurrency primitives of the JVM. We show that the use of concurrency primitives in these workloads reveals optimization opportunities that were not visible with the existing workloads. We use Renaissance to compare performance of two state-of-the-art, production-quality JIT compilers (HotSpot C2 and Graal), and show that the performance differences are more significant than on existing suites such as DaCapo and SPECjvm2008. We also use Renaissance to expose four new compiler optimizations, and we analyze the behavior of several existing ones. Evaluating these optimizations using four benchmark suites shows a more prominent impact on the Renaissance workloads than on those of other suites.

关键词： benchmarks JIT compilation parallelism concurrency JVM object-oriented programming benchmarks functional programming benchmarks Big Data benchmarks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：