Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Program Logic for Resource Verification David Aspinall1, Lennart Beringer1, Martin Hofmann2, Hans-Wolfgang Loidl2,
 

Summary: A Program Logic for Resource Verification
David Aspinall1, Lennart Beringer1, Martin Hofmann2, Hans-Wolfgang Loidl2,
Alberto Momigliano1
1 Laboratory for Foundations of Computer Science, School of Informatics, University of
Edinburgh, Edinburgh EH9 3JZ, Scotland; {da,lenb,amomigl1}@inf.ed.ac.uk
2 Institut f¨ur Informatik, Ludwig-Maximilians Universit¨at, D-80538 M¨unchen, Germany;
{mhofmann,hwloidl}@informatik.uni-muenchen.de
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.
1 Introduction
For the effective use of mobile code, resource consumption is of great concern. A user
who downloads an application program onto his mobile phone wants to know that the

  

Source: Aspinall, David - School of Informatics, University of Edinburgh
Momigliano, Alberto - Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh

 

Collections: Computer Technologies and Information Sciences