2D Dependency Pairs for Proving Operational Termination of CTRSs
The notion of *operational termination* captures nonterminating computations due to subsidiary processes that are necessary to issue a *single* `main' step but which often remain `hidden' when the main computation sequence is observed. This highlights *two dimensions* of nontermina...
| Autores: | , |
|---|---|
| Formato: | capítulo de livro |
| Fecha de publicación: | 2014 |
| País: | España |
| Recursos: | 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/50872 |
| Acesso em linha: | https://riunet.upv.es/handle/10251/50872 |
| Access Level: | acceso abierto |
| Palavra-chave: | Conditional term rewriting Dependency pairs Program analysis Operational termination LENGUAJES Y SISTEMAS INFORMATICOS |
| Resumo: | The notion of *operational termination* captures nonterminating computations due to subsidiary processes that are necessary to issue a *single* `main' step but which often remain `hidden' when the main computation sequence is observed. This highlights *two dimensions* of nontermination: one for the infinite sequencing of computation steps, and the other that concerns the proof of some single steps. For conditional term rewriting systems (CTRSs), we introduce a new *dependency pair framework* which exploits the *bidimensional* nature of conditional rewriting (rewriting steps + satisfaction of the conditions as reachability problems) to obtain a powerful and more expressive framework for proving operational termination of CTRSs. |
|---|