License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-28050
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2805/

Dockins, Robert ; Hobor, Aquinas

A Theory of Termination via Indirection

pdf-format:
Dokument 1.pdf (165 KB)


Abstract

Step-indexed models provide approximations to a class of domain equations and can prove type safety, partial correctness, and program equivalence; however, a common misconception is that they are inapplicable to liveness problems. We disprove this by applying step-indexing to develop the first Hoare logic of total correctness for a language with function pointers and semantic assertions. In fact, from a liveness perspective, our logic is stronger: we verify explicit time resource bounds. We apply our logic to examples containing nontrivial "higher-order" uses of function pointers and we prove soundness with respect to a standard operational semantics. Our core technique is very compact and may be applicable to other liveness problems. Our results are machine checked in Coq.

BibTeX - Entry

@InProceedings{dockins_et_al:DSP:2010:2805,
  author =	{Robert Dockins and Aquinas Hobor},
  title =	{A Theory of Termination via Indirection},
  booktitle =	{Modelling, Controlling and Reasoning About State},
  year =	{2010},
  editor =	{Amal Ahmed and Nick Benton and Lars Birkedal and Martin Hofmann},
  number =	{10351},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2805},
  annote =	{Keywords: Step-indexed Models, Termination}
}

Keywords: Step-indexed Models, Termination
Seminar: 10351 - Modelling, Controlling and Reasoning About State
Issue date: 2010
Date of publication: 04.11.2010


DROPS-Home | Fulltext Search | Imprint Published by LZI