User-definable resource usage bounds analysis for java bytecode

Navas, J.; Méndez-Lojo, Mario y Hermenegildo, Manuel V. (2009). User-definable resource usage bounds analysis for java bytecode. En: "Proceedings of the Fourth Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE 2009)", 29th March 2009, York, UK.

Descripción

Título: User-definable resource usage bounds analysis for java bytecode
Autor/es:
  • Navas, J.
  • Méndez-Lojo, Mario
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: Proceedings of the Fourth Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE 2009)
Fechas del Evento: 29th March 2009
Lugar del Evento: York, UK
Título del Libro: Electronic Notes in Theoretical Computer Science
Fecha: Marzo 2009
Volumen: 253
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

Automatic cost analysis of programs has been traditionally concentrated on a reduced number of resources such as execution steps, time, or memory. However, the increasing relevance of analysis applications such as static debugging and/or certiflcation of user-level properties (including for mobile code) makes it interesting to develop analyses for resource notions that are actually application-dependent. This may include, for example, bytes sent or received by an application, number of files left open, number of SMSs sent or received, number of accesses to a datábase, money spent, energy consumption, etc. We present a fully automated analysis for inferring upper bounds on the usage that a Java bytecode program makes of a set of application programmer-deflnable resources. In our context, a resource is defined by programmer-provided annotations which state the basic consumption that certain program elements make of that resource. From these deflnitions our analysis derives functions which return an upper bound on the usage that the whole program (and individual blocks) make of that resource for any given set of input data sizes. The analysis proposed is independent of the particular resource. We also present some experimental results from a prototype implementation of the approach covering a signiflcant set of interesting resources.

Más información

ID de Registro: 14593
Identificador DC: http://oa.upm.es/14593/
Identificador OAI: oai:oa.upm.es:14593
URL Oficial: http://www.sciencedirect.com/science/article/pii/S1571066109004654
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 06 Mar 2013 07:23
Ultima Modificación: 21 Abr 2016 14:19
  • 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