An efficient, parametric fixpoint algorithm for incremental analysis of java bytecode

Méndez-Lojo, Mario; Navas, J. y Hermenegildo, Manuel V. (2006). An efficient, parametric fixpoint algorithm for incremental analysis of java bytecode. Monografía (Artículo de trabajo). Facultad de Informática (UPM) [antigua denominación], Madrid, Spain.

Descripción

Título: An efficient, parametric fixpoint algorithm for incremental analysis of java bytecode
Autor/es:
  • Méndez-Lojo, Mario
  • Navas, J.
  • Hermenegildo, Manuel V.
Tipo de Documento: Monográfico (Informes, Documentos de trabajo, etc.) (Artículo de trabajo)
Fecha: 8 Diciembre 2006
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, more precisely, Java source and bytecode. However, while most of the existing work deals with the problem of finding expressive abstract domains that track accurately the characteristics of a particular concrete property, the underlying fixpoint algorithms have received comparatively less attention. In fact, many existing (abstract interpretation based) fixpoint algorithms rely on relatively inefficient techniques to solve inter-procedural call graphs or are specific and tied to particular analyses. We argue that the design of an efficient fixpoint algorithm is pivotal to support 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. Also, 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". It is also incremental in the sense that, if desired, analysis data can be saved so that only a reduced amount of reanalysis is needed after a small program change, which can be instrumental for large programs. The algorithm is also multivariant and flowsensitive. Finally, another interesting characteristic of the algorithm is that it 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 provided and discussed with an example.

Más información

ID de Registro: 15004
Identificador DC: http://oa.upm.es/15004/
Identificador OAI: oai:oa.upm.es:15004
URL Oficial: http://clip.dia.fi.upm.es/~herme/engcurnew/engcurnew.html
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 28 Abr 2013 05:25
Ultima Modificación: 21 Abr 2016 15:03
  • 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