Symbolic and Analytic Techniques for Resource Analysis of Java Bytecode

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.

• Type: Journal
• Year: 2010
• Where: TGC
• Authors: David Aspinall, Robert Atkey, Kenneth MacKenzie, Donald Sannella
• Keywords: Applied Computing, Heap Shapes, Imperative Languages, Resource Analysis, TGC 2010