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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

774 篇 会议
129 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

801 篇 工学
- 787 篇 软件工程
- 527 篇 计算机科学与技术...
- 22 篇 控制科学与工程
- 11 篇 信息与通信工程
- 7 篇 电气工程
- 5 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 2 篇 安全科学与工程
- 1 篇 机械工程
- 1 篇 动力工程及工程热...
- 1 篇 纺织科学与工程
- 1 篇 航空宇航科学与技...
- 1 篇 生物工程
100 篇 理学
- 86 篇 数学
- 10 篇 系统科学
- 9 篇 统计学（可授理学、...
- 4 篇 化学
- 2 篇 物理学
- 2 篇 生物学
- 1 篇 地质学
49 篇 管理学
- 33 篇 管理科学与工程(可...
- 21 篇 工商管理
- 19 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
4 篇 教育学
- 4 篇 教育学
3 篇 法学
- 3 篇 社会学

主题

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

机构

15 篇 carnegie mellon ...
13 篇 princeton univ p...
11 篇 stanford univ st...
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 篇 univ washington ...
8 篇 yale univ new ha...
8 篇 cornell univ ith...
8 篇 univ chicago il ...
7 篇 mit cambridge ma...
7 篇 northeastern uni...
7 篇 microsoft resear...
6 篇 microsoft res re...
6 篇 microsoft res re...

作者

11 篇 walker david
10 篇 dillig isil
9 篇 aiken alex
9 篇 chlipala adam
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 篇 foster nate
6 篇 bacon david f.
6 篇 gulwani sumit
6 篇 myers andrew c.
6 篇 mezini mira
6 篇 mahlke scott
6 篇 bodik rastislav
5 篇 mckinley kathryn...

语言

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

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

共 903 条记录，以下是781-790 订阅

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

详细简洁

排序：

On slicing programs with jump statements 94

On slicing programs with jump statements

引用

Proceedings of the acm sigplan'94 conference on programming language design and implementation (PLDI)

作者： Agrawal, Hiralal Bellcore Morristown United States

ISBN: (纸本)089791662X

Program slices have potential uses in many software engineering applications. Traditional slicing algorithms, however, do not work correctly on programs that contain explicit jump statements. Two similar algorithms were proposed recently to alleviate this problem. Both require the flowgraph and the program dependence graph of the program to be modified. In this paper, we propose an alternative algorithm that leaves these graphs intact and uses a separate graph to store the additional required information. We also show that this algorithm permits an extremely efficient, conservative adaptation for use with programs that contain only `structured' jump statements.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Optimizing dynamically-dispatched calls with run-time type feedback 94

Optimizing dynamically-dispatched calls with run-time type f...

引用

Proceedings of the acm sigplan'94 conference on programming language design and implementation (PLDI)

作者： Holzle, Urs Ungar, David Stanford Univ Stanford CA United States

ISBN: (纸本)089791662X

Object-oriented programs are difficult to optimize because they execute many dynamically-dispatched calls. These calls cannot easily be eliminated because the compiler does not know which callee will be invoked at runtime. We have developed a simple technique that feeds back type information from the runtime system to the compiler. With this type feedback, the compiler can inline any dynamically-dispatched call. Our compiler drastically reduces the call frequency of a suite of large SELF applications (by a factor of 3.6) and improves performance by a factor of 1.7. We believe that type feedback could significantly reduce call frequencies and improve performance for most other object-oriented languages (statically-typed or not) as well as for languages with type-dependent operations such as generic arithmetic.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Type analysis of Prolog using type graphs 94

Type analysis of Prolog using type graphs

引用

Proceedings of the acm sigplan'94 conference on programming language design and implementation (PLDI)

作者： Van Hentenryck, P. Cortesi, A. Le Charlier, B. Brown Univ Providence United States

ISBN: (纸本)089791662X

Type analysis of Prolog is of primary importance for high-performance compilers, since type information may lead to better indexing and to sophisticated specializations of unification and built-in predicates to name a few. However, these optimizations often require a sophisticated type inference system capable of inferring disjunctive and recursive types and hence expensive in computation time. The purpose of this paper is to describe a type analysis system for Prolog based on abstract interpretation and type graphs (i.e. disjunctive rational trees) with this functionality. The system (about 15,000 lines of C) consists of the combination of a generic fixpoint algorithm, a generic pattern domain, and a type graph domain. The main contribution of the paper is to show that this approach can be engineered to be practical for medium-sized programs without sacrificing accuracy. The main technical contributions to achieve this result are (1) a novel widening operator for type graphs which appears to be accurate and effective in keeping the sizes of the graphs, and hence the computation time, reasonably small;(2) the use of the generic pattern domain to obtain a compact representation of equality constraints between subterms and to factor out sure structural information.

关键词： PROLOG (programming language)

来源：评论

学校读者我要写书评

暂无评论

Backtracking without trailing in CLP (RLin) 94

Backtracking without trailing in CLP (RLin)

引用

Proceedings of the acm sigplan'94 conference on programming language design and implementation (PLDI)

作者： Van Hentenryck, Pascal Ramachandran, Viswanath Brown Univ Providence United States

ISBN: (纸本)089791662X

Constraint logic programming (CLP) is a generalization of logic programming where unification is replaced by constraint solving as the basic operation of the language. The combination of constraint solving and nondeterminism (approximated by backtracking) makes these languages appealing for a variety of combinatorial search problems. Existing CLP languages support backtracking by generalizing traditional Prolog implementations: modifications to the constraint system are trailed and restored on backtracking. Although simple and efficient, trailing may be very demanding in memory space, since the constraint system may potentially be saved at each choice point. This paper proposes a fundamentally new implementation scheme for backtracking in CLP languages over linear (rational or real) arithmetic. The new scheme, called semantic backtracking, does not use trailing but rather exploits the semantics of the constraints to undo the effect of newly added constraints. Semantic backtracking reduces the space complexity by an order of magnitude compared to implementations based on trailing and makes space complexity essentially independent of the number of choice points. In addition, semantic backtracking introduces negligible space and time overhead on deterministic programs. The price for this improvement is an increase in backtracking time, although constraint-solving time may actually decrease. The scheme has been implemented as part of a complete CLP system CLP (RLin) and compared analytically and experimentally with an optimized trailing implementation. Experimental results indicate that semantic backtracking produces significant reduction in memory space, while keeping the time overhead reasonably small.

关键词： Logic programming

来源：评论

学校读者我要写书评

暂无评论

Randomized implementation of multiple functional arrays

Randomized implementation of multiple functional arrays

引用

Proceedings of the 1994 acm conference on LISP and Functional programming

作者： Chuang, Tyng-Ruey Chalmers Univ of Technology Goteborg Sweden

ISBN: (纸本)0897916433

The array update problem in the implementation of a purely functional language is the following: once an array is updated, both the original array and the newly updated one must be preserved to maintain referential transparency. Previous approaches have mainly based on the detection or enforcement of single-threaded accesses to an aggregate, by means of compiler-time analyses or language restrictions. These approaches cannot deal with aggregates which are updated in a multi-threaded manner. Baker's shallow binding scheme can be used to implement multi-threaded functional arrays. His scheme, however, can be very expensive if there are repeated alternations between long binding paths. We design a scheme that fragments binding paths randomly. The randomization scheme is on-line, simple to implement, and its expected performance comparable to that of the optimal off-line solutions. All this is achieved without using compiler-time analyses, and without restricting the languages. The expected performance of the randomization scheme is analyzed in details, and some preliminary results are shown. Applications of the randomization technique to other functional aggregates, as well as its implications, are briefly outlined.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Program structure tree. Computing control regions in linear time

Program structure tree. Computing control regions in linear ...

引用

Proceedings of the acm sigplan'94 conference on programming language design and implementation (PLDI)

作者： Johnson, Richard Pearson, David Pingali, Keshav Cornell Univ Ithaca United States

ISBN: (纸本)089791662X

In this paper, we describe the program structure tree (PST), a hierarchical representation of program structure based on single entry single exit (SESE) regions of the control flow graph. We give a linear-time algorithm for finding SESE regions and for building the PST of arbitrary control flow graphs (including irreducible ones). Next, we establish a connection between SESE regions and control dependence equivalence classes, and show how to use the algorithm to find control regions in linear time. Finally, we discuss some applications of the PST. Many control flow algorithms, such as construction of Static Single Assignment form, can be speeded up by applying the algorithms in a divide-and-conquer style to each SESE region on its own. The PST is also used to speed up data flow analysis by exploiting `sparsity'. Experimental results from the Perfect Club and SPEC89 benchmarks confirm that the PST approach finds and exploits program structure.

关键词： Structured programming

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the acm sigplan '93 conference on programming language design and implementation

Proceedings of the ACM SIGPLAN '93 Conference on Programming...

引用

acm sigplan '93 conference on programming language design and implementation, PLDI 1993

ISBN: (纸本)0897915984

This conference proceedings contains 29 papers on the design, development, implementation and use of programming languages, with emphasis on experimental results and practical experience. Topics discussed include the design and implementation of data breakpoints, isolation and analysis of optimization errors, accommodation of may-alias information in static single assignment form, abstract debugging of higher-order imperative languages, a practical data flow framework for array reference analysis, global optimizations for parallelism and data locality, communication optimization and code generation for distributed memory machines, programmable syntax macros, compiling real-time programs into schedulable code, improving the cache locality of memory allocation, using lifetime predictors to improve memory allocation performance, the implementation of type classes, the theory of compilation with continuations, register allocation with instruction scheduling, lifetime-sensitive modulo scheduling, load/store range analysis for global register allocation, and balanced instruction scheduling in the case of uncertain memory latency.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Communicating reactive processes 93

Communicating reactive processes

引用

20th Annual acm sigplan-SIGACT Symposium on Principles of programming languages, POPL'93

作者： Berry, G. Ramesh, S. Shyamasundar, R.K. Ecole des Mines Sophia-Antipolis France

ISBN: (纸本)0897915607

We present a new programming paradigm called Communicating Reactive Processes or CRP that unifies the capabilities of asynchronous and synchronous concurrent programming languages. Asynchronous languages such as CSP, OCCAM, or ADA are well-suited for distributed algorithms;their processes are loosely coupled and communication takes time. The ESTEREL synchronous language is dedicated to reactive systems;its processes are tightly coupled and deterministic, communication being realized by instantaneous broadcasting. Complex applications such as process or robot control require to couple both forms of concurrency, which is the object of CRP. A CRP program consists of independent locally reactive ESTEREL nodes that communicate with each other by CSP rendezvous. CRP faithfully extends both ESTEREL and CSP and adds new possibilities such as precise local watchdogs on rendezvous. We present the design of CRP, its semantics, a translation into classical process calculi for program verification, an application example, and implementation issues.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

Charm++: A portable concurrent object oriented system based on C++ 8

Charm++: A portable concurrent object oriented system based ...

引用

8th Annual conference on Object-Oriented programming Systems, languages, and Applications, OOPSLA 1993

作者： Kale, Laxmikant V. Krishnan, Sanjeev Department of Computer Science University of Illinois Urbana-Champaign United States

ISBN: (纸本)0897915879

We describe Charm++, an object oriented portable parallel programming language based on C++. Its design philosophy, implementation, sample applications and their performance on various parallel machines are described. Charm++ is an explicitly parallel language consisting of C++ with a few extensions. It provides a clear separation between sequential and parallel objects. The execution model of Charm++ is message driven, thus helping one write programs that are latencytolerant. The language supports multiple inheritance, dynamic binding, overloading, strong typing, and reuse for parallel objects. Charm++ provides specific modes for sharing information between parallel objects. Extensive dynamic load balancing strategies are provided. It is based on the Charm parallel programming system, and its runtime system implementation reuses most of the runtime system for Charm. © 1993 acm.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 6th International conference on Functional programming languages and Computer Architecture (FPCA '93)

Proceedings of the 6th International Conference on Functiona...

引用

Proceedings of the 6th International conference on Functional programming languages and Computer Architecture (FPCA '93)

ISBN: (纸本)089791595X

The conference materials contain 33 papers. The topics covered include experience with functional programming applications, theory and implementation of types, storage reclamation, semantics analysis of imperative extensions, compiling and performance evaluation, language design, compiler optimization, static analysis, functional algorithms and partial evaluation.

关键词： Computer simulation languages

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共91页 << < 75 76 77 78 79 80 81 82 83 84 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：