Resource Usage Analysis and Its Application to Resource Certification

Authors:
Elvira Albert;Puri Arenas;Samir Genaim;Germán Puebla;Damiano Zanardini
Affiliations:
DSIC, Complutense University of Madrid, Madrid, Spain E-28040;DSIC, Complutense University of Madrid, Madrid, Spain E-28040;CLIP, Technical University of Madrid, Boadilla del Monte, Madrid, Spain E-28660;CLIP, Technical University of Madrid, Boadilla del Monte, Madrid, Spain E-28660;CLIP, Technical University of Madrid, Boadilla del Monte, Madrid, Spain E-28660
Venue:
Foundations of Security Analysis and Design V
Year:
2009

Citing 0
Cited 5

From object fields to local variables: a practical approach to field-sensitive analysis

SAS'10 Proceedings of the 17th international conference on Static analysis
Closed-Form Upper Bounds in Static Cost Analysis

Journal of Automated Reasoning
Modular termination analysis of java bytecode and its application to phoneME core libraries

FACS'10 Proceedings of the 7th international conference on Formal Aspects of Component Software
Iterative mining of resource-releasing specifications

ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
On the Inference of Resource Usage Upper and Lower Bounds

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Resource usage is one of the most important characteristics of programs. Automatically generated information about resource usage can be used in multiple ways, both during program development and deployment. In this paper we discuss and present examples on how such information is obtained in COSTA, a state of the art static analysis system. COSTA obtains safe symbolic upper bounds on the resource usage of a large class of general-purpose programs written in a mainstream programming language such as Java (bytecode). We also discuss the application of resource-usage information for code certification, whereby code not guaranteed to run within certain user-specified bounds is rejected.