A Program Logic for Resource Verification

19Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Aspinall, D., Beringer, L., Hofmann, M., Loidl, H. W., & Momigliano, A. (2004). A Program Logic for Resource Verification. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3223, 34–49. https://doi.org/10.1007/978-3-540-30142-4_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free