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

java bytecode verification for secure information flow

ACM SIGPLAN NOTICES 2003年第12期38卷 20-27页

作者： Avvenuti, M Bernardeschi, C De Francesco, N Univ Pisa Dipartimento Ingn Informaz I-56126 Pisa Italy

Security of java programs is important as they can be executed in different platforms. This paper addresses the problem of secure information flow for java bytecode. In information flow analysis one wishes to check if high security data can ever propagate to low security observers. We propose a static analysis similar to the type-level abstract interpretation used for standard bytecode verification. Instead of types, our technique works with secrecy levels assigned to classes, methods' parameters and returned values, and handles implicit information flows. A verification tool based on the proposed technique is under development. Using the tool, programs downloaded from untrusted hosts can be checked locally prior to executing them.

关键词： languages security theory verification data protection information flow java bytecode static analysis verification tool

来源：评论

学校读者我要写书评

暂无评论

From CIL to java bytecode: Semantics-based translation for static analysis leveraging

引用

SCIENCE OF COMPUTER PROGRAMMING 2020年第0期191卷 102392-000页

作者： Ferrara, Pietro Cortesi, Agostino Spot, Fausto JuliaSoft Verona Italy Univ Ca Foscari Venezia Venice Italy Univ Verona Verona Italy

A formal translation of CIL (i.e., .Net) bytecode into java bytecode is introduced and proved sound with respect to the language semantics. The resulting code is then analyzed with Julia, an industrial static analyzer of java bytecode. The overall process of translation and analysis is fast, scales to industrial programs, and introduces a negligible number of false alarms. The main contribution of this work is to leverage existing, mature, and sound analyzers for java bytecode by applying them also to the wide range of .Net software systems. Experimental results show the actual effectiveness of this approach when applied to all the system libraries of the Microsoft .Net framework version 4.0.30319 (about 5 MLOCs). (C) 2020 The Author(s). Published by Elsevier B.V.

关键词： Static analysis Abstract interpretation java bytecode CIL

来源：评论

学校读者我要写书评

暂无评论

An Evaluation of Dynamic java bytecode Software Watermarking Algorithms

引用

INTERNATIONAL JOURNAL OF SECURITY AND ITS APPLICATIONS 2016年第7期10卷 147-156页

作者： Kumar, Krishan Kehar, Viney Kaur, Prabhpreet ICFAI Univ Fac Sci & Technol Baddi HP India NIT Dept Comp Sci & Engn Hamirpur India Guru Nanak Dev Univ Dept Comp Sci & Technol Amritsar Punjab India

In the era of Information technology, Software Piracy and security has become one of the most important issue in world. Numbers of techniques have been proposed and implemented to prevent software piracy and illegal modification. Among all the protection techniques, software watermarking technique which attempts to protect the software by embedding copyright notice or unique identifiers into software to prove the ownership of software. Software Watermarking discourage piracy;as a proof of purchase or authorship;also helps in tracking the source of illegal redistribution of copies of software. We evaluate the existing dynamic watermarking algorithms using them to watermark java bytecode files and then applying distortive attacks to each watermarked program by obfuscating. Our study has shown that some watermarks were removed as results of these transformations.

关键词： Software Piracy java bytecode Watermarking Software Protection Reverse engineering obfuscation

来源：评论

学校读者我要写书评

暂无评论

Checking security of java bytecode by abstract interpretation 02

Checking security of Java bytecode by abstract interpretatio...

引用

Proceedings of the 2002 ACM symposium on Applied computing

作者： Roberto Barbuti Cinzia Bernardeschi Nicoletta De Francesco Università di Pisa Corso Italia 40 56100 Pisa Italy Università di Pisa Via Diotisalvi 2 56100 Pisa Italy

ISBN: (纸本)9781581134452

We present a method to certify a subset of the java bytecode, with respect to security. The method is based on abstract interpretation of the operational semantics of the language. We define a concrete small-step enhanced semantics of the language, able to keep information on the flow of data and control during execution. A main point of this semantics is the handling of the influence of the information flow on the operand stack. We then define an abstract semantics, keeping only the security information and forgetting the actual values. This semantics can be used as a static analysis tool to check security of programs. The use of abstract interpretation allows, on one side, being semantics based, to accept as secure a wide class of programs, and, on the other side, being rule based, to be fully automated.

关键词： information flow security java bytecode abstract interpretation

来源：评论

学校读者我要写书评

暂无评论

Decompiling Boolean Expressions from java™ bytecode 16

Decompiling Boolean Expressions from Java™ Bytecode

引用

9th India Software Engineering Conference (ISEC)

作者： Nanda, Mangala Gowri Arun-Kumar, S. IBM Res Bangalore Karnataka India Indian Inst Technol Delhi India

ISBN: (纸本)9781450340182

java bytecode obfuscates the original structure of a java expression in the source code. So a simple expression such as (c1 I I c2) or (cl && c2) may be captured in the bytecode in 4 different ways (as shown in the paper). And correspondingly, when we reconvert the bytecode back into java source code, there are four different ways this may happen. Further, although gotos are not permitted in the java source code, the bytecode is full of gotos. If you were to blindly convert the bytecode into java source code, then you would replace a goto by a labeled break. A labeled break has the advantage that it only allows you to break out of a block structure and (unlike a setjump) does not permit you to jump arbitrarily into a block structure. So while the data structures used in the regenerated java source code are still relatively "clean" arbitrary usage of labeled breaks makes for unreadable code (as we show in the paper). And this can be a point of concern, since decompilation is generally related to debugging code. Instead of dumping arbitrary labeled breaks, we try to reconstruct the original expression, in terms of && and I I clauses as well as ternary operators "?:" (c0 ? cl : c2);Thus our goal is quite simply to regenerate, without using goto or labeled breaks, the expressions as close to the original as possible (it is not possible to guarantee an exact match). In this paper we explain what is the state of the art in java decompilers for decoding complex expressions. Then we will present our solution. We have implemented the algorithms described here in this paper and give you our experience with it.

关键词： decompilation java bytecode boolean expressions

来源：评论

学校读者我要写书评

暂无评论

Detecting java Code Clones Based on bytecode Sequence Alignment

引用

IEEE ACCESS 2019年 7卷 22421-22433页

作者： Yu, Dongjin Yang, Jiazha Chen, Xin Chen, Jie Hangzhou Dianzi Univ Sch Comp Sci & Technol Hangzhou 310018 Zhejiang Peoples R China

When the source code is copied and pasted or modified, there will be a lot of identical or similar code snippets in the software system, which are called code clones. Because code clones are believed to result in undesirable maintainability of software, numerous approaches and techniques have been proposed for code clone detection. However, most of them are based on the source code, while only a few employ the bytecode to detect code clones. In this paper, we introduce an approach based on java bytecode, which mainly contains the steps of bytecode sequence alignment and similarity score comparison. In particular, we apply the Smith-Waterman algorithm to align bytecode sequences for precise matching. Moreover, we separately consider the similarities between instruction sequences and method call sequences, thus improving its effectiveness in detecting code clones. We conducted an extensive experiment on five open-source software to evaluate the proposed approach. The results show that our approach outperforms other state-of-the-art techniques.

关键词： Code clones code clone detection java bytecode code sequence alignment code similarities instruction block method call sequences

来源：评论

学校读者我要写书评

暂无评论

A software tool for semi-automatic gridification of resource-intensive java bytecodes and its application to ray tracing and sequence alignment

引用

ADVANCES IN ENGINEERING SOFTWARE 2011年第4期42卷 172-186页

作者： Mateos, Cristian Zunino, Alejandro Hirsch, Matias Fernandez, Mariano Campo, Marcelo ISISTAN Res Inst Buenos Aires DF Argentina UNICEN Univ Tandil Buenos Aires DF Argentina Consejo Nacl Invest Cient & Tecn RA-1033 Buenos Aires DF Argentina

Computational Grids deliver the necessary computational infrastructure to perform resource-intensive computations such as the ones that solve the problems scientists are facing today. Exploiting Computational Grids comes at the expense of explicitly adapting the ordinary software implementing scientific problems to take advantage of Grid resources, which unavoidably requires knowledge on Grid programming. The recent notion of "gridifying" ordinary applications, which is based on semi-automatically deriving a Grid-aware version from the compiled code of a sequential application, promises users to be relieved from the requirement of manual usage of Grid APIs within their source codes. In this paper, we describe a novel gridification tool that allows users to easily parallelize java applications on Grids. Extensive experiments with two real-world applications - ray tracing and sequence alignment - suggest that our approach provides a convenient balance between ease of gridification and Grid resource exploitation compared to manually using Grid APIs for gridifying ordinary applications. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Computational grids Gridification Resource-intensive applications Automatic parallelism Parallelization heuristics java bytecode

来源：评论

学校读者我要写书评

暂无评论

Negative Effects of bytecode Instrumentation on java Source Code Coverage 23

Negative Effects of Bytecode Instrumentation on Java Source ...

引用

23rd IEEE International Conference on Software Analysis, Evolution, and Reengineering (SANER)

作者： Tengeri, David Horvath, Ferenc Beszedes, Arpad Gergely, Tamas Gyimothy, Tibor Univ Szeged Dept Software Engn Szeged Hungary

ISBN: (纸本)9781509018550

Code coverage measurement is an important element in white-box testing, both in industrial practice and academic research. Other related areas are highly dependent on code coverage as well, including test case generation, test prioritization, fault localization, and others. Inaccuracies of a code coverage tool sometimes do not matter that much but in certain situations they can lead to serious confusion. For java, the prevalent approach to code coverage measurement is to use bytecode instrumentation due to its various benefits over source code instrumentation. However, if the results are to be mapped back to source code this may lead to inaccuracies due to the differences between the two program representations. In this paper, we systematically investigate the amount of differences in the results of these two java code coverage approaches, enumerate the possible reasons and discuss the implications on various applications. For this purpose, we relied on two widely used tools to represent the two approaches and a set of benchmark programs from the open source domain.

关键词： Code coverage white-box testing java bytecode instrumentation source code instrumentation coverage tools

来源：评论

学校读者我要写书评

暂无评论

Detecting java Code Clones with Multi-Granularities Based on bytecode 41

Detecting Java Code Clones with Multi-Granularities Based on...

引用

41st IEEE Annual Computer Software and Applications Conference (COMPSAC)

作者： Yu, Dongjin Wang, Jie Wu, Qing Yang, Jiazha Wang, Jiaojiao Yang, Wei Yan, Wei Hangzhou Dianzi Univ Sch Comp Sci & Technol Hangzhou Zhejiang Peoples R China Zhejiang Topcheer Informat Technol Co Ltd Zhejiang Inst Comp Technol Hangzhou Zhejiang Peoples R China Zhejiang Inst Sci & Technol Informat Hangzhou Zhejiang Peoples R China

ISBN: (纸本)9781538603673

Sequences of duplicate code, either with or without modification, are known as code clones or just clones. Code clones are generally considered undesirable for a number of reasons, although they can offer some convenience to developers. The detection of code clones helps to improve the quality of source code through software re-engineering. Numerous methods have been proposed for code clone detection in java code. However, the existing methods are mostly based on the java source code, while only a few focus on its bytecode;in fact, the java bytecode reflects more of the semantic nature of the source code than the source code itself does. In this paper, we propose a novel code clone detection method based on java bytecode. Using the block-level code fragments extracted from bytecode, it can simultaneously detect code clones at both method level and block level. In addition, during the process of code clone detection, the similarities of both method call sequences and instruction sequences are calculated in order to improve accuracy. We conduct two extensive experiments to evaluate the performance of our method. The results show that the proposed method can detect code clones more effectively than the state-of-the-art methods.

关键词： code clone detection java bytecode instruction multi-granularities method call

来源：评论

学校读者我要写书评

暂无评论

java decompiler diversity and its application to meta-decompilation

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2020年 168卷 110645-110645页

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

During compilation from java source code to bytecode, some information is irreversibly lost. In other words, compilation and decompilation of java code is not symmetric. Consequently, decompilation, which aims at producing source code from bytecode, relies on strategies to reconstruct the information that has been lost. Different java decompilers 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. In this paper, we assess the strategies of eight java decompilers with respect to three quality indicators: syntactic correctness, syntactic distortion and semantic equivalence modulo inputs. Our results show that no single modern decompiler is able to correctly handle the variety of bytecode structures coming from real-world programs. The highest ranking decompiler in this study produces syntactically correct, and semantically equivalent code output for 84%, respectively 78%, of the classes in our dataset. Our results demonstrate that each decompiler correctly handles a different set of bytecode classes. We propose a new decompiler called Arlecchino that leverages the diversity of existing decompilers. To do so, we merge partial decompilation into a new one based on compilation errors. Arlecchino handles 37.6% of bytecode classes that were previously handled by no decompiler. We publish the sources of this new bytecode decompiler. (C) 2020 Published by Elsevier Inc.

关键词： java bytecode Decompilation Reverse engineering Source code analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：