de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Thesis

Proving Program Termination via Transition Invariants

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44866

Kumar,  Ramesh
International Max Planck Research School, MPI for Informatics, Max Planck Society;
Programming Logics, MPI for Informatics, Max Planck Society;

http://pubman.mpdl.mpg.de/cone/persons/resource/persons45201

Podelski,  Andreas
Programming Logics, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Kumar, R. (2003). Proving Program Termination via Transition Invariants. Master Thesis, Universität des Saarlandes, Saarbrücken.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0027-F81B-7
Abstract
We can prove termination of C programs by computing 'strong enough' transition invariants by abastract interpretation. In this thesis, we describe basic ingredients for an implementation of this computation. Namely, we show how to extract models form C programs (using GCA tool [7]) and how to construct an abstract domain of transition predicates. Furthermore, we propose a method for 'compacting' a model that improves the running time of the transtion invariant generation algorithm. We implement these ingredients and the proposed optimization, and practically evaluate their effectiveness