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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,381 篇 会议
107 篇 期刊文献

馆藏范围

1,488 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,398 篇 工学
- 1,353 篇 软件工程
- 1,101 篇 计算机科学与技术...
- 176 篇 控制科学与工程
- 38 篇 信息与通信工程
- 21 篇 建筑学
- 15 篇 土木工程
- 15 篇 生物工程
- 12 篇 光学工程
- 12 篇 电气工程
- 6 篇 机械工程
- 6 篇 材料科学与工程（可...
- 5 篇 电子科学与技术（可...
- 4 篇 化学工程与技术
- 3 篇 冶金工程
- 3 篇 航空宇航科学与技...
- 2 篇 力学（可授工学、理...
- 2 篇 生物医学工程（可授...
166 篇 理学
- 126 篇 数学
- 23 篇 系统科学
- 18 篇 生物学
- 6 篇 化学
- 6 篇 统计学（可授理学、...
- 5 篇 物理学
- 2 篇 地质学
145 篇 管理学
- 103 篇 图书情报与档案管...
- 55 篇 管理科学与工程(可...
- 31 篇 工商管理
18 篇 教育学
- 17 篇 教育学
10 篇 法学
- 9 篇 社会学
3 篇 经济学
- 3 篇 应用经济学
2 篇 医学
1 篇 农学

主题

452 篇 object oriented ...
226 篇 languages
81 篇 performance
79 篇 design
71 篇 java programming...
52 篇 algorithms
48 篇 java
44 篇 experimentation
43 篇 verification
36 篇 computer program...
31 篇 reliability
30 篇 theory
28 篇 aspect oriented ...
21 篇 measurement
17 篇 human factors
16 篇 parallel program...
15 篇 concurrency
14 篇 static analysis
14 篇 scala
14 篇 refactoring

机构

18 篇 univ washington ...
12 篇 ecole polytech f...
12 篇 univ texas austi...
9 篇 microsoft res re...
9 篇 swiss fed inst t...
8 篇 mit csail cambri...
8 篇 univ calif berke...
8 篇 university of il...
7 篇 victoria univers...
6 篇 programming tool...
6 篇 univ waterloo wa...
6 篇 suny binghamton ...
6 篇 university of wa...
6 篇 carnegie mellon ...
6 篇 aarhus univ dk-8...
6 篇 purdue univ dept...
5 篇 univ marburg d-3...
5 篇 tech univ darmst...
5 篇 ibm t.j. watson ...
5 篇 delft univ techn...

作者

13 篇 noble james
13 篇 de moor oege
13 篇 aldrich jonathan
11 篇 lorenz david h.
10 篇 biddle robert
10 篇 odersky martin
10 篇 ernst michael d.
9 篇 mckinley kathryn...
9 篇 baniassad elisa
9 篇 hendren laurie
9 篇 visser eelco
9 篇 ostermann klaus
8 篇 de champeaux den...
8 篇 tip frank
8 篇 cook william r.
8 篇 johnson ralph
8 篇 liu yu david
8 篇 binder walter
8 篇 abi-antoun marwa...
8 篇 mezini mira

语言

1,419 篇 英文
69 篇 其他

检索条件"任意字段=1987 Conference on Object Oriented Programming Systems Languages and Applications, OOPSLA 1987"

共 1488 条记录，以下是411-420 订阅

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

详细简洁

排序：

JOLT: Lightweight Dynamic Analysis and Removal of object Churn 08

JOLT: Lightweight Dynamic Analysis and Removal of Object Chu...

引用

23rd Annual ACM conference on object-oriented programming, systems, languages and applications

作者： Shankar, Ajeet Arnold, Matthew Bodik, Rastislav Univ Calif Berkeley Berkeley CA 94720 USA IBM Corp TJ Watson Res Ctr Armonk NY 10504 USA

ISBN: (纸本)9781605582153

It has been observed that component-based applications exhibit object churn, the excessive creation of short-lived objects, often caused by trading performance for modularity. Because churned objects are short-lived, they appear to be good candidates for stack allocation. Unfortunately, most churned objects escape their allocating function, making escape analysis ineffective. We reduce object churn with three contributions. First, we formalize two measures of churn, capture and control (15). Second, we develop lightweight dynamic analyses for measuring both capture and control. Third, we develop an algorithm that uses capture and control to inline portions of the call graph to make churned objects non-escaping, enabling chum optimization via escape analysis. JOLT is a lightweight dynamic churn optimizer that uses our algorithms. We embedded JOLT in the JIT compiler of the IBM J9 commercial JVM, and evaluated JOLT on large application frameworks, including Eclipse and JBoss. We found that JOLT eliminates over 4 times as many allocations as a state-of-the-art escape analysis alone.

关键词： Churn allocation optimization Java virtual machine selective optimization escape analysis inlining

来源：评论

学校读者我要写书评

暂无评论

Enforcing object Protocols by Combining Static and Runtime Analysis 08

Enforcing Object Protocols by Combining Static and Runtime A...

引用

23rd Annual ACM conference on object-oriented programming, systems, languages and applications

作者： Gopinathan, Madhu Rajamani, Sriram K. Indian Inst Sci Bangalore 560012 Karnataka India Microsoft Res India Bangalore Karnataka India

ISBN: (纸本)9781605582153

In this paper, we consider object protocols that constrain interactions between objects in a program. Several such protocols have been proposed in the literature [3, 9, 6, 5]. For many APIs (such as JDOM [23], JDBC [22]), API designers constrain how API clients interact with API objects. In practice, API clients violate such constraints, as evidenced by postings in discussion forums for these APIs. Thus, it is important that API designers specify constraints using appropriate object protocols and enforce them. The goal of an object protocol is expressed as a protocol invariant. Fundamental properties such as ownership can be expressed as protocol invariants. We present a language, PROLANG, to specify object protocols along with their protocol invariants, and a tool, INVCOP++, to check if a program satisfies a protocol invariant. INVCOP++ separates the problem of checking if a protocol satisfies its protocol invariant (called protocol correctness), from the problem of checking if a program conforrns to a protocol (called program conformance). The former is solved using static analysis, and the latter using runtime analysis. Due to this separation (1) errors made in protocol design are detected at a higher level of abstraction, independent of the program's source code, and (2) performance of conformance checking is improved as protocol correctness has been verified statically. We present theoretical guarantees about the way we combine static and runtime analysis, and empirical evidence that our tool INVCOP++ finds usage errors in widely used APIs. We also show that statically checking protocol correctness greatly optimizes the overhead of checking program conformance, thus enabling API clients to test whether their programs use the API as intended by the API designer.

关键词： Invariants Aspect oriented programming Program Verification

来源：评论

学校读者我要写书评

暂无评论

Java Type Inference Is Broken: Can We Fix It? 08

Java Type Inference Is Broken: Can We Fix It?

引用

23rd Annual ACM conference on object-oriented programming, systems, languages and applications

作者： Smith, Daniel Cartwright, Robert Rice Univ Dept Comp Sci Houston TX 77251 USA

ISBN: (纸本)9781605582153

Java 5, the most recent major update to the Java programming Language, introduced a number of sophisticated features, including a major extension to the type system. While the technical details of these new features are complex, much of this complexity is hidden from the typical Java developer by an ambitious type inference mechanism. Unfortunately, the extensions to the Java 5 type system were so novel that their technical details had not yet been thoroughly investigated in the research literature. As a result, the Java 5 compiler includes a pragmatic but flawed type inference algorithm that is, by design, neither sound nor locally complete. The language specification points out that neither of these failures is catastrophic: the correctness of potentially-unsound results must be verified during type checking;and incompleteness can usually be worked around by manually providing the method type parameter bindings for a given call site. This paper dissects the type inference algorithm of Java 5 and proposes a signficant revision that is sound and able to calculate correct results where the Java 5 algorithm fails. The new algorithm is locally complete with the exception of a difficult corner case. Moreover, the new algorithm demonstrates that several arbitrary restrictions in the Java type system-most notably the ban on lower-bounded type parameter declarations and the limited expressibility of intersection types-are unnecessary. We hope that this work will spur the evolution of a more coherent, more comprehensive,generic type system for Java.

关键词： Design languages

来源：评论

学校读者我要写书评

暂无评论

A Theory of Aspects as Latent Topics 08

A Theory of Aspects as Latent Topics

引用

23rd Annual ACM conference on object-oriented programming, systems, languages and applications

作者： Baldi, Pierre F. Lopes, Cristina V. Linstead, Erik J. Bajracharya, Sushil K. Univ Calif Irvine Bren Sch Informat & Comp Sci Irvine CA 92717 USA

ISBN: (纸本)9781605582153

After more than 10 years, Aspect-oriented programming (AOP) is still a controversial idea. While the concept of aspects appeals to everyone's intuitions, concrete AOP solutions often fail to convince researchers and practitioners alike. This discrepancy results in part from a lack of ail adequate theory of aspects, which in turn leads to the development of AOP solutions that are useful in limited situations. We propose a new theory of aspects that can be summarized as follows: concerns are latent topics that can be automatically extracted using statistical topic modeling techniques adapted to software. Software scattering and tangling can be measured precisely by the entropies of the underlying topic-over-files and files-over-topics distributions. Aspects are latent topics with high scattering entropy. The theory is validated empirically on both the large scale, with a study of 4,632 Java projects, and the small scale, with a study of 5 individual projects. From these analyses, we identify two dozen topics that emerge as general-purpose aspects across multiple projects, as well as project-specific topics/concerns. The approach is also shown to produce results that are compatible with previous methods for identifying aspects, and also extends them. Our work provides not only a concrete approach for identifying aspects at several scales in an unsupervised manner but, more importantly, a formulation of AOP grounded in information theory. The understanding of aspects under this new perspective makes additional progress toward the design of models and tools that facilitate software development.

关键词： Aspect-oriented programming Scattering Tangling Topic Models

来源：评论

学校读者我要写书评

暂无评论

A Tag-Based Approach for the Design and Composition of Information Processing applications 08

A Tag-Based Approach for the Design and Composition of Infor...

引用

23rd Annual ACM conference on object-oriented programming, systems, languages and applications

作者： Bouillet, Eric Feblowitz, Mark Liu, Zhen Ranganathan, Anand Riabov, Anton IBM Research Hawthorne NY USA IBM Research Cambridge MA USA

ISBN: (纸本)9781605582153

In the realm of component-based software systems, pursuers of the holy grail of automated application composition face many significant challenges. In this paper we argue that, while the general problem of automated composition in response to high-level goal statements is indeed very difficult to solve, we can realize composition in a restricted context, supporting varying degrees of manual to automated assembly for specific types of applications. We propose a novel paradigm for composition in flow-based information processing systems, where application design and component development are facilitated by the pervasive use of faceted, tag-based descriptions - of processing goals, of component capabilities, and of structural patterns of families of application. The facets and tags represent different dimensions of both data and processing, where each facet is modeled as a finite set of tags that are defined in a controlled folksonomy. All data flowing through the system, as well as the functional capabilities of components are described using tags. A customized AI planner is used to automatically build an application, in the form of a flow of components, given a high-level goal specification in the form of a set of tags. End-users use an automatically populated faceted search and navigation mechanism to construct these high-level goals. We also propose a novel software engineering methodology to design and develop a set of reusable, well-described components that can be assembled into a variety of applications. With examples from a case study in the Financial Services domain, we demonstrate that composition using a faceted, tag-based application design is not only possible, but also extremely useful in helping end-users create situational applications from a wide variety of available components.

关键词： Composition Programmable Web Tag Cloud Automated Application Assembly Tag-based Component Description Component Reuse Faceted Navigation

来源：评论

学校读者我要写书评

暂无评论

Dynamic Optimization for Efficient Strong Atomicity 08

Dynamic Optimization for Efficient Strong Atomicity

引用

23rd Annual ACM conference on object-oriented programming, systems, languages and applications

作者： Schneider, Florian T. Menon, Vijay Shpeisman, Tatiana Adl-Tabatabai, Ali-Reza ETH Dept Comp Sci Zurich Switzerland Google Seattle WA 98103 USA Intel Corp Santa Clara CA 95054 USA

ISBN: (纸本)9781605582153

Transactional memory (TM) is a promising concurrency control alternative to locks. Recent work [30, 1, 25, 26] has highlighted important memory model issues regarding TM semantics and exposed problems in existing TM implementations. For safe, managed languages such as Java, there is a growing consensus towards strong atomicity semantics as a sound, scalable solution. Strong atomicity has presented a challenge to implement efficiently because it requires instrumentation of non-transactional memory accesses, incurring significant overhead even when a program makes minimal or no use of transactions. To minimize overhead, existing solutions require either a sophisticated type system, specialized hardware, or static whole-program analysis. These techniques do not translate easily into a production setting on existing hardware. In this paper, we present novel dynamic optimizations that significantly reduce strong atomicity overheads and make strong atomicity practical for dynamic language environments. We introduce analyses that optimistically track which non-transactional memory accesses can avoid strong atomicity instrumentation, and we describe a lightweight speculation and recovery mechanism that applies these analyses to generate speculatively-optimized but safe code for strong atomicity in a dynamically-loaded environment. We show how to implement these mechanisms efficiently by leveraging existing dynamic optimization infrastructure in a Java system. Measurements on a set of transactional and non-transactional Java workloads demonstrate that our techniques substantially reduce the overhead of strong atomicity from a factor of 5x down to 10% or less over an efficient weak atomicity baseline.

关键词： Algorithms Design Experimentation languages Measurement Performance

来源：评论

学校读者我要写书评

暂无评论

Efficient Local Type Inference 08

Efficient Local Type Inference

引用

23rd Annual ACM conference on object-oriented programming, systems, languages and applications

作者： Bellamy, Ben Avgustinov, Pavel de Moor, Oege Sereni, Damien Univ Oxford Programming Tools Grp Oxford OX1 2JD England

ISBN: (纸本)9781605582153

Inference of static types for local variables in Java bytecode is the first step of any serious tool that manipulates bytecode, be it for decompilation, transformation or analysis. It is important, therefore, to perform that step as accurately and efficiently as possible. Previous work has sought to give solutions with good worst-case complexity. We present a novel algorithm, which is optimised for the common case rather than worst-case performance. It works by first finding a set of minimal typings that are valid for all assignments, and then checking whether these minimal typings satisfy all uses. Unlike previous algorithms, it does not explicitly build a data structure of type constraints, and it is easy to implement efficiently. We prove that the algorithm produces a typing that is both sound (obeying the rules of the language) and as tight as possible. We then go on to present extensive experiments, comparing the results of the new algorithm against the previously best known method. The experiments include bytecode that is generated in other ways than compilation of Java source. The new algorithm is always faster, typically by a factor 6, but on some real benchmarks the gain is as high as a factor of 92. Furthermore, whereas that previous method is sometimes suboptimal, our algorithm always returns a tightest possible type. We also discuss in detail how we handle primitive types, which is a difficult issue due to the discrepancy in their treatment between Java bytecode and Java source. For the application to decompilation, however, it is very important to handle this correctly.

关键词： type inference program analysis

来源：评论

学校读者我要写书评

暂无评论

Sound and Extensible Renaming for Java 08

Sound and Extensible Renaming for Java

引用

23rd Annual ACM conference on object-oriented programming, systems, languages and applications

作者： Schaefer, Max Ekman, Torbjoern de Moor, Oege Univ Oxford Programming Tools Grp Oxford OX1 2JD England

ISBN: (纸本)9781605582153

Descriptive names are crucial to understand code. However, good names are notoriously hard to choose and manually changing a globally visible name can be a maintenance nightmare. Hence, tool support for automated renaming is an essential aid for developers and widely supported by popular development environments. This work improves on two limitations in current refactoring tools: too weak preconditions that lead to unsoundness where names do not bind to the correct declarations after renaming, and too strong preconditions that prevent renaming of certain programs. We identify two main reasons for unsoundness: complex name lookup rules make it hard to define sufficient preconditions, and new language features require additional preconditions. We alleviate both problems by presenting a novel extensible technique for creating symbolic names that are guaranteed to bind to a desired entity in a particular context by inverting lookup functions. The inverted lookup functions can then be tailored to create qualified names where otherwise a conflict would occur, allowing the refactoring to proceed and improve on the problem with too strong preconditions. We have implemented renaming for Java as an extension to the JastAdd Extensible Java Compiler and integrated it in Eclipse. We show examples for which other refactoring engines have too weak preconditions, as well as examples where our approach succeeds in renaming entities by inserting qualifications. To validate the extensibility of the approach we have implemented renaming support for Java 5 and AspectJ like inter-type declarations as modular extensions to the initial Java 1.4 refactoring engine. The renaming engine is only a few thousand lines of code including extensions and performance is on par with industrial strength refactoring tools.

关键词： Refactoring name analysis renaming extensible compilers

来源：评论

学校读者我要写书评

暂无评论

Companion to the 21st ACM SIGPLAN conference on object-oriented programming systems, languages, and applications, oopsla 2006

Companion to the 21st ACM SIGPLAN Conference on Object-orien...

引用

21st Annual ACM SIGPLAN conference on object-oriented programming systems, languages, and applications, oopsla 2006

ISBN: (纸本)159593491X

The proceedings contain 122 papers. The topics discussed include: scale changes everything;a growable language;faith, evolution, and programming languages: from haskell to java to links;the geography of programming;applying a UML-based agent modeling language to the autonomic computing domain;keeping track of crosscutting requirements in UML models via context-based constraints;pegasus: first steps toward a naturalistic programming language;a commensalistic software system;collaborative diffusion: programming antiobjects;JDA: a step towards large-scale reuse on the web;model-based DSL frameworks;LCSD: library-centric software design;eclipse technology exchange workshop (ETX2006);the 6th oopsla workshop on domain-specific modeling;workshop on event driven architecture;escaped from the lab: software practices in large organizations;creating an informative workspace;and 4th int'l workshop on SOA and web services.

关键词： Technical presentations

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 21st Annual ACM SIGPLAN conference on object-oriented programming systems, languages, and applications, oopsla 2006

Proceedings of the 21st Annual ACM SIGPLAN Conference on Obj...

引用

21st Annual ACM SIGPLAN conference on object-oriented programming systems, languages, and applications, oopsla 2006

ISBN: (纸本)1595933484

The proceedings contain 30 papers. The topics discussed include: eliminating distinctions of class: using prototypes to model virtual classes;J&: nested intersection for scalable software composition;statically scoped object adaptation with expanders;a framework for implementing pluggable type systems;design fragments make using frameworks easier;JTL: the Java tools language;adapting virtual machine techniques for seamless aspect support;efficient control flow quantification;uniform proxies for Java;javana: a system for building customized Java program analysis tools;the DaCapo benchmarks: Java benchmarking development and analysis;virgil: objects on the head of a pin;declarative, formal, and extensible syntax definition for aspectJ;method-specific dynamic compilation using logistic regression;replay compilation: improving debuggability of a just-in-time compiler;and a flexible framework for implementing software transactional memory.

关键词： Technical presentations

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共149页 << < 38 39 40 41 42 43 44 45 46 47 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：