An efficient, parametric fixpoint algorithm for analysis of java bytecode

Méndez-Lojo, Mario and Navas, J. and Hermenegildo, Manuel V. (2007). An efficient, parametric fixpoint algorithm for analysis of java bytecode. In: "Second Workshop on Bytecode Semantics, Verification, Analysis and Transformation (Bytecode 2007)", 31 March 2007, Braga, Portugal.

Description

Title: An efficient, parametric fixpoint algorithm for analysis of java bytecode
Author/s:
  • Méndez-Lojo, Mario
  • Navas, J.
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: Second Workshop on Bytecode Semantics, Verification, Analysis and Transformation (Bytecode 2007)
Event Dates: 31 March 2007
Event Location: Braga, Portugal
Title of Book: Proceedings of the Second Workshop on Bytecode Semantics, Verification, Analysis and Transformation (Bytecode 2007)
Date: 31 July 2007
Volume: 190
Subjects:
Faculty: Facultad de Informática (UPM)
Department: Inteligencia Artificial
Creative Commons Licenses: Recognition - No derivative works - Non commercial

Full text

[img]
Preview
PDF - Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (1MB) | Preview

Abstract

Abstract 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 flnding expressive abstract domains that track accurately the characteristics of a particular concrete property, the underlying flxpoint algorithms have received comparatively less attention. In fact, many existing (abstract interpretation based—) flxpoint algorithms rely on relatively inefHcient techniques for solving inter-procedural caligraphs or are speciflc and tied to particular analyses. We also argüe 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.

More information

Item ID: 14606
DC Identifier: http://oa.upm.es/14606/
OAI Identifier: oai:oa.upm.es:14606
Official URL: http://www.sciencedirect.com/science/article/pii/S1571066107005282
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 07 Mar 2013 15:10
Last Modified: 21 Apr 2016 14:20
  • Logo InvestigaM (UPM)
  • Logo GEOUP4
  • Logo Open Access
  • Open Access
  • Logo Sherpa/Romeo
    Check whether the anglo-saxon journal in which you have published an article allows you to also publish it under open access.
  • Logo Dulcinea
    Check whether the spanish journal in which you have published an article allows you to also publish it under open access.
  • Logo de Recolecta
  • Logo del Observatorio I+D+i UPM
  • Logo de OpenCourseWare UPM