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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 期刊文献
4 册 图书

馆藏范围

1,492 篇 电子文献
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,423 篇 英文
69 篇 其他

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

共 1492 条记录，以下是521-530 订阅

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

详细简洁

排序：

MicroPhase: An approach to proactively invoking garbage collection for improved performance

MicroPhase: An approach to proactively invoking garbage coll...

引用

22nd International conference on object-oriented programming, systems, languages and applications

作者： Xian, Feng Srisa-an, Witawas Jiang, Hong Univ Nebraska Dept Comp Sci & Engn Lincoln NE 68588 USA

ISBN: (纸本)1595937862

To date, the most commonly used criterion for invoking garbage collection (GC) is based on heap usage;that is, garbage collection is invoked when the heap or an area inside the heap is full. This approach can suffer from two performance shortcomings: untimely garbage collection invocations and large volumes of surviving objects. In this work, we explore a newGC triggering approach called MicroPhase that exploits two observations: (i) allocation requests occur in phases and (ii) phase boundaries coincide with times when most objects also die. Thus, proactively invoking garbage collection at these phase boundaries can yield high efficiency. We extended the HotSpot virtual machine from Sun Microsystems to support MicroPhase and conducted experiments using 20 benchmarks. The experimental results indicate that our technique can reduce the GC times in 19 applications. The differences in GC overhead range from an increase of 1% to a decrease of 26% when the heap is set to twice the maximum live-size. As a result, MicroPhase can improve the overall performance of 13 benchmarks. The performance differences range from a degradation of 2.5% to an improvement of 14%.

关键词： experimentation languages performance

来源：评论

学校读者我要写书评

暂无评论

Modular typestate checking of aliased objects 07

Modular typestate checking of aliased objects

引用

22nd International conference on object-oriented programming, systems, languages and applications

作者： Bierhoff, Kevin Aldrich, Jonathan Carnegie Mellon Univ Sch Comp Sci Inst Software Res Pittsburgh PA 15213 USA

ISBN: (纸本)9781595937865

objects often define usage protocols that clients must follow in order for these objects to work properly. Aliasing makes it notoriously difficult to check whether clients and implementations are compliant with such protocols. Accordingly, existing approaches either operate globally or severely restrict aliasing. We have developed a sound modular protocol checking approach, based on typestates, that allows a great deal of flexibility in aliasing while guaranteeing the absence of protocol violations at runtime. The main technical contribution is a novel abstraction, access permissions, that combines typestate and object aliasing information. In our methodology, developers express their protocol design intent through annotations based on access permissions. Our checking approach then tracks permissions through method implementations. For each object reference the checker keeps track of the degree of possible aliasing and is appropriately conservative in reasoning about that reference. This helps developers account for object manipulations that may occur through aliases. The checking approach handles inheritance in a novel way, giving subclasses more flexibility in method overriding. Case studies on Java iterators and streams provide evidence that access permissions can model realistic protocols, and protocol checking based on access permissions can be used to reason precisely about the protocols that arise in practice.

关键词： languages verification typestates aliasing permissions linear logic behavioral subtyping

来源：评论

学校读者我要写书评

暂无评论

Ptidej and decor: identification of design patterns and design defects

Ptidej and decor: identification of design patterns and desi...

引用

WikiSym'07, ISMM'07, HPC-GECO/CompFrame'07, DLS'07 - 22nd ACM SIGPLAN conference on object-oriented programming systems and applications Companion, oopsla'07

作者： Moha, Naouel Gúeh´eneuc, Yann-Gäel Ptidej Team - GEODES Group D´epartement d'informatique Recherche opérationnelle Universit´e de Montr´eal QC Canada

ISBN: (纸本)9781595938657

The PTIDEJ project started in 2001 to study code generation from and identification of patterns. Since then, it has evolved into a complete reverse-engineering tool suite that includes several identification algorithms. It is a flexible tool suite that attempts to ease as much as possible the development of new identification and analysis algorithms. Recently, the module DECOR has been added to PTIDEJ and allows the detection of design defects, which are recurring design problems. In this demonstration, we particularly focus on the creation and use of identification algorithms for design patterns and defects.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

The JastAdd extensible java compiler

The JastAdd extensible java compiler

引用

22nd Annual ACM SIGPLAN International conference on object-oriented programming, systems, languages, and applications, oopsla'07

作者： Ekman, Torbjörn Görel, Hedin Programming Tools Group University of Oxford United Kingdom Department of Computer Science Lund University Sweden

ISBN: (纸本)1595937862

The JastAdd Extensible Java Compiler is a high quality Java that is easy to extend in order to build static analysis for Java, and to extend Java with new language constructs. built modularly, with a Java 1.4 compiler that is to a Java 5 compiler. Example applications that are as extensions include an alternative backend that generates, an extension of Java with AspectJ constructs, the implementation of a pluggable type system for nonnull and inference. system is implemented using JastAdd, a declarative like language. We describe the compiler architecture, major design ideas for building and extending the compiler, particular, for dealing with complex extensions that name and type analysis. Our extensible compiler compares favorably concerning quality, speed and size with extensible Java compiler frameworks. It also compares in quality and size compared with traditional nonextensible compilers, and it runs within a factor of three compared to javac. © 2007 ACM.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Improve software quality with semmle code-an eclipse plugin for semantic code search

Improve software quality with semmle code-an eclipse plugin ...

引用

WikiSym'07, ISMM'07, HPC-GECO/CompFrame'07, DLS'07 - 22nd ACM SIGPLAN conference on object-oriented programming systems and applications Companion, oopsla'07

作者： Verbaere, Mathieu Hajiyev, Elnar Moor, Oege De Semmle Ltd. Robert Robinson Avenue Oxford OX4 4GA United Kingdom

ISBN: (纸本)9781595938657

Navigate code, find bugs, computemetrics, check style rules, and enforce coding conventions in Eclipse with Semmle- Code. SemmleCode is a new free Eclipse plugin that allows you to phrase these tasks as queries over the codebase - it thus takes the search facilities in Eclipse to a whole new level. A large library of queries for common operations is provided, including metrics and Java EE style rules. Query results can be displayed as a tree view, a table view, in the problem view, as charts or graphs, all with links to the source code.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

MOP: An efficient and generic runtime verification framework 07

MOP: An efficient and generic runtime verification framework

引用

oopsla 2007: 22nd International conference on object-oriented programming, systems, languages, and applications

作者： Feng, Chen Rosu, Grigore University of Illinois Urbana-Champaign United States

ISBN: (纸本)9781595937865

Monitoring-oriented programming (MOP1) [21, 18, 22, 19] is a formal framework for software development and analysis, in which the developer specifies desired properties using definable specification formalisms, along with code to execute when properties are violated or validated. The MOP framework automatically generates monitors from the specified properties and then integrates them together with the user-defined code into the original system. The previous design of MOP only allowed specifications without parameters, so it could not be used to state and monitor safety properties referring to two or more related objects. In this paper we propose a parametric specification-formalism-independent extension of MOP, together with an implementation of JavaMOP that supports parameters. In our current implementation, parametric specifications are translated into AspectJ code and then weaved into the application using off-the-shelf AspectJ compilers;hence, MOP specifications can be seen as formal or logical aspects. Our JavaMOP implementation was extensively evaluated on two benchmarks, Dacapo [14] and Tracematches [8], showing that runtime verification in general and MOP in particular are feasible. In some of the examples, millions of monitor instances are generated, each observing a set of related objects. To keep the runtime overhead of monitoring and event observation low, we devised and implemented a decentralized indexing optimization. Less than 8% of the experiments showed more than 10% runtime overhead;in most cases our tool generates monitoring code as efficient as the hand-optimized code. Despite its genericity, JavaMOP is empirically shown to be more efficient than runtime verification systems specialized and optimized for particular specification formalisms. Many property violations were detected during our experiments;some of them are benign, others indicate defects in programs. Many of these are subtle and hard to find by ordinary testing. Copyright © 2007 ACM.

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

Probabilistic calling context 07

Probabilistic calling context

引用

22nd International conference on object-oriented programming, systems, languages and applications

作者： Bond, Michael D. McKinley, Kathryn S. Univ Texas Austin Dept Comp Sci Austin TX 78712 USA

ISBN: (纸本)9781595937865

Calling context enhances program understanding and dynamic analyses by providing a rich representation of program location. Compared to imperative programs, object-oriented programs use more interprocedural and less intraprocedural control flow, increasing the importance of context sensitivity for analysis. However, prior online methods for computing calling context, such as stack-walking or maintaining the current location in a calling context tree, are expensive in time and space. This paper introduces a new online approach called probabilistic calling context (PCC) that continuously maintains a probabilistically unique value representing the current calling context. For millions of unique contexts, a 32-bit PCC value has few conflicts. Computing the PCC value adds 3% average overhead to a Java virtual machine. PCC is well-suited to clients that detect new or anomalous behavior since PCC values from training and production runs can be compared easily to detect new context-sensitive behavior;clients that query the PCC value at every system call, Java utility call, and Java API call add 0-9% overhead on average. PCC adds space overhead proportional to the distinct contexts stored by the client (one word per context). Our results indicate PCC is efficient and accurate enough to use in deployed software for residual testing, bug detection, and intrusion detection.

关键词： reliability security performance experimentation calling context dynamic context sensitivity probabilistic residual testing anomaly-based bug detection intrusion detection managed languages

来源：评论

学校读者我要写书评

暂无评论

Using early phase termination to eliminate load imbalances at barrier synchronization points 07

Using early phase termination to eliminate load imbalances a...

引用

22nd International conference on object-oriented programming, systems, languages and applications

作者： Rinard, Martin MIT Dept Elect Engn & Comp Sci Comp Sci & Artific Intelligence Lab Cambridge MA 02139 USA

ISBN: (纸本)9781595937865

We present a new technique, early phase termination, for eliminating idle processors in parallel computations that use barrier synchronization. This technique simply terminates each parallel phase as soon as there are too few remaining tasks to keep all of the processors busy. Although this technique completely eliminates the idling that would otherwise occur at barrier synchronization points, it may also change the computation and therefore the result that the computation produces. We address this issue by providing probabilistic distortion models that characterize how the use of early phase termination distorts the result that the computation produces. Our experimental results show that for our set of benchmark applications, 1) early phase termination can improve the performance of the parallel computation, 2) the distortion is small (or can be made to be small with the use of an appropriate compensation technique) and 3) the distortion models provide accurate and tight distortion bounds. These bounds can enable users to evaluate the effect of early phase termination and confidently accept results from parallel computations that use this technique if they find the distortion bounds to be acceptable. Finally, we identify a general computational pattern that works well with early phase termination and explain why computations that exhibit this pattern can tolerate the early termination of parallel tasks without producing unacceptable results.

关键词： performance reliability design languages barrier synchronization parallel computing probabilistic distortion models early phase termination

来源：评论

学校读者我要写书评

暂无评论

STARC: Static Analysis for Efficient Repair of Complex Data

STARC: Static Analysis for Efficient Repair of Complex Data

引用

22nd Annual ACM SIGPLAN International conference on object-oriented programming, systems, languages, and applications, oopsla'07

作者： Elkarablieh, Bassem Sarfraz, Khurshid Vu, Duy McKinley, Kathryn S. University of Texas Austin United States

ISBN: (纸本)1595937862

Data structure corruptions are insidious bugs that reduce reliability of software systems. Constraint-based data repair promises to help programs recover from crippling corruption errors. Prior work repairs variety of relatively small data structures, usually with of nodes. present STARC which uses static analysis to repair structures with tens of thousands of nodes. Given a predicate method that describes the integrity constraints a structure, STARC statically analyzes the method to : (1) the recurrent fields, i.e., fields that the predicate uses to traverse the structure; and (2) local fieldconstraints, i.e., how the value of an object field is related to value of a neighboring object field. STARC executes the method on the structure and monitors its execution identify corrupt object fields, which STARC then repairs a systematic search of a neighborhood of the given. Each repair action is guided by the result of the analysis, which enables more efficient and effective compared to prior work. Experimental results show STARC can repair structures with tens of thousands of, up to 100 times larger than prior work. efficiency is probably not practical for very large structures in deployed systems, but opens a promising direction for future work. Copyright 2007 ACM.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Mining modal scenarios from execution traces: Poster abstract

Mining modal scenarios from execution traces: Poster abstrac...

引用

WikiSym'07, ISMM'07, HPC-GECO/CompFrame'07, DLS'07 - 22nd ACM SIGPLAN conference on object-oriented programming systems and applications Companion, oopsla'07

作者： Lo, David Maoz, Shahar Khoo, Siau-Cheng National University of Singapore Singapore Weizmann Institute of Science Israel

ISBN: (纸本)9781595938657

Specification mining is a dynamic analysis process aimed at automatically inferring suggested specifications of a program from its execution traces. We describe a method, a framework, and a tool, for mining inter-object scenariobased specifications in the form of a UML2-compliant variant of Damm and Harel's Live Sequence Charts (LSC), which extends the classical partial order semantics of sequence diagrams with temporal liveness and symbolic class level lifelines, in order to generate compact and expressive specifications. Moreover, we use previous research work and tools developed for LSC to visualize, analyze, manipulate, test, and thus evaluate the scenario-based specifications we mine. Our mining framework is supported by statistically sound metrics. We demonstrate and evaluate our work using a case study.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共150页 << < 49 50 51 52 53 54 55 56 57 58 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：