A Program Logic for Resource Verification (2004)
Cached
Download Links
- [groups.inf.ed.ac.uk]
- [homepages.inf.ed.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the 17th International Conference on Theorem Proving in Higher-Order Logics, (TPHOLs 2004), volume 3223 of LNCS |
| Citations: | 17 - 9 self |
BibTeX
@INPROCEEDINGS{Aspinall04aprogram,
author = {David Aspinall and Lennart Beringer and Martin Hofmann and Hans-wolfgang Loidl and Alberto Momigliano},
title = {A Program Logic for Resource Verification},
booktitle = {In Proceedings of the 17th International Conference on Theorem Proving in Higher-Order Logics, (TPHOLs 2004), volume 3223 of LNCS},
year = {2004},
pages = {34--49},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present a program logic for reasoning about resource consumption of programs written in Grail, an abstract fragment of the Java Virtual Machine Language. Serving as the target logic of a certifying compiler, the logic exploits Grail's dual nature of combining a functional interpretation with object-oriented features and a cost model for the JVM. We present the resource-aware operational semantics of Grail, the program logic, and prove soundness and completeness. All of the work described has been formalised in the theorem prover Isabelle/HOL, which provides us with an implementation of the logic as well as confidence in the results. We conclude with examples of using the logic for proving resource bounds on code resulting from compiling high-level functional programs.
