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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

783 篇 会议
135 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

806 篇 工学
- 792 篇 软件工程
- 529 篇 计算机科学与技术...
- 22 篇 控制科学与工程
- 12 篇 信息与通信工程
- 7 篇 电气工程
- 5 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 2 篇 生物工程
- 2 篇 安全科学与工程
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 纺织科学与工程
- 1 篇 航空宇航科学与技...
- 1 篇 生物医学工程（可授...
99 篇 理学
- 84 篇 数学
- 10 篇 系统科学
- 8 篇 统计学（可授理学、...
- 4 篇 化学
- 3 篇 物理学
- 3 篇 生物学
- 1 篇 地质学
52 篇 管理学
- 35 篇 管理科学与工程(可...
- 23 篇 工商管理
- 20 篇 图书情报与档案管...
6 篇 经济学
- 6 篇 应用经济学
4 篇 教育学
- 4 篇 教育学
3 篇 法学
- 3 篇 社会学

主题

164 篇 design
155 篇 languages
96 篇 performance
70 篇 computer program...
56 篇 algorithms
43 篇 experimentation
42 篇 computer program...
39 篇 verification
34 篇 reliability
32 篇 object oriented ...
27 篇 probabilistic pr...
26 篇 java programming...
26 篇 functional progr...
25 篇 program synthesi...
22 篇 java
19 篇 theory
19 篇 concurrency
18 篇 domain-specific ...
17 篇 compilers
17 篇 type systems

机构

15 篇 carnegie mellon ...
13 篇 princeton univ p...
11 篇 univ texas austi...
10 篇 univ michigan an...
10 篇 rice univ housto...
10 篇 purdue univ w la...
10 篇 univ calif berke...
9 篇 univ wisconsin m...
9 篇 harvard univ cam...
9 篇 univ penn philad...
9 篇 stanford univ st...
9 篇 univ washington ...
8 篇 mit cambridge ma...
8 篇 yale univ new ha...
8 篇 cornell univ ith...
8 篇 univ chicago il ...
7 篇 northeastern uni...
7 篇 microsoft resear...
6 篇 microsoft res re...
6 篇 microsoft res re...

作者

11 篇 walker david
10 篇 chlipala adam
10 篇 dillig isil
8 篇 solar-lezama arm...
8 篇 chaudhuri swarat
7 篇 august david i.
7 篇 shao zhong
7 篇 sarkar vivek
6 篇 wang xinyu
6 篇 grossman dan
6 篇 adl-tabatabai al...
6 篇 aiken alex
6 篇 foster nate
6 篇 bacon david f.
6 篇 gulwani sumit
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott
6 篇 mansinghka vikas...
6 篇 bodik rastislav

语言

840 篇 英文
77 篇 其他
1 篇 中文

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

共 918 条记录，以下是91-100 订阅

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

详细简洁

排序：

Adoption and focus:: Practical linear types for imperative programming 02

Adoption and focus:: Practical linear types for imperative p...

引用

conference on programming language design and implementation (pldi 02)

作者： Fähndrich, M DeLine, R Microsoft Res Redmond WA 98052 USA

ISBN: (纸本)9781581134636

A type system with linearity is useful for checking software protocols and resource management at compile time. Linearity provides powerful reasoning about state changes, but at the price of restrictions on aliasing. The hard division between linear and nonlinear types forces the programmer to make a trade-off between checking a protocol on an object and aliasing the object. Most onerous is the restriction that any type with a linear component must itself be linear. Because of this, checking a protocol on an object imposes aliasing restrictions on any data structure that directly or indirectly points to the object. We propose a new type system that reduces these restrictions with the adoption and focus constructs. Adoption safely allows a programmer to alias objects on which she is checking protocols, and focus allows the reverse. A programmer can alias data structures that point to linear objects and use focus for safe access to those objects. We discuss how we implemented these ideas in the Vault programming language.

关键词： design languages reliability verification linear types heap aliasing region-based memory management

来源：评论

学校读者我要写书评

暂无评论

Essential language support for generic programming

Essential language support for generic programming

引用

conference on programming language design and implementation

作者： Siek, J Lumsdaine, A Indiana Univ Open Syst Lab Bloomington IN 47405 USA

Concepts are an essential language feature for generic programming in the large. Concepts allow for succinct expression of constraints on type parameters of generic algorithms, enable systematic organization of problem domain abstractions, and make generic algorithms easier to use. In this paper we present the design of a type system and semantics for concepts that is suitable for non-type-inferencing languages. Our design shares much in common with the type classes of Haskell, though our primary influence is from best practices in the C++ community, where concepts are used to document type requirements for templates in generic libraries. Concepts include a novel combination of associated types and same-type constraints that do not appear in type classes, but that are similar to nested types and type sharing in ML.

关键词： generic programming polymorphism C++ standard ML Haskell

来源：评论

学校读者我要写书评

暂无评论

A compiler approach to fast hardware design space exploration in FPGA-based systems

A compiler approach to fast hardware design space exploratio...

引用

conference on programming language design and implementation (pldi 02)

作者： So, B Hall, MW Diniz, PC Univ So Calif Inst Informat Sci Marina Del Rey CA 90292 USA

This paper describes an automated approach to hardware design space exploration, through a collaboration between parallelizing compiler technology and high-level synthesis tools. We present a compiler algorithm that automatically explores the large design spaces resulting from the application of several program transformations commonly used in application-specific hardware designs. Our approach uses synthesis estimation techniques to quantitatively evaluate alternate designs for a loop nest computation. We have implemented this design space exploration algorithm in the context of a compilation and synthesis system called DE-FACTO, and present results of this implementation on five multimedia kernels. Our algorithm derives an implementation that closely matches the performance of the fastest design in the design space, and among implementations with comparable performance, selects the smallest design. We search on average only 0.3% of the design space. This technology thus significantly raises the level of abstraction for hardware design and explores a design space much larger than is feasible for a human designer.

关键词： algorithms performance design experimentationdesign space exploration data dependence analysis reuse analysis loop transformations

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

ESP: A language for programmable devices 01

ESP: A language for programmable devices

引用

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

作者： Kumar, S Mandelbaum, Y Yu, X Li, K Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781581134148

This paper presents the design and implementation of Event-driven State-machines programming (ESP) - a language for programmable devices. In traditional languages, like C, using event-driven state-machines forces a tradeoff that requires giving up ease of development and reliability to achieve high performance ESP is designed to provide all of these three properties simultaneously. ESP provides a comprehensive set of features to support development of compact and modular programs. The ESP compiler compiles the programs into two targets - a C file that can be used to generate efficient firmware For the device;and a specification that can be used by a verifier like SPIN to extensively test the firmware. As a case study, we reimplemented VMMC firmware that;runs on Myrinet network interface cards using ESP. We found that ESP simplifies the task of programming with event-driven state machines. It required an order of magnitude fewer lines of code than the previous implementation. We also found that model-checking verifiers like SPIN can be used to effectively debug the firmware. Finally. our measurements indicate that, the performance overhead of using ESP is relatively small.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Effective sign extension elimination 02

Effective sign extension elimination

引用

conference on programming language design and implementation (pldi 02)

作者： Kawahito, M Komatsu, H Nakatani, T IBM Tokyo Res Lab Kanagawa 2428502 Japan

ISBN: (纸本)9781581134636

Computer designs are shifting from 32-bit architectures to 64-bit architectures, while most of the programs available today are still designed for 32-bit architectures, Java(TM), for example, specifies the frequently used "int" as a 32-bit data type. If such Java programs are executed on a 64-bit architecture, many 32-bit values must be sign-extended to 64-bit values for integer operations. This causes serious performance overhead. In this paper, we present a fast and effective algorithm for eliminating sign extensions. We implemented this algorithm in the IBM Java Just-in-Time (JIT) compiler for IA-64(TM). Our experimental results show that our algorithm effectively eliminates the majority of sign extensions, They also show that it significantly improves performance, while it increases JIT compilation time by only 0.11%. We implemented our algorithm for programs in Java, but it can be applied to any language requiring sign extensions.

关键词： algorithms performance design experimentation sign extension 64-bit architectures Java JIT compilers IA-64

来源：评论

学校读者我要写书评

暂无评论

Regularly annotated set constraints 07

Regularly annotated set constraints

引用

conference on programming language design and implementation

作者： Kodumal, John Aiken, Alex Univ Calif Berkeley Coverity Inc Berkeley CA 94720 USA Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781595936332

A general class of program analyses are a combination of context-free and regular language reachability. We define regularly annotated set constraints, a constraint formalism that captures this class. Our results extend the class of reachability problems expressible naturally in a single constraint formalism, including such diverse applications as interprocedural dataflow analysis, precise type-based flow analysis, and pushdown model checking.

关键词： set constraints context-free language reachability flow analysis annotated inclusion constraints pushdown model checking

来源：评论

学校读者我要写书评

暂无评论

Verifiable Composition of Deterministic Grammars 09

Verifiable Composition of Deterministic Grammars

引用

acm sigplan conference on programming language design and implementation

作者： Schwerdfeger, August C. Van Wyk, Eric R. Univ Minnesota Dept Comp Sci & Engn Minneapolis MN 55455 USA

ISBN: (纸本)9781605583921

There is an increasing interest in extensible languages, (domain-specific) language extensions, and mechanisms for their specification and implementation. One challenge is to develop tools that allow non-expert programmers to add an eclectic set of language extensions to a host language. We describe mechanisms for composing and analyzing concrete syntax specifications of a host language and extensions to it. These specifications consist of context-free grammars with each terminal symbol mapped to a regular expression, from which a slightly-modified LR parser and context-aware scanner are generated. Traditionally, conflicts are detected when a parser is generated from the composed grammar, but this comes too late since it is the non-expert programmer directing the composition of independently developed extensions with the host language. The primary contribution of this paper is a modular analysis that is performed independently by each extension designer on her extension ( composed alone with the host language). If each extension passes this modular analysis, then the language composed later by the programmer will compile with no conflicts or lexical ambiguities. Thus, extension writers can verify that their extension will safely compose with others and, if not, fix the specification so that it will. This is possible due to the context-aware scanner's lexical disambiguation and a set of reasonable restrictions limiting the constructs that can be introduced by an extension. The restrictions ensure that the parse table states can be partitioned so that each state can be attributed to the host language or a single extension.

关键词： languages Algorithms Verification LR Parsing context-aware scanning language composition grammar composition extensible languages

来源：评论

学校读者我要写书评

暂无评论

Type-and-Example-Directed Program Synthesis 15

Type-and-Example-Directed Program Synthesis

引用

36th acm sigplan conference on programming language design and implementation

作者： Osera, Peter-Michael Zdancewic, Steve Univ Penn Philadelphia PA 19104 USA

ISBN: (纸本)9781450334686

This paper presents an algorithm for synthesizing recursive functions that process algebraic datatypes. It is founded on proof-theoretic techniques that exploit both type information and input-output examples to prune the search space. The algorithm uses refinement trees, a data structure that succinctly represents constraints on the shape of generated code. We evaluate the algorithm by using a prototype implementation to synthesize more than 40 benchmarks and several non-trivial larger examples. Our results demonstrate that the approach meets or outperforms the state-of-the-art for this domain, in terms of synthesis time or attainable size of the generated programs.

关键词： languages Theory Functional programming Proof Search Program Synthesis Type Theory

来源：评论

学校读者我要写书评

暂无评论

Asynchronous exceptions in Haskell 01

Asynchronous exceptions in Haskell

引用

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

作者： Marlow, S. Peyton Jones, S. Moran, A. Reppy, J. Microsoft Research Cambridge MA United States

ISBN: (纸本)9781581134148

Asynchronous exceptions, such as timeouts, are important for robust, modular programs, but are extremely difficult to program with - so much so that most programming languages either heavily restrict them or ban them altogether. We extend our earlier work, in which we added synchronous exceptions to Haskell, to support asynchronous exceptions too. Our design introduces scoped combinators for blocking and unblocking asynchronous interrupts, along with a somewhat surprising semantics for operations that can suspend. Uniquely, we also give a formal semantics for our system.

关键词： Modula (programming language)

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共92页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：