Towards Certificate Generation for Linear Heap Consumption (2004)
| Venue: | In Proceedings of the ICALP/LICS Workshop on Logics for Resources, Processes, and Programs (LRPP2004 |
| Citations: | 2 - 2 self |
BibTeX
@INPROCEEDINGS{Beringer04towardscertificate,
author = {Lennart Beringer and Martin Hofmann and Alberto Momigliano and Olha Shkaravska},
title = {Towards Certificate Generation for Linear Heap Consumption},
booktitle = {In Proceedings of the ICALP/LICS Workshop on Logics for Resources, Processes, and Programs (LRPP2004},
year = {2004}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a program logic for verifying the heap consumption of programs written in an abstract representation of the Java virtual machine language. The logic is defined by an expansion into the more general program logic presented in [2], but concrete program program verification may be performed purely on the abstract level, without recourse to the base logic. Format and interpretation of assertions closely match the interpretation of [8]'s type system for functional programs where the consumption of heap space is bounded by a linear function on the input size. The derived proof rules enable us to replay typing derivations in a theorem prover, given assertions about individual methods. The resulting verification conditions are of limited complexity, and may be discharged without significant programmer intervention.
