Making resource analysis practical for real-time Java

Authors:
Rody Kersten;Olha Shkaravska;Bernard van Gastel;Manuel Montenegro;Marko van Eekelen
Affiliations:
Radboud University Nijmegen;Radboud University Nijmegen;Open University;Universidad Complutense, Madrid;Radboud University Nijmegen and School of Computer Science, Open University
Venue:
Proceedings of the 10th International Workshop on Java Technologies for Real-time and Embedded Systems
Year:
2012

Citing 28
Cited 1

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
QEPCAD B: a program for computing with semi-algebraic sets using CADs

ACM SIGSAM Bulletin
Provably correct loops bounds for realtime Java programs

JTRES '06 Proceedings of the 4th international workshop on Java technologies for real-time and embedded systems
Inferring Static Non-monotone Size-aware Types Through Testing

Electronic Notes in Theoretical Computer Science (ENTCS)
Using global data flow analysis on bytecode to aid worst case execution time analysis for real-time Java programs

JTRES '08 Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems
Static Loop Bound Analysis of C Programs Based on Flow Analysis and Abstract Interpretation

RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode

Formal Methods for Components and Objects
Control-flow refinement and progress invariants for bound analysis

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
A Fast and Precise Static Loop Analysis Based on Abstract Interpretation, Program Slicing and Polytope Models

Proceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization
SPEED: Symbolic Complexity Bound Analysis

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Practically Applicable Formal Methods

SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Polynomial size analysis of first-order functions

TLCA'07 Proceedings of the 8th international conference on Typed lambda calculi and applications
The reachability-bound problem

PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Parametric inference of memory requirements for garbage collected languages

Proceedings of the 2010 international symposium on Memory management
Verification of object-oriented software: The KeY approach

Verification of object-oriented software: The KeY approach
Test-based inference of polynomial loop-bound functions

Proceedings of the 8th International Conference on the Principles and Practice of Programming in Java
Stack Bound Inference for Abstract Java Bytecode

TASE '10 Proceedings of the 2010 4th IEEE International Symposium on Theoretical Aspects of Software Engineering
Multivariate amortized resource analysis

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Certified absence of dangling pointers in a language with explicit deallocation

IFM'10 Proceedings of the 8th international conference on Integrated formal methods
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
Beyond assertions: advanced specification and verification with JML and ESC/Java2

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
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
Interpolation-Based height analysis for improving a recurrence solver

FOPARA'11 Proceedings of the Second international conference on Foundational and Practical Aspects of Resource Analysis
Synthesis of max-plus quasi-interpretations

Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
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

Univariate polynomial solutions of algebraic difference equations

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

For real-time and embedded systems limiting the consumption of time and memory resources is often an important part of the requirements. Being able to predict bounds on the consumption of these resources during the development process of the code can be of great value. Recent research results have advanced the state of the art of resource consumption analysis. In this paper we present a tool that makes it possible to apply these research results in practice for real-time systems enabling Java developers to analyse loop bounds, bounds on heap size and bounds on stack size. We describe which theoretical additions were needed in order to achieve this. We give an overview of the capabilities of the tool ResAna that is the result of this effort. The tool can not only perform generally applicable analyses, but it also contains a part of the analysis which is dedicated to the developers' (real-time) virtual machine, such that the results apply directly to the actual development environment that is used in practice.