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

Coverage testing of java programs and components

SCIENCE OF COMPUTER PROGRAMMING 2005年第1-2期56卷 211-230页

作者： Vincenzi, AMR Maldonado, JC Wong, WE Delamaro, ME Univ Sao Paulo Inst Ciencias Matemat & Computacao BR-13560 Sao Carlos SP Brazil Univ Texas Dept Comp Sci Richardson TX 75080 USA Ctr Univ Euripides Marilia BR-17525901 Marilia SP Brazil

Although software testing is a crucial activity in the software development process, only recently have more sound and consistent testing tools become available for testing java programs and their components. These tools support mostly functional and control-flow based structural criteria. In this paper we explore control-flow and data-flow based coverage criteria to support the testing of java programs and/or components. We also describe a testing tool, named JaBUTi, which can be used by both the component developer and the component user to test java-based components and/or systems. To achieve this goal, the tool works at the bytecode level such that no source code is required during the testing activity. We illustrate these ideas and concepts with an example extracted from the literature. (c) 2004 Elsevier B.V. All rights reserved.

关键词： java program testing java component testing java bytecode structural testing control-flow testing data-flow testing

来源：评论

学校读者我要写书评

暂无评论

JCSI: A tool for checking secure information flow in java Card applications

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2012年第11期85卷 2479-2493页

作者： Avvenuti, Marco Bernardeschi, Cinzia De Francesco, Nicoletta Masci, Paolo Univ Pisa Dept Informat Engn I-56126 Pisa Italy Queen Mary Univ London Sch Elect Engn & Comp Sci London E1 4NS England

This paper describes a tool for checking secure information flow in java Card applications. The tool performs a static analysis of java Card CAP files and includes a CAP viewer. The analysis is based on the theory of abstract interpretation and on a multi-level security policy assignment. Actual values of variables are abstracted into security levels, and bytecode instructions are executed over an abstract domain. The tool can be used for discovering security issues due to explicit or implicit information flows and for checking security properties of java Card applications downloaded from untrusted sources. (c) 2012 Elsevier Inc. All rights reserved.

关键词： java card java bytecode CAP file Secure information flow Abstract interpretation

来源：评论

学校读者我要写书评

暂无评论

Architecture Independent Characterization of Embedded java Workloads

IEEE COMPUTER ARCHITECTURE LETTERS

引用

IEEE COMPUTER ARCHITECTURE LETTERS 2009年第1期8卷 29-32页

作者： Desai, Aniruddha Singh, Jugdutt La Trobe Univ Bundoora Vic 3086 Australia

This paper presents architecture independent characterization of embedded java workloads based on the industry standard GrinderBench benchmark which includes different classes of real world embedded java applications. This work is based on a custom built embedded java Virtual Machine (JVM) simulator specifically designed for embedded JVM modeling and embodies domain specific details such as thread scheduling, algorithms used for native CLDC APIs and runtime data structures optimized for use in embedded systems. The results presented include dynamic execution characteristics, dynamic bytecode instruction mix, application and API workload distribution, Object allocation statistics, instruction-set coverage, memory usage statistics and method code and stack frame characteristics.

关键词： java java bytecode Workload Characterization Embedded Systems

来源：评论

学校读者我要写书评

暂无评论

An annotation-aware java virtual machine implementation

引用

CONCURRENCY-PRACTICE AND EXPERIENCE 2000年第6期12卷 423-444页

作者： Azevedo, A Nicolau, A Hummel, J Univ Calif Irvine Dept Informat & Comp Sci Irvine CA 92697 USA Univ Illinois Chicago IL USA

The java bytecode language lacks expressiveness for traditional compiler optimizations, making this portable, secure software distribution format inefficient as a program representation for high performance. This inefficiency results from the underlying stack model, as well as the fact that many bytecode operations intrinsically include sub-operations (e.g. iaload includes the address computation, array bounds checks and the actual load of the array element), The stack model, with no operand registers and limiting access to the top of the stack, prevents the re-use of values and bytecode re-ordering, In addition, the language has no mechanism to indicate which sub-operations in the java bytecode stream are redundant or subsumed by previous ones. As a consequence, the java bytecode language inhibits the expression of important compiler optimizations, including register allocation and instruction scheduling. The java bytecode stream generated by a java bytecode compiler is a significantly under-optimized program representation, The most common solution to overcome this inefficiency is the use of a just-in-time (JIT) compiler to not only generate native code, but perform optimization as well. However, the latter is a time-consuming operation in an already time-constrained translation process, In this paper we present an alternative to an optimizing JIT compiler that makes use of code annotations generated by a java bytecode compiler. These annotations carry information concerning compiler optimizations. During the translation process, an annotation-aware java Virtual Machine (JVM) system then uses this information to produce high-performance native code without performing much of the necessary analyses or transformations. We describe the implementation of a prototype of an annotation-aware JVM consisting of an annotation-aware JIT compilation system. We conclude the paper showing performance results comparing our system with other JVMs running on SPARC architecture. Co

关键词： dynamic compilation JIT compilation java Virtual Machine java bytecode code annotation

来源：评论

学校读者我要写书评

暂无评论

A NOVEL MECHANISM FOR GRIDIFICATION OF COMPILED java APPLICATIONS

引用

COMPUTING AND INFORMATICS 2011年第6期30卷 1259-1285页

作者： Mateos, Cristian Zunino, Alejandro Trachsel, Ramiro Campo, Marcelo ISISTAN UNICEN Tandil Buenos Aires Argentina Consejo Nacl Invest Cient & Tecn RA-1033 Buenos Aires DF Argentina

Exploiting Grids intuitively requires developers to alter their applications, which calls for expertise on Grid programming. Gridification tools address this problem by semi-automatically making user applications to be Grid-aware. However, most of these tools produce monolithic Grid applications in which common tuning mechanisms (e.g. parallelism) are not applicable, and do not reuse existing Grid middleware services. We propose BYG (BY tecode Gridifier), a gridification tool that relies on novel bytecode rewriting techniques to parallelize and easily execute existing applications via Grid middlewares. Experiments performed by using several computing intensive applications on a cluster and a simulated wide-area Grid suggest that our techniques are effective while staying competitive compared to programmatically using such services for gridifying applications.

关键词： Grid computing gridification parallelism Grid middlewares Satin resource-intensive applications java bytecode

来源：评论

学校读者我要写书评

暂无评论

Flight of the FINCH Through the java Wilderness

引用

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 2011年第2期15卷 166-182页

作者： Orlov, Michael Sipper, Moshe Ben Gurion Univ Negev Dept Comp Sci IL-84105 Beer Sheva Israel

We describe Fertile Darwinian bytecode Harvester (FINCH), a methodology for evolving java bytecode, enabling the evolution of extant, unrestricted java programs, or programs in other languages that compile to java bytecode. Our approach is based upon the notion of compatible crossover, which produces correct programs by performing operand stack-based, local variables-based, and control flow-based compatibility checks on source and destination bytecode sections. This is in contrast to existing work that uses restricted subsets of the java bytecode instruction set as a representation language for individuals in genetic programming. We demonstrate FINCH's unqualified success at solving a host of problems, including simple and complex regression, trail navigation, image classification, array sum, and tic-tac-toe. FINCH exploits the richness of the java virtual machine architecture and type system, ultimately evolving human-readable solutions in the form of java programs. The ability to evolve java programs will hopefully lead to a valuable new tool in the software engineer's toolkit.

关键词： Automatic programming genetic programming (GP) java bytecode software evolution

来源：评论

学校读者我要写书评

暂无评论

Pushing java Type Obfuscation to the Limit

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2014年第6期11卷 553-567页

作者： Foket, Christophe De Sutter, Bjorn De Bosschere, Koen Univ Ghent Dept Elect & Informat Syst Comp Syst Lab B-9000 Ghent Belgium

bytecoded .Net and java programs reveal type information through encoded type hierarchies, casts, field declarations and method signatures. This facilitates bytecode verification, but it also helps reverse engineers. To obfuscate the type information, we combine three transformations. Class hierarchy flattening removes as much of the type hierarchy from programs as possible. Interface merging and object factory insertion further remove type information from casts, method signatures, and object creation sites. We evaluate these techniques with a prototype tool for java bytecode. On real-life programs from the DaCapo benchmark suite, we demonstrate that our approach effectively hinders human and tool analysis with limited overhead.

关键词： java bytecode obfuscation class hierarchy type information points-to sets understandability performance

来源：评论

学校读者我要写书评

暂无评论

Detecting theft of java applications via a static birthmark based on weighted stack patterns

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2008年第9期E91D卷 2323-2332页

作者： Lim, Hyun-il Park, Heewan choi, Seokwoo Han, Taisook Korea Adv Inst Sci & Technol Div Comp Sci Taejon South Korea Inst Elect Informat & Commun Engineers Tokyo Japan

A software birthmark means the inherent characteristics of a program that can be used to identify the program. A comparison of such birthmarks facilitates the detection of software theft. In this paper, we propose a static java birthmark based on a set of stack patterns, which reflect the characteristic of java applications. A stack pattern denotes a sequence of bytecodes that share their operands through the operand stack. A weight scheme is used to balance the influence of each bytecode in a comparison of the birthmarks. We evaluate the proposed birthmark with respect to two properties required for a birthmark: credibility and resilience. The empirical results show that the proposed birthmark is highly credible and resilient to program transformation. We also compare the proposed birthmark with existing birthmarks, such as that of Tamada et al. and the k-gram birthmark. The experimental results show that the proposed birthmark is more stable than the birthmarks in terms of resilience to program transformation. Thus, the proposed birthmark can provide more reliable evidence of software theft when the software is modified by someone other than author.

关键词： software birthmark software theft detection software protection java bytecode

来源：评论

学校读者我要写书评

暂无评论

JShrink: In-Depth Investigation into Debloating Modern java Applications 2020

JShrink: In-Depth Investigation into Debloating Modern Java ...

引用

28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE)

作者： Bruce, Bobby R. Zhang, Tianyi Arora, Jaspreet Xu, Guoqing Harry Kim, Miryung Univ Calif Davis Davis CA 95616 USA Harvard Univ Cambridge MA 02138 USA Univ Calif Los Angeles Los Angeles CA 90024 USA

ISBN: (纸本)9781450370431

Modern software is bloated. Demand for new functionality has led developers to include more and more features, many of which become unneeded or unused as software evolves. This phenomenon, known as software bloat, results in software consuming more resources than it otherwise needs to. How to effectively and automatically debloat software is a long-standing problem in software engineering. Various debloating techniques have been proposed since the late 1990s. However, many of these techniques are built upon pure static analysis and have yet to be extended and evaluated in the context of modern java applications where dynamic language features are prevalent. To this end, we develop an end-to-end bytecode debloating framework called JSHRINK. It augments traditional static reachability analysis with dynamic profiling and type dependency analysis and renovates existing bytecode transformations to account for new language features in modern java. We highlight several nuanced technical challenges that must be handled properly and examine behavior preservation of debloated software via regression testing. We find that (1) JSHRINK is able to debloat our real-world java benchmark suite by up to 47% (14% on average);(2) accounting for dynamic language features is indeed crucial to ensure behavior preservation-reducing 98% of test failures incurred by a purely static equivalent, Jax, and 84% for ProGuard;and (3) compared with purely dynamic approaches, integrating static analysis with dynamic profiling makes the debloated software more robust to unseen test executions-in 22 out of 26 projects, the debloated software ran successfully under new tests.

关键词： java bytecode size reduction reachability analysis debloating

来源：评论

学校读者我要写书评

暂无评论

Constraint-Logic Object-Oriented Programming on the java Virtual Machine 22

Constraint-Logic Object-Oriented Programming on the Java Vir...

引用

37th Annual ACM Symposium on Applied Computing

作者： Winkelmann, Hendrik Kuchen, Herbert Univ Munster Munster Germany

ISBN: (纸本)9781450387132

Constraint-logic object-oriented programming is a paradigm by means of which multiple application areas, such as the formulation of and solving constraint-satisfaction problems, the systematic generation of object graphs, and test-case generation become language features. This paradigm has been implemented in the prototypical programming language Muli. Though the usefulness of aforementioned features has been demonstrated in the past, Muli has seen little practical adoption. The reasons for this is the performance of the current implementation of Muli and its technical incompatibility with existing systems. In this paper, we give further details on these limitations, derive desiderata for a new implementation of Muli and design a new system, Mulib, that enables the features of this paradigm on a standard java virtual machine. In this context, we furthermore provide the means to efficiently make use of incremental constraint solvers in a parallel setting.

关键词： Constraint-logic object-oriented programming Program transformation java bytecode

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：