Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimisation Validation David Aspinall 1
 

Summary: COCV 2006
Optimisation Validation
David Aspinall 1
LFCS, School of Informatics, University of Edinburgh, U.K.
Lennart Beringer 2
Institut f¨ur Informatik, Ludwig-Maximilians-Universit¨at M¨unchen, Germany
Alberto Momigliano 3
LFCS, School of Informatics, University of Edinburgh, U.K. and
DSI, University of Milan, Italy
Abstract
We introduce the idea of optimisation validation, which is to formally establish that
an instance of an optimising transformation indeed improves with respect to some
resource measure. This is related to, but in contrast with, translation validation,
which aims to establish that a particular instance of a transformation undertaken by
an optimising compiler is semantics preserving. Our main setting is a program logic
for a subset of Java bytecode, which is sound and complete for a resource-annotated
operational semantics. The latter employs resource algebras for measuring dynamic
costs such as time, space and more elaborate examples. We describe examples of
optimisation validation that we have formally verified in Isabelle/HOL using the
logic. We also introduce a type and effect system for measuring static costs such as

  

Source: Aspinall, David - School of Informatics, University of Edinburgh

 

Collections: Computer Technologies and Information Sciences