Proving termination by policy iterationReportar como inadecuado

Proving termination by policy iteration - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

* Corresponding author 1 Lab-STICC UBO CACS MOCS Lab-STICC - Laboratoire des sciences et techniques de l-information, de la communication et de la connaissance, UBO - Université de Brest

Abstract : In this paper, we explore the adaptation of policy iteration techniques to compute greatest fixpoint approximations, in order to find sufficient conditions for program termination. Restricting ourselves to affine programs and the abstract domain of template constraint matrices, we show that the abstract greatest fixpoint can be computed exactly using linear programming, and that strategies are related to the template constraint matrix used. We also present a first result on the relationships between this approach and methods which use ranking functions.

Keywords : Abstract interpretation policy iteration template constraint matrices termination analysis

Autor: Damien Massé -



Documentos relacionados