TY - GEN
T1 - COSTA
T2 - 6th International Symposium on Formal Methods for Components and Objects, FMCO 2007
AU - Albert, Elvira
AU - Arenas, Puri
AU - Genaim, Samir
AU - Puebla, German
AU - Zanardini, Damiano
PY - 2008/12/1
Y1 - 2008/12/1
N2 - This paper describes the architecture of costa, an abstract interpretation based cost and termination analyzer for Java bytecode. The system receives as input a bytecode program, (a choice of) a resource of interest and tries to obtain an upper bound of the resource consumption of the program. costa provides several non-trivial notions of cost, as the consumption of the heap, the number of bytecode instructions executed and the number of calls to a specific method. Additionally, costa tries to prove termination of the bytecode program which implies the boundedness of any resource consumption. Having cost and termination together is interesting, as both analyses share most of the machinery to, respectively, infer cost upper bounds and to prove that the execution length is always finite (i.e., the program terminates). We report on experimental results which show that costa can deal with programs of realistic size and complexity, including programs which use Java libraries. To the best of our knowledge, this system provides for the first time evidence that resource usage analysis can be applied to a realistic object-oriented, bytecode programming language.
AB - This paper describes the architecture of costa, an abstract interpretation based cost and termination analyzer for Java bytecode. The system receives as input a bytecode program, (a choice of) a resource of interest and tries to obtain an upper bound of the resource consumption of the program. costa provides several non-trivial notions of cost, as the consumption of the heap, the number of bytecode instructions executed and the number of calls to a specific method. Additionally, costa tries to prove termination of the bytecode program which implies the boundedness of any resource consumption. Having cost and termination together is interesting, as both analyses share most of the machinery to, respectively, infer cost upper bounds and to prove that the execution length is always finite (i.e., the program terminates). We report on experimental results which show that costa can deal with programs of realistic size and complexity, including programs which use Java libraries. To the best of our knowledge, this system provides for the first time evidence that resource usage analysis can be applied to a realistic object-oriented, bytecode programming language.
UR - https://www.scopus.com/pages/publications/58849099997
U2 - 10.1007/978-3-540-92188-2_5
DO - 10.1007/978-3-540-92188-2_5
M3 - Conference contribution
AN - SCOPUS:58849099997
SN - 3540921877
SN - 9783540921875
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 113
EP - 132
BT - Formal Methods for Components and Objects - 6th International Symposium, FMCO 2007, Revised Papers
Y2 - 24 October 2007 through 26 October 2007
ER -