Reducing relative termination to dependency pair problems
Relative termination, a generalized notion of termination, has been used in a number of different contexts like proving the confluence of rewrite systems or analyzing the termination of narrowing. In this paper, we introduce a new technique to prove relative termination by reducing it to dependency...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Fecha de publicación: | 2015 |
| País: | España |
| Institución: | Universitat Politècnica de València (UPV) |
| Repositorio: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia |
| Idioma: | inglés |
| OAI Identifier: | oai:riunet.upv.es:10251/65714 |
| Acceso en línea: | https://riunet.upv.es/handle/10251/65714 |
| Access Level: | acceso abierto |
| Palabra clave: | Termination Term rewriting Dependency pair Program analysis LENGUAJES Y SISTEMAS INFORMATICOS |
| Sumario: | Relative termination, a generalized notion of termination, has been used in a number of different contexts like proving the confluence of rewrite systems or analyzing the termination of narrowing. In this paper, we introduce a new technique to prove relative termination by reducing it to dependency pair problems. To the best of our knowledge, this is the first significant contribution to Problem #106 of the RTA List of Open Problems. The practical significance of our method is illustrated by means of an experimental evaluation. |
|---|