The Abstract Domain of Segmented Ranking Functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

The Abstract Domain of Segmented Ranking Functions


We present a parameterized abstract domain for proving program termination by abstract interpretation. The domain automatically synthesizes piecewise-defined ranking functions and infers sufficient conditions for program termination. The analysis uses over-approximations but we prove its soundness, meaning that all program executions respecting these sufficient conditions are indeed terminating. The abstract domain is parameterized by a numerical abstract domain for environments and a numerical abstract domain for functions. This parameterization allows to easily tune the trade-off between precision and cost of the analysis. We describe an instantiation of this generic do- main with intervals and affine functions. We define all abstract operators, including widening to ensure convergence. To illustrate the potential of the proposed framework, we have implemented a research prototype static analyzer, for a small imperative language, that yielded interesting preliminary results.
Fichier principal
Vignette du fichier
SAS2013.pdf (240.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00925670 , version 1 (08-01-2014)



Caterina Urban. The Abstract Domain of Segmented Ranking Functions. Static Analysis, 20th International Symposium,, Jun 2013, Seattle, United States. pp.43-62, ⟨10.1007/978-3-642-38856-9_5⟩. ⟨hal-00925670⟩
145 View
219 Download



Gmail Facebook X LinkedIn More