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

BAT(2)XML: XML-based java bytecode Representation

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2005年第1期141卷 93-107页

作者： Eichberg, Michael Tech Univ Darmstadt Dept Comp Sci Darmstadt Germany

The creation, transformation and analysis of bytecode is widespread. Nevertheless, several problems related to the reusability and comprehensibility of the results and tools exist. In particular, the results of tools for bytecode analysis are usually represented in proprietary tool dependent ways, which makes it hard to build more sophisticated analysis on top of the results generated by tools for lower-level analysis. Furthermore, intermediate results, such as e.g., the results of basic control flow and dataflow analysis, are usually not explicitly represented at all;though, required by many more sophisticated analysis. This lack of a common format, for the well structured representation of the (intermediate) results of code analysis, makes the creation of new tools or the integration of the results generated by different tools costly and ineffective. To solve the highlighted problems, we propose a higher-level XML-based representation of java bytecode which is designed as a common platform for the creation and transformation of bytecode and explicitly enables the integration of arbitrary information generated by different tools for static code analysis.

关键词： java bytecode XML Static Analysis

来源：评论

学校读者我要写书评

暂无评论

An Efficient, Parametric Fixpoint Algorithm for Analysis of java bytecode

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年第1期190卷 51-66页

作者： Mendez, Mario Navas, Jorge Hermenegildo, Manuel V. Univ New Mexico Dept Comp Sci Albuquerque NM 87131 USA Tech Univ Madrid Madrid Spain

interpretation has been widely used for the analysis of object-oriented languages and, in particular, java source and bytecode. However, while most existing work deals with the problem of finding expressive abstract domains that track accurately the characteristics of a particular concrete property, the underlying fixpoint algorithms have received comparatively less attention. In fact, many existing (abstract interpretation based-) fixpoint algorithms rely on relatively inefficient techniques for solving inter-procedural call graphs or are specific and tied to particular analyses. We also argue that the design of an efficient fixpoint algorithm is pivotal to supporting the analysis of large programs. In this paper we introduce a novel algorithm for analysis of java bytecode which includes a number of optimizations in order to reduce the number of iterations. The algorithm is parametric - in the sense that it is independent of the abstract domain used and it can be applied to different domains as "plug-ins"-, multivariant, and flow-sensitive. Also, is based on a program transformation, prior to the analysis, that results in a highly uniform representation of all the features in the language and therefore simplifies analysis. Detailed descriptions of decompilation solutions are given and discussed with an example. We also provide some performance data from a preliminary implementation of the analysis.

关键词： Fixpoint algorithm multivariance static analysis java bytecode abstract interpretation

来源：评论

学校读者我要写书评

暂无评论

Vulnerabilities Constraint Based Analysis Approach for java bytecode Programs 6

Vulnerabilities Constraint Based Analysis Approach for Java ...

引用

6th International Conference on Multimedia Computing and Systems (ICMCS)

作者： Achour, Safaa Benattou, Mohammed Ibn Tofail Univ LASTID Lab Kenitra Morocco

ISBN: (纸本)9781538662205

The verification process of software is of growing importance as it helps to assure that an application is correctly built. However, an efficient verification method of implementation of an application should also reject cases of invalid data which provide valid results. Thus, we propose in this paper a constraint-based analysis technique to detect vulnerabilities in java applications at the executable level. We propose to exploit both the information contained in the bytecode structure of the application and the information given by the user specification. Indeed, we show how the user specifications can be used to deduce the invalid input state that put the testing method in valid post-state and then to detect some defections in the bytecode programs.

关键词： component Vulnerabilities Program Analysis Constraints java bytecode Specification

来源：评论

学校读者我要写书评

暂无评论

A java bytecode Formalisation 1

引用

10th International Working Conference on Verified Software - Theories, Tools, and Experiments (VSTTE) held as Part of the Federated Logic Conference (FLoC)

作者： Czarnik, Patryk Chrzaszcz, Jacek Schubert, Aleksy Univ Warsaw Inst Informat Ul S Banacha 2 PL-02097 Warsaw Poland

ISBN: (数字)9783030035921

ISBN: (纸本)9783030035921;9783030035914

This paper presents the first Coq formalisation of the full java bytecode instruction set and its semantics. The set of instructions is organised in a hierarchy depending on how the instructions deal with the runtime structures of the java Virtual Machine such as threads, stacks, heap etc. The hierarchical nature of Coq modules neatly reinforces this view and facilitates the understanding of the java bytecode semantics. This approach makes it possible to both conduct verification of properties for programs and to prove metatheoretical results for the language. Based upon our formalisation experience, the deficiencies of the current informal bytecode language specification are discussed.

关键词： Formalisation Coq Semantics java bytecode

来源：评论

学校读者我要写书评

暂无评论

AUTOMATED TERMINATION ANALYSIS OF java bytecode BY TERM REWRITING

AUTOMATED TERMINATION ANALYSIS OF JAVA BYTECODE BY TERM REWR...

引用

21st International Conference on Rewriting Techniques and Applications (RTA) as part of the 5th International Federated Logic Conference (FLOC)

作者： Otto, Carsten Brockschmidt, Marc von Essen, Christian Giesl, Juergen Rhein Westfal TH Aachen LuFG Informat 2 Aachen Germany

We present an automated approach to prove termination of java bytecode (JBC) programs by automatically transforming them to term rewrite systems (TRSs). In this way, the numerous techniques and tools developed for TRS... 详细信息

ISBN: (纸本)9783939897187

关键词： java bytecode termination term rewriting

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Comparative Analysis of Static and Dynamic java bytecode Watermarking Algorithms 50th

A Comparative Analysis of Static and Dynamic Java Bytecode W...

引用

50th Annual Convention of the Computer-Society-of-India (CSI) on Digital Life

作者： Kumar, Krishan Kaur, Prabhpreet ICFAI Univ Fac Sci & Technol Baddi HP India Gum Nanak Dev Univ Dept Comp Sci & Technol Amritsar Punjab India

ISBN: (纸本)9789811088483;9789811088476

Software piracy is one of the most serious issues confronted by software industry creating a huge number of dollars misfortune consistently to the product creating organizations. The worldwide income misfortune was assessed to be more than $62.7 billion in the year 2013 because of the product theft. Software watermarking demoralizes theft, as a proof of procurement or origin, and likewise helps in following the wellspring of unlawful redistribution of duplicates of programming. In this paper, we have compared and analyzed the static and dynamic java bytecode watermarking algorithms. Firstly, each java jar file is watermarked using the watermarking algorithms, and after this, distortive attacks are applied to each watermarked program by applying obfuscation and optimizing. After studying the results obtained, we found that dynamic watermarking algorithms are slightly better than static watermarking algorithms.

关键词： Software piracy Watermarking java bytecode Obfuscation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：