Interpolation-Based height analysis for improving a recurrence solver

Authors:
Manuel Montenegro;Olha Shkaravska;Marko van Eekelen;Ricardo Peña
Affiliations:
Universidad Complutense Madrid, Spain;Radboud University Nijmegen, The Netherlands;Radboud University Nijmegen, The Netherlands,Open University of the Netherlands, The Netherlands;Universidad Complutense Madrid, Spain
Venue:
FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
Year:
2011

Citing 16
Cited 2

The complexity of linear problems in fields

Journal of Symbolic Computation
Mechanical program analysis

Communications of the ACM
Static prediction of heap space usage for first-order functional programs

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library

SAS '02 Proceedings of the 9th International Symposium on Static Analysis
Inferring Static Non-monotone Size-aware Types Through Testing

Electronic Notes in Theoretical Computer Science (ENTCS)
COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode

Formal Methods for Components and Objects
Polynomial size analysis of first-order functions

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
Parametric inference of memory requirements for garbage collected languages

Proceedings of the 2010 international symposium on Memory management
Linear Quantifier Elimination

Journal of Automated Reasoning
Test-based inference of polynomial loop-bound functions

Proceedings of the 8th International Conference on the Principles and Practice of Programming in Java
Multivariate amortized resource analysis

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Collected size semantics for functional programs over lists

IFL'08 Proceedings of the 20th international conference on Implementation and application of functional languages
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

Using CHARTER tools to develop a safety-critical avionics application in Java

Proceedings of the 10th International Workshop on Java Technologies for Real-time and Embedded Systems
Making resource analysis practical for real-time Java

Proceedings of the 10th International Workshop on Java Technologies for Real-time and Embedded Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The COSTA system infers resource consumption bounds from Java bytecode using an internal recurrence solver PUBS. This paper suggests an improvement of the COSTA system, such that it can solve a larger number of recurrences. The idea is to replace one of its static analyses, the ranking function analysis, by another kind of analysis, height analysis, in such a way that polynomial bounds of any degree may be inferred instead of just linear expressions. The work can be seen as an application of some polynomial interpolation techniques used by some of the authors in prior analyses. Finding a way to choose proper test nodes is the key to the solution presented in this paper.