A second-order formulation of non-termination - Université de La Réunion Access content directly
Journal Articles Information Processing Letters Year : 2015

A second-order formulation of non-termination


We consider the termination/non-termination property of a class of loops. Such loops are commonly used abstractions of real program pieces. Second-order logic is a convenient language to express non-termination. Of course, such property is generally undecidable. However, by restricting the language to known decidable cases, we exhibit new classes of loops, the non-termination of which is decidable. We present a bunch of examples.
Fichier principal
Vignette du fichier
1412.3271.pdf (115.28 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01451689 , version 1 (05-11-2018)



Frédéric Mesnard, Etienne Payet. A second-order formulation of non-termination. Information Processing Letters, 2015, 115 (11), pp.882--885. ⟨10.1016/j.ipl.2015.05.012⟩. ⟨hal-01451689⟩
90 View
160 Download



Gmail Mastodon Facebook X LinkedIn More