Navegación

Búsqueda

Búsqueda avanzada

Using Well-Founded Relations for Proving Operational Termination

Resumen:

In this paper, we study *operational termination*, a proof theoretical notion for capturing the termination behavior of computational systems. We prove that operational termination can be characterized at different levels by means of well-founded relations on specific formulas which can be obtained from the considered system. We show how to obtain such well-founded relations from logical models which can be automatically generated using existing tools.

Palabras Clave:

Declarative languages - Logical models - Operational Termination - Program analysis - Well-foundedness

Autor(es):

Handle:

11705/PROLE/2019/013

Descargas:

Este artículo tiene una licencia de uso CreativeCommons - Reconocimiento (by)

Descarga el artículo haciendo click aquí.