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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,399 篇 工学
- 1,354 篇 软件工程
- 1,101 篇 计算机科学与技术...
- 176 篇 控制科学与工程
- 38 篇 信息与通信工程
- 21 篇 建筑学
- 15 篇 土木工程
- 15 篇 生物工程
- 13 篇 电气工程
- 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,424 篇 英文
69 篇 其他

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

共 1493 条记录，以下是931-940 订阅

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

详细简洁

排序：

How difficult is the transition from OOA to OOD?

How difficult is the transition from OOA to OOD?

引用

2000 conference on object-oriented programming, systems, languages, and applications, oopsla 2000

作者： Kaindl, Hermann Frank, Karl Jacobson, Ivar Mellor, Stephen Miller, Joaquin Siemens AG Österreich PSE Geusaugasse 17 A-1030 Vienna Austria

ISBN: (纸本)1581133073

One of the claimed advantages of object-oriented (OO) development is that developers can use objects in a uniform modeling approach throughout the process. In particular, they can coherently apply the same notation for representing these objects and their relations in both analysis and design. Given this, the claims by many OO methodologists (see, e.g., [1, 5]) that the transition from OO analysis (OOA) to OO design (OOD) is easy and smooth may seem convincing. However, the contrasting view can be found in [2, 4] that it is actually difficult to go from OOA to OOD and, recognizing the differences between what is modeled in the analysis and design phases can lead to a more conscious development approach. In the light of such controversial views, it seems to be necessary to widely discuss this issue. The prospective panelists represent a wide spectrum of related views. So, there is some hope that this panel might more or less resolve this important issue. A consequence of resolving this issue might be a contribution to a better understanding of a paradox in the current software business: software is wanted faster and at the same time with higher quality than ever before. Does the view that the transition from OOA to OOD might be easy promise too much in the direction of quick solutions? © 2000 ACM.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Adaptive optimization in the Jalapeño JVM

Adaptive optimization in the Jalapeño JVM

引用

2000 conference on object-oriented programming, systems, languages, and applications, oopsla 2000

作者： Arnold, Matthew Fink, Stephen Grove, David Hind, Michael Sweeney, Peter F. IBM T.J. Watson Research Center United States Rutgers University United States

ISBN: (纸本)1581133073

Future high-performance virtual machines will improve performance through sophisticated online feedback-directed optimizations. This paper presents the architecture of the Jalapeño Adaptive Optimization System, a system to support leading-edge virtual machine technology and enable ongoing research on online feedback-directed optimizations. We describe the extensible system architecture, based on a federation of threads with asynchronous communication. We present an implementation of the general architecture that supports adaptive multi-level optimization based purely on statistical sampling. We empirically demonstrate that this profiling technique has low overhead and can improve startup and steady-state performance, even without the presence of online feedback-directed optimizations. The paper also describes and evaluates an online feedback-directed inlining optimization based on statistical edge sampling. The system is written completely in Java, applying the described techniques not only to application code and standard libraries, but also to the virtual machine itself.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Finding refactorings via change metrics

Finding refactorings via change metrics

引用

conference on object-oriented programming, systems, Lnaguages & applications (oopsla 00)

作者： Demeyer, S Ducasse, S Nierstrasz, O Univ Instelling Antwerp LORE B-2610 Wilrijk Belgium Univ Bern SCG CH-3012 Bern Switzerland

Reverse engineering is the process of uncovering the design and the design rationale from a functioning software system. Reverse engineering is an integral part of any successful software system, because changing requirements lead to implementations that drift from their original design. In contrast to traditional reverse engineering techniques -which analyse a single snapshot of a system- we focus the reverse engineering effort by determining where the implementation has changed. Since changes of object-oriented software are often phrased in terms of refactorings, we Propose a set of heuristics for detecting refactorings by applying lightweight, object-oriented metrics to successive versions of a software system. We validate our approach with three separate case studies of mature object-oriented software systems for which multiple versions are available. The case studies suggest that the heuristics support the reverse engineering process by focusing attention on the relevant parts of a software system.

关键词： reverse engineering metrics refactoring software evolution object-oriented frameworks

来源：评论

学校读者我要写书评

暂无评论

Towards a two-dimensional separation of concerns

Towards a two-dimensional separation of concerns

引用

2000 conference on object-oriented programming, systems, languages, and applications, oopsla 2000

作者： Constantinides, Constantinos A. Elrad, Tzilla Department of Computer Science Illinois Institute of Technology Chicago IL United States

ISBN: (纸本)1581133073

As the size and requirements of software systems increase, their design has reached a complexity that requires software engineers to revisit the principle of separation of concerns [5]. Traditional software organization has been performed along some form of functional decomposition. Different paradigms and languages support the implementation, and composition of sub-parts into whole systems through the availability of some modular unit of functionality (component). In essence, traditional software decomposition and current programming languages have been mutually supportive [4]. At the same time, separation of concerns can only be beneficial if the different concerns can be effectively composed to produce the overall system. The OOP paradigm seems to work well only if the problem to be solved can be described with relatively simple interfaces among objects. Unfortunately, this is not the case when we move from sequential programming to concurrent programming where the component interaction violates simple object interfaces. One of the reasons behind this is the inherent structure of today's software systems that conceptually does not lead itself to a safe decomposition. As a result, the benefits associated with OOP no longer hold. Component interactions limit reuse and make it difficult to validate the design and correctness of software systems. Reengineering of these systems is needed in order to meet future changes in requirements. This component interaction is based on a number of properties that affect the semantics or the performance of the system and do not localize well in one modular unit, but tend to cut-across groups of components resulting in a "code tangling" [4]. Example cross-cutting properties (or aspects) include synchronization, scheduling, and fault tolerance. This code tangling destroys modularity, making the source code difficult to develop and difficult to understand. It also limits reuse, making the source code difficult to evolve. It further m

关键词： Aspect oriented programming

来源：评论

学校读者我要写书评

暂无评论

A study of devirtualization techniques for a Java™ just-in-time compiler

A study of devirtualization techniques for a Java™ just-in-...

引用

conference on object-oriented programming, systems, Lnaguages & applications (oopsla 00)

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

Many devirtualization techniques have been proposed to reduce the runtime overhead of dynamic method calls for various object-oriented languages, however, most of them are less effective or cannot be applied for Java in a straightforward manner. This is partly because Java is a statically-typed language and thus transforming a dynamic call to a static one does not make a tangible performance gain (owing to the low overhead of accessing the method table) unless it is inlined, and partly because the dynamic class loading feature of Java prohibits the whole program analysis and optimizations from being applied. We propose a new technique called direct devirtualization with the code parching mechanism. For a given dynamic call site, our compiler first determines whether the call can be devirtualized, by analyzing the current class hierarchy. When the call is devirtualizable and the target method is suitably sized, the compiler generates the inlined code of the method, together with the backup code of making the dynamic call. Only the inlined code is actually executed until our assumption about the devirtualization becomes invalidated, at which time the compiler performs code patching to make the backup code executed subsequently. Since the new technique prevents some code motions across the merge point between the inlined code and the backup code, we have furthermore implemented recently-known analysis techniques, such as type analysis and preexistence analysis, which allow the backup code to be completely eliminated. We made various experiments using 16 real programs to understand the effectiveness and characteristics of the devirtualization techniques in our Java Just-In-Time (JIT) compiler. In summary, we reduced the number of dynamic calls by ranging from 8.9% to 97.3% (the average of 40.2%), and we improved the execution performance by ranging from -1% to 133% (with the geometric mean of 16%).

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Formal specification of CORBA services: Experience and lessons learned

Formal specification of CORBA services: Experience and lesso...

引用

conference on object-oriented programming systems, languages, and applications

作者： Bastide, R. Palanque, P. Sy, O. Navarre, D. LIHS Université Toulouse 1 Place Anatole France F-31042 Toulouse Cedex France

CORBA is now established as one of the main contenders in object-oriented middleware. Beyond the definition of this standard for distributed object systems, the object Management Group (OMG) has specified several object services (Common object Services, COS) that should foster the interoperability of distributed applications. Based on experiment, the goal of this paper is to show that the OMG's style of specification of the CORBA services is not suited to guarantee that implementers will produce interoperable and substitutable implementations. To illustrate our point, we give an account of an experiment based upon the formal specification of one COS, namely the CORBA Event Service. This formal specification highlights several ambiguities and under-specifications in the OMG document. We then test several commercial and public domain implementations of the CORBA Event Service, in order to assess how the implementers have dealt with these under-specifications. We show that the choices made by the implementers lead to incompatible implementations. We finally suggest a solution to overcome the problem of specification of object services, which satisfies the views of both implementers and users. Specifically, we suggest that the specification of such services be made using a formal description technique, and that implementers be provided with test cases derived from the formal specification.

关键词： object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A formal specification of Java™ class loading

A formal specification of Java™ class loading

引用

conference on object-oriented programming systems, languages, and applications

作者： Qian, Z. Goldberg, A. Coglio, A. Kestrel Institute 3260 Hillview Avenue Palo Alto CA 94304 United States

The Java Virtual Machine (JVM) has a novel and powerful mechanism to support lazy, dynamic class loading according to user-definable policies. Class loading directly impacts type safety, on which the security of Java applications is based. Conceptual bugs in the loading mechanism were found in earlier versions of the JVM that lead to type violations. A deeper understanding of the class loading mechanism, through such means as formal analysis, will improve our confidence that no additional bugs are present. The work presented in this paper provides a formal specification of (the relevant aspects of) class loading in the JVM and proves its type safety. Our approach to proving type safety is different from the usual ones since classes are dynamically loaded and full type information may not be statically available. In addition, we propose an improvement in the interaction between class loading and bytecode verification, which is cleaner and enables lazier loading.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Scalable propagation-based call graph construction algorithms

Scalable propagation-based call graph construction algorithm...

引用

conference on object-oriented programming, systems, Lnaguages & applications (oopsla 00)

作者： Tip, F Palsberg, J IBM Corp Thomas J Watson Res Ctr Yorktown Heights NY 10598 USA Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time values of expressions. In practice, algorithms such as RTA that use a single set for the whole program scale well. The scalability of algorithms such as 0-CFA that use one set per expression remains doubtful. In this paper, we investigate the design space between RTA and 0-CFA. We have implemented various novel algorithms in the context of Jax, an application extractor for Java, and shown that they all scale to a 325,000-line program. A key property of these algorithms is that they do not analyze values on the run-time stack, which makes them efficient and easy to implement. Surprisingly for detecting unreachable methods, the inexpensive RTA algorithm does almost as well as the seemingly more powerful algorithms. However, for determining call sites with a single target, one of our new algorithms obtains the current best tradeoff between speed and precision.

关键词： Computer systems programming

来源：评论

学校读者我要写书评

暂无评论

A real world object modeling method for creating simulation environment of real-time systems

A real world object modeling method for creating simulation ...

引用

conference on object-oriented programming, systems, Lnaguages & applications (oopsla 00)

作者： Lee, JY Kim, HJ Kang, KC Pohang Univ Sci & Technol Nam Gu Pohang 790784 Kyoungbuk South Korea

Most real-time embedded control software feature complex interactions with asynchronous inputs and environment objects, and a meaningful simulation of a real-time control software specification requires realistic simulation of its environment. Two problems that need to be addressed in the simulation of a target software system and its environment: First, integration and simulation of the specifications of a target software system and its artificial environment are often performed too late in the lifecycle to provide any significant value. Second, real world objects in the environment usually have spatial characteristics (form) such as shape, motion, etc. that must be specified for simulation, and there is no method to express these spatial characteristics at various levels of abstraction that are adequate for the required simulation fidelity. To address these problems, we have developed a method that supports incremental specification and simulation of both the target software system and its environmental objects. The method includes: (1) a specification method for behavior, function, and form integrated objects;(2) form specification primitives that abstract common spatial characteristics of real world objects, their typical spatial relations, and spatial interactions;and (3) a methodology that refines, verifies, and validates behavior, function, and form specification of both the real-time embedded control software and its environment in a systematic and incremental manner. The proposed specification, verification, and validation method has been applied to a robot control system example to demonstrate its effectiveness and usefulness.

关键词： real-time control software requirement specification simulation verification validation

来源：评论

学校读者我要写书评

暂无评论

Practical virtual method call resolution for Java

Practical virtual method call resolution for Java

引用

conference on object-oriented programming, systems, Lnaguages & applications (oopsla 00)

作者： Sundaresan, V Hendren, L Razafimahefa, C Vallée-Rai, R Lam, P Gagnon, E Godin, C McGill Univ Sch Comp Sci Sable Res Grp Montreal PQ H3A 2A7 Canada

This paper addresses the problem of resolving virtual method and interface calls in Java bytecode. The main focus is on a new practical technique that can be used to analyze large applications. Our fundamental design goal was to develop a technique that can be solved with only one iteration, and thus scales linearly with the size of the program, while at the same time providing more accurate results than two popular existing linear techniques, class hierarchy analysis and rapid type analysis. We present two variations of our new technique, variable-type analysis and a coarser-grain version called declared-type analysis. Both of these analyses are inexpensive, easy to implement, and our experimental results show that they scale linearly in the size of the program. We have implemented our new analyses using the Soot framework, and we report on empirical results for seven benchmarks. We have used our techniques to build accurate call graphs for complete applications (including libraries) and we show that compared to a conservative call graph built using class hierarchy analysis, our new variable-type analysis can remove a significant number of nodes (methods) and call edges. Further, our results show that we can improve upon the compression obtained using rapid type analysis. We also provide dynamic measurements of monomorphic call sites, focusing on the benchmark code excluding libraries. We demonstrate that when considering only the benchmark code, both rapid type analysis and our new declared-type analysis do not add much precision over class hierarchy analysis. However, our finer-grained variable-type analysis does resolve significantly more call sites, particularly for programs with more complex uses of objects.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共150页 << < 90 91 92 93 94 95 96 97 98 99 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：