Abstract. The traditional method for proving program termination consists in inferring a ranking function. In many cases (i.e. programs.

The abstract domain is parametric in the choice of the maximum degree of the polynomial, and the types of functions used as polynomial coefficients. We have ...

To our knowledge this is the first abstract domain able to reason about ordinals. Handling ordinals leads to a powerful approach for proving termination of ...

Abstract. The traditional method for proving program termination consists in inferring a ranking function. In many cases (i.e. programs.

The traditional method for proving program termination consists in inferring a ranking function. In many cases i.e. programs with unbounded non-determinism, ...

Bibliographic details on An Abstract Domain to Infer Ordinal-Valued Ranking Functions.

Alias, C., Darte, A., Feautrier, P., Gonnord, L.: Multi-Dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs.

An Abstract Domain to Infer Ordinal-Valued Ranking Functions. https://doi.org/10.1007/978-3-642-54833-8_22 · Повний текст. Видання: Programming Languages and ...

Jan 20, 2015 · Abstract. The traditional method for proving program termination consists in inferring a ranking function. In many.

The tool automatically infers piecewise-defined ranking functions and sufficient preconditions for termination, guarantee and recurrence properties by means of ...