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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

43 篇 期刊文献
38 篇 会议
2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

78 篇 工学
- 69 篇 计算机科学与技术...
- 43 篇 软件工程
- 11 篇 电气工程
- 4 篇 信息与通信工程
- 1 篇 电子科学与技术（可...
- 1 篇 生物医学工程（可授...
3 篇 理学
- 3 篇 数学
1 篇 医学
- 1 篇 基础医学(可授医学...
1 篇 管理学
- 1 篇 管理科学与工程(可...

主题

83 篇 java bytecode
13 篇 static analysis
9 篇 abstract interpr...
8 篇 java
6 篇 decompilation
6 篇 verification
5 篇 termination
5 篇 information flow
4 篇 languages
4 篇 java virtual mac...
4 篇 reverse engineer...
4 篇 theory
4 篇 security
4 篇 low-level langua...
3 篇 instrumentation
3 篇 software piracy
3 篇 embedded systems
3 篇 clone detection
3 篇 program transfor...
3 篇 software protect...

机构

4 篇 univ complutense...
3 篇 philipps univ ma...
3 篇 tech univ madrid...
2 篇 friedrich schill...
2 篇 univ complutense...
2 篇 consejo nacl inv...
2 篇 univ complutense...
2 篇 univ arizona dep...
2 篇 icfai univ fac s...
2 篇 rhein westfal th...
2 篇 tech univ darmst...
2 篇 univ pisa dipart...
2 篇 tech univ madrid...
2 篇 brno university ...
2 篇 hangzhou dianzi ...
2 篇 univ verona i-37...
2 篇 univ verona dipa...
2 篇 cooperat univ ge...
1 篇 queens univ dept...
1 篇 korea adv inst s...

作者

6 篇 gomez-zamalloa m...
6 篇 albert elvira
5 篇 genaim samir
5 篇 spoto fausto
3 篇 puebla german
3 篇 bockisch christo...
2 篇 mueller peter
2 篇 kumar krishan
2 篇 monperrus martin
2 篇 yang jiazha
2 篇 kaur prabhpreet
2 篇 zanardini d.
2 篇 taentzer gabriel...
2 篇 baudry benoit
2 篇 falcone ylies
2 篇 yu dongjin
2 篇 orlov michael
2 篇 otto carsten
2 篇 de francesco nic...
2 篇 neufeld daniel

语言

69 篇 英文
14 篇 其他

检索条件"主题词=Java Bytecode"

共 83 条记录，以下是21-30 订阅

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

详细简洁

排序：

Finding Source Code Clones in Intermediate Representations of java bytecode 17

Finding Source Code Clones in Intermediate Representations o...

引用

IEEE 17th International Workshop on Software Clones (IWSC)

作者： Schaefer, Andre Heinze, Thomas S. Amme, Wolfram Friedrich Schiller Univ Jena Jena Germany Cooperat Univ Gera Eisenach Gera Germany

ISBN: (纸本)9798350344424

Copied, reused and modified program code is a common phenomena in software development. As the resulting code clones are often not labeled as such and their proper detection is crucial to software quality and re-engineering, numerous techniques and tools for finding code clones have been developed. This as well applies to the java programming language, though most clone detectors work on java source code. Only some research addresses code clones in java bytecode and an even smaller fraction investigates the relationship between java source code and bytecode code clones. In this paper, we extend the source-code based clone detector StoneDetector to java bytecode. Using BigCloneBench as state-of-the-art benchmark, we are able to assess and analyze its effectiveness in detecting source code clones in java bytecode. We also report on differences in the performance of clone detection for stack-based and register-based representations of java bytecode. The results show that, while code clones found in java source code and bytecode in general can differ, source code clones can be detected in java bytecode with high recall and precision using the presented system.

关键词： clone detection Code clone java bytecode

来源：评论

学校读者我要写书评

暂无评论

The Strengths and Behavioral Quirks of java bytecode Decompilers 19

The Strengths and Behavioral Quirks of Java Bytecode Decompi...

引用

19th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM)

作者： Harrand, Nicolas Soto-Valero, Cesar Monperrus, Martin Baudry, Benoit KTH Royal Inst Technol Stockholm Sweden

ISBN: (纸本)9781728149370

During compilation from java source code to byte-code, some information is irreversibly lost. In other words, compilation and decompilation of java code is not symmetric. Consequently, the decompilation process, which aims at producing source code from bytecode, must establish some strategies to reconstruct the information that has been lost. Modern java decompilers tend to use distinct strategies to achieve proper decompilation. In this work, we hypothesize that the diverse ways in which bytecode can be decompiled has a direct impact on the quality of the source code produced by decompilers. We study the effectiveness of eight java decompilers with respect to three quality indicators: syntactic correctness, syntactic distortion and semantic equivalence modulo inputs. This study relies on a benchmark set of 14 real-world open-source software projects to be decompiled (2041 classes in total). Our results show that no single modern decompiler is able to correctly handle the variety of bytecode structures coming from real-world programs. Even the highest ranking decompiler in this study produces syntactically correct output for 84% of classes of our dataset and semantically equivalent code output for 78% of classes.

关键词： java bytecode decompilation reverse engineering source code analysis

来源：评论

学校读者我要写书评

暂无评论

Activating Mobile Agents from Contactless Smart Cards through a java bytecode Extractor

Activating Mobile Agents from Contactless Smart Cards throug...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Lee, Jonathan Lee, Shin-Jie Chen, Hsi-Min Liang, Jeremy Wu, Chia-Ling Wang, Yao-Chiang Natl Cent Univ Dept Comp Sci & Informat Engn Jhongli Taiwan

ISBN: (纸本)9781424465880

As mobile agents reside on on-board units or mobile devices and act on behalf of drivers, it imposes a strong demand to devise mechanisms for protecting the algorithms that are exclusively coded in mobile agents for different drivers. Although contactless smart cards are widely used as a means to protecting personal information, it is still a challenge to protect the whole code of a mobile agent in a limited storage. In this paper, we propose a tool, called jExtractor, by which the private or sensitive data coded in a java-based mobile agent can be extracted and moved to a contactless smart card, and can further be read from the card and merged to be the original mobile agent. Moreover, we use 30,000 java classes as samples to validate jExtractor. In the experimental result, 79.4% of the sample classes can successfully be extracted and moved to Mifare Standard S50 (1K) smart card with our strictest configuration level.

关键词： Contactless Smart Card java java bytecode java bytecode extractor Mobile Agent contactless smart cards jExtractor mobile agents mobile agents activation personal information protection security of data smart cards

来源：评论

学校读者我要写书评

暂无评论

Removing Useless Variables in Cost Analysis of java bytecode 08

Removing Useless Variables in Cost Analysis of Java Bytecode

引用

23rd Annual ACM Symposium on Applied Computing

作者： Albert, E. Arenas, P. Genaim, S. Puebla, G. Zanardini, D. Univ Complutense Madrid DSIC E-28040 Madrid Spain Tech Univ Madrid CLIP E-28660 Madrid Spain

ISBN: (纸本)9781595937537

Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in order to decide whether to reject mobile code which has too large cost requirements in terms of computing resources (in time and/or space) or billable events (SMSs sent, bandwidth required). Existing cost analyses for a variety of languages describe the resource consumption of programs by means of Cost Equation Systems (CESs), which are similar to, but more general than recurrence equations. CESs express the cost of a program in terms of the size of its input data. In a further step, a closed form (i.e., non-recursive) solution or upper bound can sometimes be found by using existing Computer Algebra Systems (CASs), such as Maple and Mathematica. In this work, we focus on cost analysis of java bytecode, a language which is widely used in the context of mobile code and we study the problem of identifying variables which are useless in the sense that they do not affect the execution cost and therefore can be ignored by cost analysis. We identify two classes of useless variables and propose automatic analysis techniques to detect them. The first class corresponds to stack variables that can be replaced by program variables or constant values. The second class corresponds to variables whose value is cost-irrelevant, i.e., does not affect the cost of the program. We propose an algorithm, inspired in static slicing which safely identifies cost-irrelevant variables. The benefits of eliminating useless variables are two-fold: (1) cost analysis without useless variables can be more efficient and (2) resulting CESs are more likely to be solvable by existing CASs.

关键词： Cost Analysis Program Slicing Information Flow Cost Equations Systems java bytecode

来源：评论

学校读者我要写书评

暂无评论

Symbolic backward simulation of java bytecode program 18

Symbolic backward simulation of Java bytecode program

引用

10th International Conference on Computer Modeling and Simulation (ICCMS)

作者： Inafune, Tetsuya Miura, Shinichi Taketa, Toshihiro Hiranaka, Yukio Yamagata Univ 4-3-16 Jonan Yonezawa Yamagata Japan NTT DATA I Corp Tokyo Japan

ISBN: (纸本)9781450363396

We present a new method, symbolic backward simulation, for detecting bugs in java bytecode programs. In order to find bugs comprehensively, the method determines conditions on the input side by tracing back from the tail of the program while performing reverse execution for each bytecode. Generally, reverse execution is difficult, especially for instructions of two-input-one-output operations and branches. Our method solves the problem symbolically with essentially fewer simulation cases than numerical testing and forward symbolic analysis. We also show simulation results which detected a branch condition error and a real number processing error.

关键词： symbolic analysis backward simulation java bytecode reverse execution bug detection

来源：评论

学校读者我要写书评

暂无评论

MMT: Mutation Testing of java bytecode with Model Transformation

MMT: Mutation Testing of Java Bytecode with Model Transforma...

引用

ACM/IEEE International Conference on Model Driven Engineering Languages and Systems (MODELS)

作者： Bockisch, Christoph Taentzer, Gabriele Neufeld, Daniel Philipps Univ Marburg Marburg Germany

ISBN: (纸本)9798350324983

Mutation testing is an approach to check the robustness of test suites. The program code is slightly changed by mutations to inject errors. A test suite is robust enough if it finds such errors. Tools for mutation testing usually integrate sets of mutation operators such as, for example, swapping arithmetic operators;modern tools typically work with compiled code such as java bytecode. In this case, the mutations must be defined in such a way that the mutated program still can be loaded and executed. The results of mutation tests depend directly on the possible mutations. More advanced mutations and even domain-specific mutations can pose another challenge to the test suite. Since extending the classical approaches to more complex mutations is not well supported and is difficult, we propose a model-driven approach where mutations of java bytecode can be flexibly defined by model transformation. The corresponding tool called MMT has been extended with advanced mutation operators for modifying object-oriented structures, java-specific properties and method calls of APIs, making it the only mutation testing tool for java bytecode that supports such mutations.

关键词： Mutation testing java bytecode model transformation

来源：评论

学校读者我要写书评

暂无评论

Heap Space Analysis for java bytecode 07

Heap Space Analysis for Java Bytecode

引用

International Symposium on Memory Management

作者： Albert, Elvira Genaim, Samir Gomez-Zamalloa, Miguel Univ Complutense Madrid DSIC E-28040 Madrid Spain Tech Univ Madrid CLIP Madrid Spain

ISBN: (纸本)9781595938930

This article presents a heap space analysis for (sequential) java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of a program as a function of its data size. These relations can be used to obtain upper bounds on the heap space allocated during the execution of the different methods. In addition, we describe how to refine the cost relations, by relying on escape analysis, in order to take into account the heap space that can be safely deallocated by the garbage collector upon exit from a corresponding method. These refined cost relations are then used to infer upper bounds on the active heap space upon methods return. Example applications for the analysis consider inference of constant heap usage and heap usage proportional to the data size (including polynomial and exponential heap consumption). Our prototype implementation is reported and demonstrated by means of a series of examples which illustrate how the analysis naturally encompasses standard data-structures like lists, trees and arrays with several dimensions written in object-oriented programming style.

关键词： Heap Space Analysis Heap Consumption Low-level Languages java bytecode

来源：评论

学校读者我要写书评

暂无评论

Mutation Testing of java bytecode: A Model-Driven Approach 24

Mutation Testing of Java Bytecode: A Model-Driven Approach

引用

27th International Conference on Model Driven Engineering Languages and Systems (MODELS)

作者： Bockisch, Christoph Eren, Deniz Lehmann, Sascha Neufeld, Daniel Taentzer, Gabriele Philipps Univ Marburg Marburg Germany

ISBN: (纸本)9798400705045

Mutation testing is an approach to checking the robustness of test suites. The program code is slightly changed by mutations to inject bugs. A test suite is robust enough if it finds such bugs. Mutation testing tools typically integrate sets of mutation operators such as, for example, swapping arithmetic operators;modern tools typically work with compiled code such as java bytecode. The mutations must be defined in such a way that the mutated program can still be loaded and executed. The results of mutation tests depend directly on the possible mutations. More advanced mutations and even domain-specific mutations can pose another challenge to the test suite. Since the classical, non-model-based mutation testing tools do not support the specification of advanced mutation operators well, we propose a model-driven approach where mutations of java bytecode can be flexibly defined by model transformation. Our approach also provides advanced mutation operators for modifying object-oriented structures, java-specific properties and API method calls, making it the only mutation testing tool for java bytecode that supports such mutations. To further improve the effectiveness of mutation testing, mutants are generated only for bytecode that is covered by tests. Our approach is implemented in the MMT tool. It has been evaluated against non-model-based mutation testing tools for its ability to generate mutants close to real bugs. The experiments make use of Defects4J, a well-established collection of real-world java projects with reproducible bugs.

关键词： Mutation testing java bytecode Model transformation

来源：评论

学校读者我要写书评

暂无评论

A java bytecode Metamodel for Composable Program Analyses

A Java Bytecode Metamodel for Composable Program Analyses

引用

Conference on Software Technologies - Applications and Foundations (STAF)

作者： Yildiz, Bugra M. Bockisch, Christoph Rensink, Arend Aksit, Mehmet Univ Twente Enschede Netherlands Philipps Univ Marburg Marburg Germany

ISBN: (纸本)9783319747309;9783319747293

Program analyses are an important tool to check if a system fulfills its specification. A typical implementation strategy for program analyses is to use an imperative, general-purpose language like java;and access the program to be analyzed through libraries for manipulating intermediate code, such as ASM for java bytecode. We show that this hampers composability, interoperability and reuse of analysis implementations. We propose a complete Ecore-metamodel for java bytecode as a common basis for program analysis implementations, as well as an Eclipse plug-in to create bytecode metamodel instances from java bytecode and vice versa. Code analyses can be defined as model transformations in a declarative, domain-specific language. As a consequence, the implementations of program analyses become more composable and more modular in general. We demonstrate the effectiveness of this approach with a case study.

关键词： java bytecode Metamodel Model transformation Model-driven software engineering Program analyses Composition

来源：评论

学校读者我要写书评

暂无评论

Abstract Interpretation of java bytecode in Sturdy 26

Abstract Interpretation of Java Bytecode in Sturdy

引用

26th ACM International Conference on Formal Techniques for java-like Programs (FTfJP)

作者： Marx, Stefan Erdweg, Sebastian JGU Mainz Mainz Germany

ISBN: (纸本)9798400711114

We develop a framework of definitional abstract interpreters for java bytecode in Sturdy. Specifically, we provide a generic interpreter that abstractly executes java bytecode but resorts to configurable analysis components for abstracting values and effects. From this, we can derive a concrete reference semantics for java bytecode and sound abstract interpreters.

关键词： abstract interpretation static analysis java bytecode control flow data flow

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共9页 << < 1 2 3 4 5 6 7 8 9 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：