Cost analysis of concurrent OO programs

Authors:
Elvira Albert;Puri Arenas;Samir Genaim;Miguel Gómez-Zamalloa;German 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:
APLAS'11 Proceedings of the 9th Asian conference on Programming Languages and Systems
Year:
2011

Citing 21
Cited 5

Object-oriented software construction (2nd ed.)

Object-oriented software construction (2nd ed.)
Resource bound certification

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

Communications of the ACM
Inferring Argument Size Relationships with CLP(R)

LOPSTR '96 Proceedings of the 6th International Workshop on Logic Programming Synthesis and Transformation
Dynamic Matrices and the Cost Analysis of Concurrent Programs

AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Soot - a Java bytecode optimization framework

CASCON '99 Proceedings of the 1999 conference of the Centre for Advanced Studies on Collaborative research
Profiling large-scale lazy functional programs

Journal of Functional Programming
Proving thread termination

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
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
A termination analyzer for Java bytecode based on path-length

ACM Transactions on Programming Languages and Systems (TOPLAS)
Cost analysis of java bytecode

ESOP'07 Proceedings of the 16th European conference on Programming
A complete guide to the future

ESOP'07 Proceedings of the 16th European conference on Programming
Static verification for code contracts

SAS'10 Proceedings of the 17th international conference on Static analysis
From object fields to local variables: a practical approach to field-sensitive analysis

SAS'10 Proceedings of the 17th international conference on Static analysis
JCoBox: generalizing active objects to concurrent components

ECOOP'10 Proceedings of the 24th European conference on Object-oriented programming
Closed-Form Upper Bounds in Static Cost Analysis

Journal of Automated Reasoning
Live heap space bounds for real-time systems

APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
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
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
ABS: a core language for abstract behavioral specification

FMCO'10 Proceedings of the 9th international conference on Formal Methods for Components and Objects

COSTABS: a cost and termination analyzer for ABS

PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Automatic inference of resource consumption bounds

LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Analysis of may-happen-in-parallel in concurrent objects

FMOODS'12/FORTE'12 Proceedings of the 14th joint IFIP WG 6.1 international conference and Proceedings of the 32nd IFIP WG 6.1 international conference on Formal Techniques for Distributed Systems
User-defined schedulers for real-time concurrent objects

Innovations in Systems and 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

Cost analysis aims at automatically approximating the resource consumption (e.g., memory) of executing a program in terms of its input parameters. While cost analysis for sequential programming languages has received considerable attention, concurrency and distribution have been notably less studied. The main challenges (and our contributions) of cost analysis in a concurrent setting are: (1) Inferring precise size relations for data in the program in the presence of shared memory. This information is essential for bounding the number of iterations of loops. (2) Distribution suggests that analysis must keep the cost of the diverse distributed components separate. We handle this by means of a novel form of recurrence equations which are parametric on the notion of cost center, which represents a corresponding component. To the best of our knowledge, our work is the first one to present a general cost analysis framework and an implementation for concurrent OO programs.