Resumen:
Using Well-Founded Relations for Proving Operational Termination

Fecha

2019-09-02

Editor

Sistedes

Publicado en

Actas de las XIX Jornadas de Programación y Lenguajes (PROLE 2019)

Licencia Creative Commons

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.

Descripción

Acerca de Lucas, Salvador

Palabras clave

Declarative Languages, Logical Models, Operational Termination, Program Analysis, Well-foundedness
Página completa del ítem
Notificar un error en este resumen
Mostrar cita
Mostrar cita en BibTeX
Descargar cita en BibTeX