Symbolic and analytic techniques for resource analysis of java bytecode

Authors:
David Aspinall;Robert Atkey;Kenneth MacKenzie;Donald Sannella
Affiliations:
School of Informatics, The University of Edinburgh, Edinburgh;Computer and Information Sciences, University of Strathclyde, Glasgow;School of Informatics, The University of Edinburgh, Edinburgh;School of Informatics, The University of Edinburgh, Edinburgh
Venue:
TGC'10 Proceedings of the 5th international conference on Trustworthly global computing
Year:
2010

Citing 25
Cited 3

Counting solutions to Presburger formulas: how and why

PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Counting solutions to linear and nonlinear constraints through Ehrhart polynomials: applications to analyze and transform scientific programs

ICS '96 Proceedings of the 10th international conference on Supercomputing
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Parameterized polyhedra and their vertices

International Journal of Parallel Programming
Parametric Analysis of Polyhedral Iteration Spaces

Journal of VLSI Signal Processing Systems - Special issue on application specific systems, architectures and processors
BI as an assertion language for mutable data structures

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Certifying algorithms for recognizing interval graphs and permutation graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Loop Parallelization in the Polytope Model

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Analytical computation of Ehrhart polynomials: enabling more compiler analyses and optimizations

Proceedings of the 2004 international conference on Compilers, architecture, and synthesis for embedded systems
Precise widening operators for convex polyhedra

Science of Computer Programming - Special issue: Static analysis symposium (SAS 2003)
Note: Maximal periods of (Ehrhart) quasi-polynomials

Journal of Combinatorial Theory Series A
Iterative optimization in the polyhedral model: part ii, multidimensional time

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Parametric prediction of heap memory requirements

Proceedings of the 7th international symposium on Memory management
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems

Science of Computer 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
COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode

Formal Methods for Components and Objects
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
Applications of polyhedral computations to the analysis and verification of hardware and software systems

Theoretical Computer Science
MOBIUS: mobility, ubiquity, security objectives and progress report

TGC'06 Proceedings of the 2nd international conference on Trustworthy global computing
Symbolic execution with separation logic

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Amortised resource analysis with separation logic

ESOP'10 Proceedings of the 19th European conference on Programming Languages and 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

Static Resource Analysis for Java Bytecode Using Amortisation and Separation Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
A type system for finding upper resource bounds of multi-threaded programs with nested transactions

Proceedings of the Third Symposium on Information and Communication Technology
A hybrid approach for resource-based comparison of adaptable Java applications

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent work in resource analysis has translated the idea of amortised resource analysis to imperative languages using a program logic that allows mixing of assertions about heap shapes, in the tradition of separation logic, and assertions about consumable resources. Separately, polyhedral methods have been used to calculate bounds on numbers of iterations in loop-based programs. We are attempting to combine these ideas to deal with Java programs involving both data structures and loops, focusing on the bytecode level rather than on source code.