User-definable resource usage bounds analysis for java bytecode

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

Description

Title: User-definable resource usage bounds analysis for java bytecode
Author/s:
  • Navas, J.
  • Méndez-Lojo, Mario
  • Hermenegildo, Manuel V.
Item Type: Presentation at Congress or Conference (Article)
Event Title: Proceedings of the Fourth Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE 2009)
Event Dates: 29th March 2009
Event Location: York, UK
Title of Book: Electronic Notes in Theoretical Computer Science
Date: March 2009
Volume: 253
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

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.

More information

Item ID: 14593
DC Identifier: http://oa.upm.es/14593/
OAI Identifier: oai:oa.upm.es:14593
Official URL: http://www.sciencedirect.com/science/article/pii/S1571066109004654
Deposited by: Biblioteca Facultad de Informatica
Deposited on: 06 Mar 2013 07:23
Last Modified: 21 Apr 2016 14:19
  • 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