Symbolic and analytic techniques for resource analysis of Java bytecode

Aspinall, David and Atkey, Robert and MacKenzie, Kenneth and Sannella, Donald; Wirsing, Martin and Hofmann, Martin and Rauschmayer, Axel, eds. (2010) Symbolic and analytic techniques for resource analysis of Java bytecode. In: Trustworthly Global Computing - 5th International Symposium, TGC 2010, Munich, Germany, February 24-26, 2010, Revised Selected Papers. Lecture Notes in Computer Science, 6084 . Springer, pp. 1-22. ISBN 9783642156397 (https://doi.org/10.1007/978-3-642-15640-3_1)

[thumbnail of symbolic.pdf]
Preview
 PDF. Filename: symbolic.pdf
Accepted Author Manuscript
Download (396kB)| Preview

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.

ORCID iDs

Aspinall, David, Atkey, Robert ORCID logoORCID: https://orcid.org/0000-0002-4414-5047, MacKenzie, Kenneth and Sannella, Donald; Wirsing, Martin, Hofmann, Martin and Rauschmayer, Axel
CORE (COnnecting REpositories)