Automatic inference of resource consumption bounds

Authors:
Elvira Albert;Puri Arenas;Samir Genaim;Miguel Gómez-Zamalloa;Germán Puebla
Affiliations:
DSIC, Complutense University of Madrid, Spain;DSIC, Complutense University of Madrid, Spain;DSIC, Complutense University of Madrid, Spain;DSIC, Complutense University of Madrid, Spain;DLSIIS, Technical University of Madrid, Spain
Venue:
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2012

Citing 34
Cited 0

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Complexity analysis for a lazy higher-order language

Proceedings of the third European symposium on programming on ESOP '90
Cost analysis of logic programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mechanical program analysis

Communications of the ACM
Java Virtual Machine Specification

Java Virtual Machine Specification
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Optimized Live Heap Bound Analysis

VMCAI 2003 Proceedings of the 4th International Conference on Verification, Model Checking, and Abstract Interpretation
Heap space analysis for java bytecode

Proceedings of the 6th international symposium on Memory management
Removing useless variables in cost analysis of Java bytecode

Proceedings of the 2008 ACM symposium on Applied computing
Parametric prediction of heap memory requirements

Proceedings of the 7th international symposium on Memory management
Analysing memory resource bounds for low-level programs

Proceedings of the 7th international symposium on Memory management
Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis

SAS '08 Proceedings of the 15th international symposium on Static Analysis
Kilim: Isolation-Typed Actors for Java

ECOOP '08 Proceedings of the 22nd European conference on Object-Oriented Programming
SPEED: precise and efficient static estimation of program computational complexity

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Featherweight X10: a core calculus for async-finish parallelism

Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Asymptotic Resource Usage Bounds

APLAS '09 Proceedings of the 7th Asian Symposium on Programming Languages and Systems
Cost analysis of java bytecode

ESOP'07 Proceedings of the 16th European conference on Programming
Parametric inference of memory requirements for garbage collected languages

Proceedings of the 2010 international symposium on Memory management
JCoBox: generalizing active objects to concurrent components

ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
Comparing cost functions in resource analysis

FOPARA'09 Proceedings of the First international conference on Foundational and practical aspects of resource analysis
Multivariate amortized resource analysis

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verified resource guarantees using COSTA and KeY

Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation
Closed-Form Upper Bounds in Static Cost Analysis

Journal of Automated Reasoning
More precise yet widely applicable cost analysis

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Task-level analysis for a language with async/finish parallelism

Proceedings of the 2011 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems
Cost analysis of object-oriented bytecode programs

Theoretical Computer Science
Incremental resource usage analysis

PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
COSTABS: a cost and termination analyzer for ABS

PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Amortized resource analysis with polynomial potential: a static inference of polynomial bounds for functional programs

ESOP'10 Proceedings of the 19th European conference on Programming Languages and Systems
Cost analysis of concurrent OO programs

APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
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
ABS: a core language for abstract behavioral specification

FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects
Verified resource guarantees for heap manipulating programs

FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the main features of programs is the amount of resources which are needed in order to run them. Different resources can be taken into consideration, such as the number of execution steps, amount of memory allocated, number of calls to certain methods, etc. Unfortunately, manually determining the resource consumption of programs is difficult and error-prone. We provide an overview of a state of the art framework for automatically obtaining both upper and lower bounds on the resource consumption of programs. The bounds obtained are functions on the size of the input arguments to the program and are obtained statically, i.e., without running the program. Due to the approximations introduced, the framework can fail to obtain (non-trivial) bounds even if they exist. On the other hand, modulo implementation bugs, the bounds thus obtained are valid for any execution of the program. The framework has been implemented in the COSTA system and can provide useful bounds for realistic object-oriented and actor-based concurrent programs.