An efficient, parametric fixpoint algorithm for analysis of java bytecode

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

Descripción

Título: An efficient, parametric fixpoint algorithm for analysis of java bytecode
Autor/es:
  • Méndez-Lojo, Mario
  • Navas, J.
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: Second Workshop on Bytecode Semantics, Verification, Analysis and Transformation (Bytecode 2007)
Fechas del Evento: 31 March 2007
Lugar del Evento: Braga, Portugal
Título del Libro: Proceedings of the Second Workshop on Bytecode Semantics, Verification, Analysis and Transformation (Bytecode 2007)
Fecha: 31 Julio 2007
Volumen: 190
Materias:
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (1MB) | Vista Previa

Resumen

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.

Más información

ID de Registro: 14606
Identificador DC: http://oa.upm.es/14606/
Identificador OAI: oai:oa.upm.es:14606
URL Oficial: http://www.sciencedirect.com/science/article/pii/S1571066107005282
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 07 Mar 2013 15:10
Ultima Modificación: 21 Abr 2016 14:20
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM