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...

ver descrição completa

Detalhes bibliográficos
Autores: Lucas Alba, Salvador|||0000-0001-9923-2108, Meseguer, José
Tipo de documento: capítulo de livro
Data de publicação:2014
País:España
Recursos:Universitat Politècnica de València (UPV)
Repositório: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 aberto
Palavra-chave:Conditional term rewriting
Dependency pairs
Program analysis
Operational termination
LENGUAJES Y SISTEMAS INFORMATICOS
id ES_a4b48b193c210c8e187d08ae3663ce7e
oai_identifier_str oai:riunet.upv.es:10251/50872
network_acronym_str ES
network_name_str España
repository_id_str
spelling 2D Dependency Pairs for Proving Operational Termination of CTRSsLucas Alba, Salvador|||0000-0001-9923-2108Meseguer, JoséConditional term rewritingDependency pairsProgram analysisOperational terminationLENGUAJES Y SISTEMAS INFORMATICOSThe 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.Springer Verlag (Germany)Departamento de Sistemas Informáticos y ComputaciónEscuela Técnica Superior de Ingeniería InformáticaInstituto Universitario Valenciano de Investigación en Inteligencia ArtificialRepositorio Institucional de la Universitat Politècnica de València Riunet20142014-11-01book parthttp://purl.org/coar/resource_type/c_3248VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/bookPartapplication/pdfapplication/pdfhttps://riunet.upv.es/handle/10251/50872reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Reserva de todos los derechoshttp://rightsstatements.org/vocab/InC/1.0/info:eu-repo/semantics/openAccessoai:riunet.upv.es:10251/508722026-06-13T07:49:27Z
dc.title.none.fl_str_mv 2D Dependency Pairs for Proving Operational Termination of CTRSs
title 2D Dependency Pairs for Proving Operational Termination of CTRSs
spellingShingle 2D Dependency Pairs for Proving Operational Termination of CTRSs
Lucas Alba, Salvador|||0000-0001-9923-2108
Conditional term rewriting
Dependency pairs
Program analysis
Operational termination
LENGUAJES Y SISTEMAS INFORMATICOS
title_short 2D Dependency Pairs for Proving Operational Termination of CTRSs
title_full 2D Dependency Pairs for Proving Operational Termination of CTRSs
title_fullStr 2D Dependency Pairs for Proving Operational Termination of CTRSs
title_full_unstemmed 2D Dependency Pairs for Proving Operational Termination of CTRSs
title_sort 2D Dependency Pairs for Proving Operational Termination of CTRSs
dc.creator.none.fl_str_mv Lucas Alba, Salvador|||0000-0001-9923-2108
Meseguer, José
author Lucas Alba, Salvador|||0000-0001-9923-2108
author_facet Lucas Alba, Salvador|||0000-0001-9923-2108
Meseguer, José
author_role author
author2 Meseguer, José
author2_role author
dc.contributor.none.fl_str_mv Departamento de Sistemas Informáticos y Computación
Escuela Técnica Superior de Ingeniería Informática
Instituto Universitario Valenciano de Investigación en Inteligencia Artificial
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Conditional term rewriting
Dependency pairs
Program analysis
Operational termination
LENGUAJES Y SISTEMAS INFORMATICOS
topic Conditional term rewriting
Dependency pairs
Program analysis
Operational termination
LENGUAJES Y SISTEMAS INFORMATICOS
description 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.
publishDate 2014
dc.date.none.fl_str_mv 2014
2014-11-01
dc.type.none.fl_str_mv book part
http://purl.org/coar/resource_type/c_3248
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/bookPart
format bookPart
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/50872
url https://riunet.upv.es/handle/10251/50872
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
Reserva de todos los derechos
http://rightsstatements.org/vocab/InC/1.0/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Springer Verlag (Germany)
publisher.none.fl_str_mv Springer Verlag (Germany)
dc.source.none.fl_str_mv reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
instname:Universitat Politècnica de València (UPV)
instname_str Universitat Politècnica de València (UPV)
reponame_str RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
collection RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869415537170186240
score 15,301629

Registros relacionados