TY - GEN
T1 - Symbolic and analytic techniques for resource analysis of Java bytecode
AU - Aspinall, David
AU - Atkey, Robert
AU - MacKenzie, Kenneth
AU - Sannella, Donald
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
KW - java bytecode
KW - programming languages
UR - http://www.scopus.com/inward/record.url?scp=77958028869&partnerID=8YFLogxK
UR - http://personal.cis.strath.ac.uk/~raa/symbolic.html
U2 - 10.1007/978-3-642-15640-3_1
DO - 10.1007/978-3-642-15640-3_1
M3 - Conference contribution book
SN - 9783642156397
VL - 6084
T3 - Lecture Notes in Computer Science
SP - 1
EP - 22
BT - Trustworthly Global Computing - 5th International Symposium, TGC 2010, Munich, Germany, February 24-26, 2010, Revised Selected Papers
A2 - Wirsing, Martin
A2 - Hofmann, Martin
A2 - Rauschmayer, Axel
PB - Springer
ER -