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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

130 篇 期刊文献
114 篇 会议

馆藏范围

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

日期分布

学科分类号

222 篇 工学
- 210 篇 计算机科学与技术...
- 167 篇 软件工程
- 14 篇 电气工程
- 12 篇 控制科学与工程
- 8 篇 信息与通信工程
- 4 篇 电子科学与技术（可...
- 2 篇 化学工程与技术
- 1 篇 机械工程
- 1 篇 仪器科学与技术
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 测绘科学与技术
- 1 篇 航空宇航科学与技...
- 1 篇 生物工程
- 1 篇 安全科学与工程
93 篇 理学
- 90 篇 数学
- 4 篇 化学
- 3 篇 统计学（可授理学、...
- 1 篇 物理学
- 1 篇 生物学
- 1 篇 系统科学
38 篇 管理学
- 28 篇 管理科学与工程(可...
- 12 篇 图书情报与档案管...
- 9 篇 工商管理
3 篇 经济学
- 3 篇 应用经济学
- 1 篇 理论经济学
3 篇 教育学
- 2 篇 教育学
- 1 篇 心理学(可授教育学...
1 篇 医学
- 1 篇 临床医学

主题

244 篇 programming theo...
10 篇 programming and ...
6 篇 software enginee...
5 篇 software testing
4 篇 high level langu...
3 篇 programming
3 篇 ada
3 篇 graph theory
3 篇 software reliabi...
3 篇 program verifica...
3 篇 wireless mesh ne...
3 篇 formal specifica...
3 篇 capacity optimiz...
3 篇 programming envi...
3 篇 channel allocati...
2 篇 parallel process...
2 篇 formal logic
2 篇 automation
2 篇 automatic testin...
2 篇 reliability theo...

机构

2 篇 univ of pennsylv...
2 篇 mgu im. m.v. lom...
2 篇 moskovskij gosud...
2 篇 inria rocquencou...
2 篇 ecole des mines ...
2 篇 inst kibernetiki...
2 篇 aarhus univ aarh...
2 篇 univ oxford comp...
2 篇 city univ london...
2 篇 eindhoven univ t...
2 篇 univ calif berke...
2 篇 univ of nottingh...
1 篇 beijing univ of ...
1 篇 poznan universit...
1 篇 addis ababa univ...
1 篇 hewlett-packard ...
1 篇 technion israel ...
1 篇 johann wolfgang ...
1 篇 national institu...
1 篇 at&t research

作者

3 篇 liu yanhong a.
2 篇 banach r
2 篇 stuckey peter j.
2 篇 kiselyov oleg
2 篇 cousot patrick
2 篇 desharnais j
2 篇 zakharov v.a.
2 篇 duggan d
2 篇 nielson flemming
2 篇 stoller scott d.
2 篇 nielson hanne ri...
2 篇 henzinger thomas...
2 篇 sheard tim
2 篇 mili a
2 篇 rehof jakob
1 篇 merz stephan
1 篇 davidov mikhail
1 篇 puel laurence
1 篇 mai zhongfan
1 篇 ignatushchenko v...

语言

211 篇 英文
17 篇 其他
12 篇 俄文
4 篇 中文

检索条件"主题词=programming theory"

共 244 条记录，以下是131-140 订阅

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

详细简洁

排序：

Speculative execution via address prediction and data prefetching 97

Speculative execution via address prediction and data prefet...

引用

Proceedings of the 1997 International Conference on Supercomputing

作者： Gonzalez, Jose Gonzalez, Antonio Universitat Politecnica de Catalunya Barcelona Spain

ISBN: (纸本)9780897919029

Data dependencies have become one of the main bottlenecks of current superscalar processors. Data speculation is gaining popularity as a mechanism to avoid the ordering imposed by data dependencies. Loads and stores are very good candidates for data speculation since their effective address has a regular behavior and then, they are highly predictable. In this paper we propose a mechanism called Address Prediction and Data Prefetching that allows load instructions to obtain their data at the decode stage. Besides, the effective address of load and store instructions is also predicted. These instructions and those dependent on them are speculatively executed. The technique has been evaluated for an out-of-order processor with a realistic configuration. The performance gain is about 19% in average and it is much higher for some benchmarks (up to 35%).

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Program fragments, linking, and modularization 97

Program fragments, linking, and modularization

引用

The 1997 24th ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages, POPL'97

作者： Cardelli, Luca Digital Equipment Corp United States

ISBN: (纸本)9780897918534

Module mechanisms have received considerable theoretical attention, but the associated concepts of separate compilation and linking have not been emphasized. Anomalous module systems have emerged in functional and object-oriented programming where software components are not separately typecheckable and compilable. In this paper we provide a context where linking can be studied, and separate compilability can be formally stated and checked. We propose a framework where each module is separately compiled to a self-contained entity called a linkset;we show that separately compiled, compatible modules can be safely linked together.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Finiteness conditions for fixed point iteration

Finiteness conditions for fixed point iteration

引用

Proceedings of the 1992 ACM Conference on Lisp and Functional programming

作者： Nielson, Flemming Nielson, Hanne Riis Aarhus Univ Ny Munkegade Aarhus Denmark

ISBN: (纸本)0897914813

This paper provides a link between the formulation of static program analyses using the framework of abstract interpretation (popular for functional languages) and using the more classical framework of data flow analysis (popular for imperative languages). In particular we show how the classical notions of fastness, rapidity and k-boundedness carry over to the abstract interpretation framework and how this may be used to bound the number of times a functional should be unfolded in order to yield the fixed point. This is supplemented with a number of results on how to calculate the bounds for iterative forms (as for tail recursion), for linear forms (as for one nested recursive call), and for primitive recursive forms. In some cases this improves the `worst case' results of [9], but more importantly it gives much better `average case' results.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Type checking higher-order polymorphic multi-methods 97

Type checking higher-order polymorphic multi-methods

引用

The 1997 24th ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages, POPL'97

作者： Bourdoncle, Francois Merz, Stephan Ecole des Mines de Paris Paris France

ISBN: (纸本)9780897918534

We present a new predicative and decidable type system, called ML≤, suitable for languages that integrate functional programming and parametric polymorphism in the tradition of ML [21, 28], and class-based object-oriented programming and higher-order multi-methods in the tradition of CLOS [12]. Instead of using extensible records as a foundation for object-oriented extensions of functional languages, we propose to reinterpret ML datatype declarations as abstract and concrete class declarations, and to replace pattern matching on run-time values by dynamic dispatch on run-time types. ML≤ is based on universally quantified polymorphic constrained types. Constraints are conjunctions of inequalities between monotypes built from type constructors organized into extensible and partially ordered classes. We give type checking rules for a small, explicitly typed functional language a la XML [20] with multi-methods, show that the resulting system has decidable minimal types, and discuss subject reduction. Finally, we propose a new object-oriented programming language based on the ML≤ type system.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Bounding space usage of conservative garbage collectors 02

Bounding space usage of conservative garbage collectors

引用

POPL 2002: 29th ACM SIGPLAN-SIGACT Symposium on Principles of programming Languages

作者： Boehm, Hans-J. Hewlett-Packard Laboratories 1501 Page Mill Rd. Palo Alto CA 94304 United States

ISBN: (纸本)9781581134506

Conservative garbage collectors can automatically reclaim unused memory in the absence of precise pointer location information. If a location can possibly contain a pointer, it is treated by the collector as though it contained a pointer. Although it is commonly assumed that this can lead to unbounded space use due to misidentified pointers, such extreme space use is rarely observed in practice, and then generally only if the number of misidentified pointers is itself unbounded. We show that if the program manipulates only data structures satisfying a simple GC-robustness criterion, then a bounded number of misidentified pointers can at most result in increasing space usage by a constant factor. We argue that nearly all common data structures are already GC-robust, and it is typically easy to identify and replace those that are not. Thus it becomes feasible to prove space bounds on programs collected by mildly conservative garbage collectors, such as the one in [2]. The worst-case space overhead introduced by such mild conservatism is comparable to the worst-case fragmentation overhead for inherent in any non-moving storage allocator. The same GC-robustness criterion also ensures the absence of temporary space leaks of the kind discussed in [13] for generational garbage collectors.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Planning for stream processing systems

Planning for stream processing systems

引用

20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference, AAAI-05/IAAI-05

作者： Riabov, Anton Liu, Zhen IBM T.J. Watson Research Center P.O. Box 704 Yorktown Heights NY 10598

With the advent of compositional programming models in computer science, applying planning technologies to automatically build workflows for solving large and complex problems in such a paradigm becomes not only technically appealing but also feasible approach. The application areas that will benefit from automatic composition include, among others, Web services, Grid computing and stream processing systems. Although the classical planning formalism is expressive enough to describe planning problems that arise in a large variety of different applications, it can pose significant limitations on planner performance in compositional applications, in particular, in stream processing systems. In this paper we extend the classical planning formalism by introducing new language constructs that support the structure of stream processing domains. Exposing this structure to the planner can result in dramatic performance improvements: our experiments show exponential planning time reduction in comparison to most recent metric planners. Copyright © 2005, American Association for Artificial Intelligence (***). All rights reserved.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Towards better inlining decisions using inlining trials 94

Towards better inlining decisions using inlining trials

引用

Proceedings of the 1994 ACM Conference on LISP and Functional programming

作者： Dean, Jeffrey Chambers, Craig Univ of Washington

ISBN: (纸本)0897916433

Inlining trials are a general mechanism for making better automatic decisions about whether a routine is profitable to inline. Unlike standard source-level inlining heuristics, an inlining trial captures the effects of optimizations applied to the body of the inlined routine when calculating the costs and benefits of inlining. The results of inlining trials are stored in a persistent database to be reused when making future inlining decisions at similar call sites. Type group analysis can determine the amount of available static information exploited during compilation, and the results of analyzing the compilation of an inlined routine help decide when a future call site would lead to substantially the same generated code as a given inlining trial. We have implemented inlining trials and type group analysis in an optimizing compiler for SELF, and by making wiser inlining decisions we were able to cut compilation time and compiled code space with virtually no loss of execution speed. We believe that inlining trials and type group analysis could be applied effectively to many high-level languages where procedural or functional abstraction is used heavily.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Progress measures and stack assertions for fair termination 92

Progress measures and stack assertions for fair termination

引用

Proceedings of the 11th Annual ACM Symposium on Principles of Distributed Computing

作者： Klarlund, Nils IBM T.J. Watson Research Cent Yorktown Heights NY United States

ISBN: (纸本)0897914953

Floyd's method based on well-orderings is the standard approach to proving termination of programs. Much attention has been devoted to generalizing this method to termination of programs that are subjected to fairness constraints. Earlier methods for fair termination tend to be somewhat indirect, relying on program transformations, which reduce the original problem to several termination problems. In this paper we introduce the new concept of stack assertions, which directly - without transformations - quantify progress towards fair termination. Moreover, we show that by one simple program transformation of adding a history variable, usual assertional logic, without fixed-point operators, is sufficiently expressive to form a sound and relatively complete method when used with stack assertions. This result is obtained as part of a substantial simplification of earlier completeness proofs.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Importance of synchronization structure in parallel program optimization

Importance of synchronization structure in parallel program ...

引用

Proceedings of the 1997 International Conference on Supercomputing

作者： van Gemund, Arjan J.C. Delft Univ of Technology Delft Netherlands

In automatic, retargetable compilation low-cost, analytic cost estimation techniques are crucial in order to efficiently steer the optimization process. programming models aimed at optimum expressiveness of parallelism, however, are not amenable to static cost estimation. We present a new coordination model, called SPC, that imposes specific restrictions in the synchronization structures that can be programmed. Imposing these restrictions enables the efficient computation of reliable cost estimations paving the way for automatic optimization. Regarding SPC's limited expressiveness we present a conjecture stating that the loss of parallelism when programming in SPC is typically limited to a constant factor of 2 compared to the unrestricted case. This limited loss is outweighed by the unlocked potential of automatic performance optimization as well as the portability that is achieved. We demonstrate how SPC enables automatic program optimizations through a compilation case study involving a line relaxation kernel on a distributed-memory machine.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

Tools and libraries to model and manipulate circular programs 07

Tools and libraries to model and manipulate circular program...

引用

2007 ACM SIGPLAN Workshop Partial Evaluation and Semantics-Based Program Manipulation

作者： Fernandes, Joo Paulo Saraiva, Joo Department of Computer Science University of Minho Portugal

ISBN: (纸本)1595936203

This paper presents techniques to model circular lazy programs in a strict, purely functional setting. Circular lazy programs model any algorithm based on multiple traversals over a recursive data structure as a single traversal function. Such elegant and concise circular programs are defined in a (strict or lazy) functional language and they are transformed into efficient strict and deforested, multiple traversal programs by using attribute grammars-based techniques. Moreover, we use standard slicing techniques to slice such circular lazy programs. We have expressed these transformations as an Haskell library and two tools have been constructed: the HaCirc tool that refactors Haskell lazy circular programs into strict ones, and the OCirc tool that extends Ocaml with circular definitions allowing programmers to write circular programs in Ocaml notation, which are transformed into strict Ocaml programs before they are executed. The first benchmarks of the different implementations are presented and show that for algorithms relying on a large number of traversals the resulting strict, deforested programs are more efficient than the lazy ones, both in terms of runtime and memory consumption. Copyright © 2007 ACM.

关键词： programming theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共25页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：