Synthesis of ranking functions using extremal counterexamples - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Synthesis of ranking functions using extremal counterexamples


We present a complete method for synthesizing lexicographic linear ranking functions (and thus proving termination), supported by inductive invariants, in the case where the transition relation of the program includes disjunctions and existentials (large block encoding of control flow). Previous work would either synthesize a ranking function at every basic block head, not just loop headers, which reduces the scope of programs that may be proved to be terminating, or expand large block transitions including tests into (exponentially many) elementary transitions, prior to computing the ranking function, resulting in a very large global constraint system. In contrast, our algorithm incrementally refines a global linear constraint system according to extremal counterexamples: only constraints that exclude spurious solutions are included. Experiments with our tool Termite show marked performance and scalability improvements compared to other systems.
Fichier principal
Vignette du fichier
PLDI15_termite_authorVersion.pdf (525.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01144622 , version 1 (22-04-2015)





Laure Gonnord, David Monniaux, Gabriel Radanne. Synthesis of ranking functions using extremal counterexamples. Programming Languages, Design and Implementation, Jun 2015, Portland, Oregon, United States. ⟨10.1145/2737924.2737976⟩. ⟨hal-01144622⟩
753 View
648 Download



Gmail Facebook X LinkedIn More