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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

515 篇 会议
52 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

524 篇 工学
- 521 篇 软件工程
- 325 篇 计算机科学与技术...
- 25 篇 控制科学与工程
- 7 篇 信息与通信工程
- 3 篇 电子科学与技术（可...
- 3 篇 化学工程与技术
- 2 篇 安全科学与工程
- 1 篇 动力工程及工程热...
- 1 篇 电气工程
- 1 篇 生物医学工程（可授...
80 篇 理学
- 73 篇 数学
- 7 篇 统计学（可授理学、...
- 5 篇 系统科学
- 3 篇 化学
- 1 篇 物理学
- 1 篇 地质学
- 1 篇 生物学
36 篇 管理学
- 23 篇 管理科学与工程(可...
- 18 篇 工商管理
- 16 篇 图书情报与档案管...
3 篇 经济学
- 3 篇 应用经济学
2 篇 法学
- 2 篇 社会学
2 篇 教育学
- 2 篇 教育学

主题

87 篇 design
74 篇 languages
66 篇 performance
50 篇 computer program...
38 篇 algorithms
37 篇 computer program...
31 篇 experimentation
24 篇 reliability
24 篇 verification
23 篇 program synthesi...
22 篇 probabilistic pr...
19 篇 java programming...
17 篇 object oriented ...
15 篇 functional progr...
12 篇 c (programming l...
11 篇 computer systems...
11 篇 static analysis
11 篇 language
11 篇 measurement
11 篇 programming lang...

机构

12 篇 carnegie mellon ...
9 篇 univ michigan an...
9 篇 univ wisconsin m...
9 篇 princeton univ p...
8 篇 univ penn philad...
8 篇 purdue univ w la...
8 篇 stanford univ st...
8 篇 univ washington ...
8 篇 univ texas austi...
7 篇 mit cambridge ma...
6 篇 microsoft res re...
6 篇 swiss fed inst t...
6 篇 yale univ new ha...
6 篇 harvard univ cam...
6 篇 cornell univ ith...
5 篇 ibm research
5 篇 microsoft resear...
4 篇 carnegie mellon ...
4 篇 microsoft res re...
4 篇 univ calif davis...

作者

7 篇 dillig isil
6 篇 august david i.
6 篇 gulwani sumit
5 篇 grossman dan
5 篇 aiken alex
5 篇 vechev martin
5 篇 bacon david f.
5 篇 su zhendong
5 篇 lam monica s.
5 篇 chlipala adam
5 篇 myers andrew c.
5 篇 walker david
5 篇 mansinghka vikas...
4 篇 mckinley kathryn...
4 篇 wang xinyu
4 篇 nakatani t
4 篇 cheng perry
4 篇 adl-tabatabai al...
4 篇 gehr timon
4 篇 lueh guei-yuan

语言

548 篇 英文
19 篇 其他

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

共 567 条记录，以下是331-340 订阅

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

详细简洁

排序：

Filling Typed Holes with Live GUIs 2021

Filling Typed Holes with Live GUIs

引用

42nd acm sigplan International conference on programming language design and implementation (pldi)

作者： Omar, Cyrus Moon, David Blinn, Andrew Voysey, Ian Collins, Nick Chugh, Ravi Univ Michigan Ann Arbor MI 48109 USA Carnegie Mellon Univ Pittsburgh PA 15213 USA Univ Chicago Chicago IL 60637 USA

ISBN: (纸本)9781450383912

Text editing is powerful, but some types of expressions are more naturally represented and manipulated graphically. Examples include expressions that compute colors, music, animations, tabular data, plots, diagrams, and other domain-specific data structures. This paper introduces live literals, or livelits, which allow clients to fill holes of types like these by directly manipulating a user-defined GUI embedded persistently into code. Uniquely, livelits are compositional: a livelit GUI can itself embed spliced expressions, which are typed, lexically scoped, and can in turn embed other livelits. Livelits are also uniquely live: a livelit can provide continuous feedback about the run-time implications of the client's choices even when splices mention bound variables, because the system continuously gathers closures associated with the hole that the livelit is filling. We integrate livelits into Hazel, a live hole-driven programming environment, and describe case studies that exercise these novel capabilities. We then define a simply typed livelit calculus, which specifies how livelits operate as live graphical macros. The metatheory of macro expansion has been mechanized in Agda.

关键词： live programming macros typed holes GUIs

来源：评论

学校读者我要写书评

暂无评论

On the importance of points-to analysis and other memory disambiguation methods for C programs 01

On the importance of points-to analysis and other memory dis...

引用

acm sigplan'01 conference on programming language design and implementation (pldi)

作者： Ghiya, R. Lavery, D. Sehr, D. Intel Corporation 2200 Mission College Blvd Santa Clara CA 95052 United States

ISBN: (纸本)9781581134148

In this paper, we evaluate the benefits achievable from pointer analysis and other memory disambiguation techniques for C/C++ programs, using the framework of the production compiler for the Intel ® Itanium™ processor. Most of the prior work on memory disambiguation has primarily focused on pointer analysis, and either presents only static estimates of the accuracy of the analysis (such as average points-to set size), or provides performance data in the context of certain individual optimizations. In contrast, our study is based on a complete memory disambiguation framework that uses a whole set of techniques including pointer analysis. Further, it presents how various compiler analyses and optimizations interact with the memory disambiguator, evaluates how much they benefit from disambiguation, and measures the eventual impact on the performance of the program. The paper also analyzes the types of disambiguation queries that are typically received by the disambiguator, which disambiguation tec hniques prove most effective in resolving them, and what type of queries prove difficult to be resolved. The study is based on empirical data collected for the SPEC CINT2000 C/C++ programs, running on the Itanium processor.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

design and implementation of Sparse Global Analyses for C-like languages 12

Design and Implementation of Sparse Global Analyses for C-li...

引用

33rd acm sigplan conference on programming language design and implementation

作者： Oh, Hakjoo Heo, Kihong Lee, Wonchan Lee, Woosuk Yi, Kwangkeun Seoul Natl Univ Seoul 151 South Korea

ISBN: (纸本)9781450312059

In this article we present a general method for achieving global static analyzers that are precise, sound, yet also scalable. Our method generalizes the sparse analysis techniques on top of the abstract interpretation framework to support relational as well as non-relational semantics properties for C-like languages. We first use the abstract interpretation framework to have a global static analyzer whose scalability is unattended. Upon this underlying sound static analyzer, we add our generalized sparse analysis techniques to improve its scalability while preserving the precision of the underlying analysis. Our framework determines what to prove to guarantee that the resulting sparse version should preserve the precision of the underlying analyzer. We formally present our framework;we present that existing sparse analyses are all restricted instances of our framework;we show more semantically elaborate design examples of sparse non-relational and relational static analyses;we present their implementation results that scale to analyze up to one million lines of C programs. We also show a set of implementation techniques that turn out to be critical to economically support the sparse analysis process.

关键词： Static analysis abstract interpretation sparse analysis

来源：评论

学校读者我要写书评

暂无评论

Automatic Generation of Library Bindings Using Static Analysis 09

Automatic Generation of Library Bindings Using Static Analys...

引用

acm sigplan conference on programming language design and implementation

作者： Ravitch, Tristan Jackson, Steve Aderhold, Eric Liblit, Ben Univ Wisconsin Dept Comp Sci Madison WI 53706 USA

ISBN: (纸本)9781605583921

High-level languages are growing in popularity. However, decades of C software development have produced large libraries of fast, time-tested, meritorious code that are impractical to recreate from scratch. Cross-language bindings can expose low-level C code to high-level languages. Unfortunately, writing bindings by hand is tedious and error-prone, while mainstream binding generators require extensive manual annotation or fail to offer the language features that users of modem languages have come to expect. We present an improved binding-generation strategy based on static analysis of unannotated library source code. We characterize three high-level idioms that are not uniquely expressible in C's low-level type system: array parameters, resource managers, and multiple return values. We describe a suite of interprocedural analyses that recover this high-level information, and we show how the results can be used in a binding generator for the Python programming language. In experiments with four large C libraries, we find that our approach avoids the mistakes characteristic of hand-written bindings while offering a level of Python integration unmatched by prior automated approaches. Among the thousands of functions in the public interfaces of these libraries, roughly 40% exhibit the behaviors detected by our static analyses.

关键词： FFI foreign function interfaces bindings libraries dataflow analysis modular static program analysis multi-language code reuse

来源：评论

学校读者我要写书评

暂无评论

CHIUW 2019 - Proceedings of the acm sigplan 6th Chapel Implementers and Users Workshop, co-located with pldi 2019

CHIUW 2019 - Proceedings of the ACM SIGPLAN 6th Chapel Imple...

引用

acm sigplan 6th Annual Chapel Implementers and Users Workshop, CHIUW 2019, held in conjunction with pldi 2019

ISBN: (纸本)9781450368001

The proceedings contain 8 papers. The topics discussed include: GPUIterator: bridging the gap between chapel and GPU platforms;calling chapel code: interoperability improvements;towards radix sorting in the chapel standard library;implementing stencil problems in chapel: an experience report;chapel unblocked: recent communication optimizations in chapel;Arkouda: Interactive data exploration backed by chapel;chapel graph library (CGL);and chapel in cray HPO.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Concurrency Debugging with Differential Schedule Projections 15

Concurrency Debugging with Differential Schedule Projections

引用

36th acm sigplan conference on programming language design and implementation

作者： Machado, Nuno Lucia, Brandon Rodrigues, Luis Univ Lisbon Inst Super Tecn INESC ID P-1699 Lisbon Portugal Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450334686

We present Symbiosis: a concurrency debugging technique based on novel differential schedule projections (DSPs). A DSP shows the small set of memory operations and data-flows responsible for a failure, as well as a reordering of those elements that avoids the failure. To build a DSP, Symbiosis first generates a full, failing, multithreaded schedule via thread path profiling and symbolic constraint solving. Symbiosis selectively reorders events in the failing schedule to produce a non-failing, alternate schedule. A DSP reports the ordering and data-flow differences between the failing and non-failing schedules. Our evaluation on buggy real-world software and benchmarks shows that, in practical time, Symbiosis generates DSPs that both isolate the small fraction of event orders and data-flows responsible for the failure, and show which event reorderings prevent failing. In our experiments, DSPs contain 81% fewer events and 96% fewer data-flows than the full failure-inducing schedules. Moreover, by allowing developers to focus on only a few events, DSPs reduce the amount of time required to find a valid fix.

关键词： Algorithms design Reliability Concurrency Debugging Symbolic Execution Constraint Solving Differential Schedule Projection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Latte: A language, Compiler, and Runtime for Elegant and Efficient Deep Neural Networks 16

Latte: A Language, Compiler, and Runtime for Elegant and Eff...

引用

37th acm sigplan conference on programming language design and implementation

作者： Truong, Leonard Barik, Rajkishore Totoni, Ehsan Liu, Hai Markley, Chick Fox, Armando Shpeisman, Tatiana Univ Calif Berkeley Intel Labs Berkeley CA USA Intel Labs Berkeley CA USA Univ Calif Berkeley Berkeley CA USA

ISBN: (纸本)9781450342612

Deep neural networks (DNNs) have undergone a surge in popularity with consistent advances in the state of the art for tasks including image recognition, natural language processing, and speech recognition. The computationally expensive nature of these networks has led to the proliferation of implementations that sacrifice abstraction for high performance. In this paper, we present Latte, a domain-specific language for DNNs that provides a natural abstraction for specifying new layers without sacrificing performance. Users of Latte express DNNs as ensembles of neurons with connections between them. The Latte compiler synthesizes a program based on the user specification, applies a suite of domain-specific and general optimizations, and emits efficient machine code for heterogeneous architectures. Latte also includes a communication runtime for distributed memory data-parallelism. Using networks described using Latte, we demonstrate 3-6x speedup over Caffe (C++/MKL) on the three state-of-the-art ImageNet models executing on an Intel Xeon E5-2699 v3 x86 CPU.

关键词： Deep Learning Neural Networks Domain Specific language Compiler Optimization

来源：评论

学校读者我要写书评

暂无评论

A provably sound TAL for back-end optimization 03

引用

conference on programming language design and implementation

作者： Chen, J Wu, DH Appel, AW Fang, H Princeton Univ Princeton NJ 08544 USA Yale Univ New Haven CT 06520 USA

ISBN: (纸本)9781581136623

Typed assembly languages provide a way to generate machine-checkable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages are hand-written and cannot be machine-checked, which is worrisome for such large calculi. We have designed and implemented a low-level typed assembly language (LTAL) with a semantic model and established its soundness from the model. Compared to existing typed assembly languages, LTAL is more scalable and more secure;it has no macro instructions that hinder low-level optimizations such as instruction scheduling;its type constructors are expressive enough to capture dataflow information, support the compiler's choice of data representations and permit typed position-independent code;and its type-checking algorithm is completely syntax-directed. We have built a prototype system, based on Standard ML of New Jersey, that compiles most of core ML to Sparc code. We explain how we were able to make the untyped back end in SML/NJ preserve types during instruction selection and register allocation, without restricting low-level optimizations and without knowledge of any type system pervading the instruction selector and register allocator.

关键词： languages verification typed assembly language proof-carrying code

来源：评论

学校读者我要写书评

暂无评论

Synthesizing Racy Tests 15

Synthesizing Racy Tests

引用

36th acm sigplan conference on programming language design and implementation

作者： Samak, Malavika Ramanathan, Murali Krishna Jagannathan, Suresh Indian Inst Sci Bangalore 560012 Karnataka India Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9781450334686

Subtle concurrency errors in multithreaded libraries that arise because of incorrect or inadequate synchronization are often difficult to pinpoint precisely using only static techniques. On the other hand, the effectiveness of dynamic race detectors is critically dependent on multithreaded test suites whose execution can be used to identify and trigger races. Usually, such multithreaded tests need to invoke a specific combination of methods with objects involved in the invocations being shared appropriately to expose a race. Without a priori knowledge of the race, construction of such tests can be challenging. In this paper, we present a lightweight and scalable technique for synthesizing precisely these kinds of tests. Given a multithreaded library and a sequential test suite, we describe a fully automated analysis that examines sequential execution traces, and produces as its output a concurrent client program that drives shared objects via library method calls to states conducive for triggering a race. Experimental results on a variety of well-tested Java libraries yield 101 synthesized multithreaded tests in less than four minutes. Analyzing the execution of these tests using an off-the-shelf race detector reveals 187 harmful races, including several previously unreported ones.

关键词： design Reliability Verification Race detection dynamic analysis concurrency

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共57页 << < 30 31 32 33 34 35 36 37 38 39 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：