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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

18 篇 会议

馆藏范围

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

日期分布

学科分类号

16 篇 工学
- 13 篇 计算机科学与技术...
- 12 篇 软件工程
- 3 篇 信息与通信工程
- 3 篇 控制科学与工程
- 2 篇 机械工程
- 1 篇 环境科学与工程（可...
- 1 篇 网络空间安全
3 篇 管理学
- 3 篇 图书情报与档案管...

主题

3 篇 java programming...
2 篇 virtual machine
1 篇 dsm system
1 篇 dsm
1 篇 vrml
1 篇 geometric simula...
1 篇 active networks
1 篇 scanning
1 篇 just in time pro...
1 篇 semantics
1 篇 security
1 篇 multitasking
1 篇 ultra high-speed...
1 篇 virtual machinin...
1 篇 engines
1 篇 distributed comp...

机构

2 篇 ibm t. j. watson...
1 篇 japan science an...
1 篇 dept. of compute...
1 篇 ibm tj watson re...
1 篇 sun microsystems
1 篇 simon fraser uni...
1 篇 network computin...
1 篇 institute for hu...
1 篇 ibm haifa resear...
1 篇 sun microsystems...
1 篇 department of co...
1 篇 fujitsu labs ltd...
1 篇 northeastern uni...
1 篇 dept. of compute...
1 篇 sable research g...
1 篇 tokyo institute ...
1 篇 department elis ...
1 篇 fujitsu laborato...

作者

1 篇 barabash katheri...
1 篇 ernst matthias
1 篇 lee j.l.
1 篇 ting-wei hou
1 篇 shepherd janice
1 篇 ngo ton a.
1 篇 chen fuh-gwo
1 篇 buchbinder niv
1 篇 domani tamar
1 篇 bradshaw jeffrey...
1 篇 fonck stijn
1 篇 hendren laurie j...
1 篇 maruyama fuyuhik...
1 篇 cameron robert d...
1 篇 grove david
1 篇 seidl matthew l.
1 篇 gagnon etienne m...
1 篇 cocchi anthony
1 篇 padua david a.
1 篇 russell kenneth

语言

18 篇 英文

检索条件"任意字段=1st Java Virtual Machine Research and Technology Symposium, JVM 2001"

共 18 条记录，以下是1-10 订阅

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

详细简洁

排序：

Proceedings of the 1st java virtual machine research and technology symposium, jvm 2001

Proceedings of the 1st Java Virtual Machine Research and Tec...

引用

1st java virtual machine research and technology symposium, jvm 2001

ISBN: (纸本)1880446111

The proceedings contain 24 papers. The topics discussed include: on the software virtual machine for the real hardware stack machine;mostly accurate stack scanning;can a shape analysis work at run-time?;jvm susceptibility to memory errors;the java hotspot server compiler;SableVM: a research framework for the efficient execution of java bytecode;proof linking: distributed verification of java classfiles in the presence of multiple classloaders;JaRec: Record/Replay for Multi-threaded java Programs;Kaffemik - a distributed jvm featuring a single address space;and state capture and resource control for java: the design and implementation of the aroma virtual machine.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Implementing JNI in java for Jalapeño 1

Implementing JNI in Java for Jalapeño

引用

1st java virtual machine research and technology symposium, jvm 2001

作者： Ngo, Ton A. Smith, steve E. IBM T. J. Watson Research Center Yorktown HeightsNY10598 United States

来源：评论

学校读者我要写书评

暂无评论

JaRec: Record/Replay for multi-threaded java programs 1

JaRec: Record/Replay for multi-threaded java programs

引用

1st java virtual machine research and technology symposium, jvm 2001

作者： Christiaens, Mark Fonck, stijn Naudts, Dries Ronsse, Michiel De Bosschere, Koen Department ELIS Ghent University Sint-Pietersnieuwstraat 41 Gent9000 Belgium

来源：评论

学校读者我要写书评

暂无评论

A java compiler for many memory models - Extended abstract 1

A java compiler for many memory models - Extended abstract

引用

1st java virtual machine research and technology symposium, jvm 2001

作者： Midkiff, Samuel P. Lee, Jaejin Padua, David A. IBM TJ Watson Research United States Dept. of Computer Science and Engineering Michigan State University United States Dept. of Computer Science University of Illinois at Urbana-Champaign United States

来源：评论

学校读者我要写书评

暂无评论

Proof linking: Distributed verification of java classfiles in the presence of multiple classloaders 1

Proof linking: Distributed verification of java classfiles i...

引用

1st java virtual machine research and technology symposium, jvm 2001

作者： Fong, Philip W. L. Cameron, Robert D. Simon Fraser University BC Canada

ISBN: (纸本)1880446111

To offload the computational burden of bytecode verification within java virtual machines (jvm), distributed verification systems may be created using any one of a number of verification protocols, based on such techniques as proof-carrying code and signed verification by trusted authorities. This paper advocates the adoption of a previously-proposed mobile code verification architecture, proof linking, as a standard infrastructure for performing distributed verification in the jvm. Proof linking not only supports both CLDC-style and signature-based distributed verification protocols, but it also provides interoperability between the two. To ground our work in the real-world requirements of java bytecode verification, we also extend previous work on proof linking to handle multiple classloaders. © 2001 The USENIX Association.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

SableVM: A research framework for the efficient execution of java bytecode 1

SableVM: A research framework for the efficient execution of...

引用

1st java virtual machine research and technology symposium, jvm 2001

作者： Gagnon, Etienne M. Hendren, Laurie J. Sable Research Group School of Computer Science McGill University Canada

ISBN: (纸本)1880446111

SableVM is an open-source virtual machine for java intended as a research framework for efficient execution of java bytecode1. The framework is essentially composed of an extensible bytecode interpreter using state-of-the-art and innovative techniques. Written in the C programming language, and assuming minimal system dependencies, the interpreter emphasizes high-level techniques to support efficient execution. In particular, we introduce a biderectional layout for ob ject instances that groups reference fields sequentially to allow efficient garbage collection. We also introduce a sparse interface virtual table layout that reduces the cost of interface method calls to that of normal virtual calls. Finally, we present a technique to improve thin locks[13] by eliminating busy-wait in presence of contention. © 2001 The USENIX Association.

关键词： java programming language

来源：评论

学校读者我要写书评

暂无评论

An executable formal java virtual machine thread model 1

An executable formal java virtual machine thread model

引用

1st java virtual machine research and technology symposium, jvm 2001

作者： Moore, J strother Porter, George M. Department of Computer Sciences University of Texas at Austin AustinTX78712 United States

ISBN: (纸本)1880446111

We discuss an axiomatic description of a simple abstract machine similar to the java virtual machine (jvm). Our model supports classes, with fields and bytecoded methods, and a representative sampling of jvm bytecodes for basic operations for both data and control. The GETFIELD and PUTFIELD instructions accurately model inheritance, as does the INVOKEvirtual instruction. Our model supports multiple threads, synchronized methods, and monitors. Our current model is inadequate or inaccurate in many respects (e.g., we do not formalize the jvm's finite arithmetic nor do we describe class loading and initialization). But the model is a useful tool for studying the application of formal reasoning to the jvm and to java programs. We demonstrate two useful aspects of an operational formal semantics. First, the model is executable: bytecoded methods can be run on the model. Second, the model allows us to prove theorems about those methods or, more generally, about the model. Because the jvm provides a relatively clean semantics for java, our model can be thought of as a step towards java software verification. We illustrate these points. We cite some theorems proved about our model, including a theorem involving unbounded multi-threading and mutual exclusion with MONITORENTER and MONITOREXIT. Our proofs are carried out with the ACL2 theorem prover. © 2001 The USENIX Association.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

The HotSpot™ serviceability agent: An out-of-process high level debugger for a java™ virtual machine 1

The HotSpot™ serviceability agent: An out-of-process high l...

引用

1st java virtual machine research and technology symposium, jvm 2001

作者： Russell, Kenneth Bak, Lars Sun Microsystems

ISBN: (纸本)1880446111

The HotSpot™ Serviceability Agent (SA) is a set of APIs for the java programming language which model the state of Sun Microsystems' java™ HotSpot virtual machine. Unlike most previous debugging systems for dynamic languages which assume a "cooperative"model in which the target process runs code to assist in the debugging process, the SA requires no code to be run in the target VM. Instead, it uses primitives like symbol lookup and reading of process memory to implement its functionality. The SA can transparently examine either live processes or core files, making it suitable for debugging both the VM itself and java programs in production. We describe the design and implementation of the SA, comparing it to other debugging systems for both statically compiled and dynamic languages, and illustrate future directions for this architecture. © 2001 The USENIX Association.

关键词： java programming language

来源：评论

学校读者我要写书评

暂无评论

Dynamic type checking in Jalapeño 1

Dynamic type checking in Jalapeño

引用

1st java virtual machine research and technology symposium, jvm 2001

作者： Alpern, Bowen Cocchi, Anthony Grove, David IBM T. J. Watson Research Center Yorktown HeightsNY10598 United States

ISBN: (纸本)1880446111

A java virtual machine (jvm) must sometimes check whether a value of one type can be can be treated as a value of another type. The overhead for such dynamic type checking can be a significant factor in the running time of some java programs. This paper presents a variety of techniques for performing these checks, each tailored to a particular restricted case that commonly arises in java programs. By exploiting compile-time information to select the most applicable technique to implement each dynamic type check, the run-time overhead of dynamic type checking can be significantly reduced. This paper suggests maintaining three data structures operationally close to every java object. The most important of these is a display of identifiers for the superclasses of the object's class. With this array, most dynamic type checks can be performed in four instructions. It also suggests that an equality test of the run-time type of an array and the declared type of the variable that contains it can be an important short-circuit check for object array stores. Together these techniques result in significant performance improvements on some benchmarks. © 2001 The USENIX Association.

关键词： java programming language

来源：评论

学校读者我要写书评

暂无评论

Mostly accurate stack scanning 1

Mostly accurate stack scanning

引用

1st java virtual machine research and technology symposium, jvm 2001

作者： Barabash, Katherine Kolodner, Elliot K. Shepherd, Janice Buchbinder, Niv Ossia, Yoav Sivan, Ron Domani, Tamar Pinter, Shlomit S. Umansky, Victor IBM Haifa Research Laboratory Israel

ISBN: (纸本)1880446111

The java virtual machine (jvm) needs, for the purpose of garbage collection (GC), to determine the data type stored in every memory location. jvms that can do this reliably are said to be type-accurate (TA). Full typeaccuracy usually exacts a price in performance due to the need to scan stacks and registers accurately. The mostly accurate approach presented here can reduce the TA overhead significantly by sacrificing accuracy for the small minority of memory locations that add the most to the cost. Performance results show that mostly accurate stack scanning performs as well as conservative stack scanning and that relatively few objects are identified conservatively. In addition our implementation is designed to support and generate type maps for any verifiable bytecode stream (including combinations that are unlikely to be produced by a compiler) without requiring rewriting of the bytecode. We introduce a new compression technique for type maps that uses a program-friendly format for the maps;yet, achieves good compression and provides fast opening of compressed maps. We show how to apply systematic testing techniques and test coverage tools to an accurate stack scanner. © 2001 The USENIX Association.

关键词： Scanning

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：