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

java bytecode compression for low-end embedded systems

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 2000年第3期22卷 471-489页

作者： Clausen, LR Schultz, UP Consel, C Muller, G INRIA IRISA Compose Grp F-35042 Rennes France

A program executing on a low-end embedded system, such as a smart-card, faces scarce memory resources and fixed execution time constraints. We demonstrate that factorization of common instruction sequences in java bytecode allows the memory footprint to be reduced, on average, to 85% of its original size, with a minimal execution time penalty. While preserving java compatibility, our solution requires only a few modifications which are straightforward to implement in any JVM used in a low-end embedded system.

关键词： design experimentation code compression embedded systems java bytecode

来源：评论

学校读者我要写书评

暂无评论

Checking secure information flow in java bytecode by code transformation and standard bytecode verification

引用

SOFTWARE-PRACTICE & EXPERIENCE 2004年第13期34卷 1225-1255页

作者： Bernardeschi, C De Francesco, N Lettieri, G Martini, L Univ Pisa Dipartimento Ingn Informaz I-56100 Pisa Italy

A method is presented for checking secure information flow in java bytecode, assuming a multilevel security policy that assigns security levels to the objects. The method exploits the type-level abstract interpretation of standard bytecode verification to detect illegal information flows. We define an algorithm transforming the original code into another code in such a way that a typing error detected by the Verifier on the transformed code corresponds to a possible illicit information How in the original code. We present a prototype tool that implements the method and we show an example of application. Copyright (C) 2004 John Wiley Sons, Ltd.

关键词： security information flow java bytecode bytecode verifier

来源：评论

学校读者我要写书评

暂无评论

A Termination Analyzer for java bytecode Based on Path-Length

引用

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 2010年第3期32卷 8-8.70页

作者： Spoto, Fausto Mesnard, Fred Payet, Etienne Univ Verona Dipartimento Informat I-37134 Verona Italy Univ Reunion LIM IREMIA F-97715 St Denis Messag 9 France

It is important to prove that supposedly terminating programs actually terminate, particularly if those programs must be run on critical systems or downloaded into a client such as a mobile phone. Although termination of computer programs is generally undecidable, it is possible and useful to prove termination of a large, nontrivial subset of the terminating programs. In this article, we present our termination analyzer for sequential java bytecode, based on a program property called path-length. We describe the analyses which are needed before the path-length can be computed such as sharing, cyclicity, and aliasing. Then we formally define the path-length analysis and prove it correct with respect to a reference denotational semantics of the bytecode. We show that a constraint logic program P-CLP can be built from the result of the path-length analysis of a java bytecode program P and formally prove that if P-CLP terminates, then P also terminates. Hence a termination prover for constraint logic programs can be applied to prove the termination of P. We conclude with some discussion of the possibilities and limitations of our approach. Ours is the first existing termination analyzer for java bytecode dealing with any kind of data structures dynamically allocated on the heap and which does not require any help or annotation on the part of the user.

关键词： Languages Theory Verification Abstract interpretation java java bytecode termination analysis

来源：评论

学校读者我要写书评

暂无评论

An Abstract Interpretation Approach for Enhancing the java bytecode Verifier

引用

COMPUTER JOURNAL 2010年第6期53卷 679-700页

作者： Barbuti, Roberto De Francesco, Nicoletta Tesei, Luca Univ Camerino Dipartimento Matemat & Informat I-62032 Camerino MC Italy Univ Pisa Dipartimento Ingn Informaz I-56126 Pisa Italy Univ Pisa Dipartimento Informat I-56127 Pisa Italy

The java virtual machine embodies a verifier that performs a set of checks on java bytecode programs before their execution. The verifier carries out an efficient data-flow analysis applied to a type-level abstract interpretation of the code. The implementations of the bytecode verifier presented a significant problem with programs compiled with the Sun java compiler (until version 1.4.1): there were legal java programs which were correctly compiled into a bytecode that was rejected by the verifier. The problem was fixed by removing, in version 1.4.2 and following, some interesting features in the compilation of the try-finally java construct. Because removing such features has a cost in terms of memory space, in this paper we propose to enhance the bytecode verifier to accept such programs, maintaining the space efficiency of the previous versions of the compiler. We define an abstract interpretation framework in which we model the enhanced version of the verifier. The defined abstract interpretation framework can be considered a good basis for other static analyses of bytecode programs.

关键词： java bytecode abstract interpretation bytecode verifier

来源：评论

学校读者我要写书评

暂无评论

java bytecode to Hardware Made Easy with Bluespec SystemVerilog 12

Java Bytecode to Hardware Made Easy with Bluespec SystemVeri...

引用

10th International Workshop on java Technologies for Real-Time and Embedded Systems (JTRES)

作者： Gruian, Flavius Arslan, Mehmet Ali Lund Univ Dept Comp Sci S-22100 Lund Sweden

ISBN: (纸本)9781450316880

This paper presents a method for translation of java byte-code sequences into synthesizable hardware, using the Bluespec SystemVerilog (BSV) environment. At the core of our approach lies a BSV description of a subset of java bytecodes, that can be used to directly translate bytecode sequences into a BSV specification. The result is intended as an accelerator for existing java processors (JOP, BlueJEP) or even standalone hardware. Preliminary evaluation shows our solution to produce hardware on par with established methods (area/performance), while supporting rare features (e.g. easy to automate, method calls and recursion).

关键词： java bytecode embedded systems Bluespec

来源：评论

学校读者我要写书评

暂无评论

Decompilation of java bytecode to Prolog by partial evaluation

引用

INFORMATION AND SOFTWARE TECHNOLOGY 2009年第10期51卷 1409-1427页

作者： Gomez-Zamalloa, Miguel Albert, Elvira Puebla, German Univ Complutense Madrid DSIC E-28040 Madrid Spain Tech Univ Madrid CLIP E-28660 Madrid Spain

Reasoning about java bytecode (JBC) is complicated due to its unstructured control-flow, the use of three-address code combined with the use of an operand stack, etc. Therefore, many static analyzers and model checkers for JBC first convert the code into a higher-level representation. In contrast to traditional decompilation, such representation is often not java source, but rather some intermediate language which is a good input for the subsequent phases of the tool. Interpretive decompilation consists in partially evaluating an interpreter for the compiled language (in this case JBC) written in a high-level language with respect to the code to be decompiled. There have been proofs-of-concept that interpretive decompilation is feasible, but there remain important open issues when it comes to decompile a real language such as JBC. This paper presents, to the best of our knowledge, the first modular scheme to enable interpretive decompilation of a realistic programming language to a high-level representation, namely of JBC to Prolog. We introduce two notions of optimality, which together require that decompilation does not generate code more than once for each program point. We demonstrate the impact of our modular approach and optimality issues on a series of realistic benchmarks. Decompilation times and decompiled program sizes are! linear with the size of the input bytecode program. This demonstrates empirically the scalability, of modular decompilation of JBC by partial evaluation. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Program transformation Partial evaluation Decompilation Interpreters java bytecode Logic programming

来源：评论

学校读者我要写书评

暂无评论

On object initialization in the java bytecode

引用

COMPUTER COMMUNICATIONS 2000年第17期23卷 1594-1605页

作者： Doyon, S Debbabi, M Univ Laval Dept Comp Sci LSFM Res Grp St Foy PQ G1K 7P4 Canada

java is an ideal platform for implementing mobile code systems, not only because of its portability but also because it is designed with security in mind. Untrusted java programs can be statically analyzed and validated. The program's behavior is then monitored to prevent potentially malicious operations. Static analysis of untrusted classes is carried out by a component of the java virtual machine called the verifier. The most complex part of the verification process is the dataflow analysis, which is performed on each method in order to ensure type-safety. This paper clarifies in detail one of the tricky aspects of the dataflow analysis: the verification of object initialization. We present and explain the rules that need to be enforced and we then show how verifier implementations can enforce them. Rules for object creation require, among other things, that uninitialized objects never be used before they are initialized. Constructors must properly initialize their this argument before they are allowed to return. This paper also deals with initialization failures (indicated by exceptions): the object being initialized must be discarded, and constructors must propagate initialization failures. (C) 2000 Elsevier Science B.V. All rights reserved.

关键词： java bytecode Object initialization Dataflow analysis static analysis java security

来源：评论

学校读者我要写书评

暂无评论

Experiments with Non-Termination Analysis for java bytecode

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2009年第5期253卷 83-96页

作者： Payet, Etienne Spoto, Fausto Univ La Reunion IREMIA St Denis Reunion France Univ Verona Dipartimento Informat Verona Italy

Non-termination analysis proves that programs, or parts of a program, do not terminate. This is important since non-termination is often an unexpected behaviour of computer programs and exposes a bug in their code. While research has found ways of proving non-termination of logic programs and of term rewriting systems, this is hardly the case for imperative programs. In this paper, we describe and experiment with a technique for proving non-termination of imperative, bytecode programs by relating their non-termination to that of a (constraint) logic program. Moreover, we show that our non-termination test effectively helps a termination test, by avoiding expensive search for termination proofs of those portions of the code where such proofs do not exist.

关键词： java java bytecode static analysis termination non-termination

来源：评论

学校读者我要写书评

暂无评论

Experiments in Cost Analysis of java bytecode

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2007年第1期190卷 67-83页

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

Recently, we proposed a general framework for the cost analysis of java bytecode which can be used for measuring resource usage. This analysis generates, at compile-time, cost relations which define the cost of programs as a function of their input data size. The purpose of this paper is to assess the practicality of such cost analysis by experimentally evaluating a prototype analyzer implemented in Ciao. With this aim, we approximate the computational complexity of a set of selected benchmarks, including both well-known algorithms which have been used to evaluate existing cost analyzers in other programming paradigms, and other benchmarks which illustrate object-oriented features. In our evaluation, we first study whether the generated cost relations can be automatically solved. Our experiments show that in some cases the inferred cost relations can be automatically solved by using the Mathematica system, whereas, in other cases, some prior manipulation is required for the equations to be solvable. Moreover, we experimentally evaluated the running time of the different phases of the analysis process. Overall, we believe our experiments show that the efficiency of our cost analysis is acceptable, and that the obtained cost relations are useful in practice since, at least in our experiments, it is possible to get a closed form solution.

关键词： Cost analysis java bytecode cost relations recurrence equations complexity

来源：评论

学校读者我要写书评

暂无评论

Using CLP Simplifications to Improve java bytecode Termination Analysis

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2009年第5期253卷 129-144页

作者： Spoto, Fausto Lu, Lunjin Mesnard, Fred Univ Verona Dipartimento Informat Verona Italy Oakland Univ Rochester MI 48309 USA Univ La Reunion LIM IREMIA St Denis Reunion France

In an earlier work, a termination analyzer for java bytecode was developed that translates a java bytecode program into a constraint logic program and then proves the termination of the latter. An efficiency bottleneck of the termination analyzer is the construction of a proof of termination for the generated constraint logic program, which is often very large in size. In this paper, a set of program simplifications are presented that reduce the size of the constraint logic program without changing its termination behavior. These simplifications remove program clauses and/or predicate arguments that do not affect the termination behavior of the constraint logic program. Their effect is to reduce significantly the time needed to build the termination proof for the constraint logic program, as our experiments show.

关键词： java java bytecode static analysis termination

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：