Context-Sensitive Dependency Pairs

[EN] Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of context-sensitive rewriting (CSR), the dependency pair approach, one of the most powerful techniques for proving term...

Descripción completa

Detalles Bibliográficos
Autores: Alarcón, Beatriz, Gutiérrez Gil, Raúl|||0000-0002-3984-2868, Lucas Alba, Salvador|||0000-0001-9923-2108
Tipo de recurso: artículo
Fecha de publicación:2006
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/202263
Acceso en línea:https://riunet.upv.es/handle/10251/202263
Access Level:acceso abierto
Palabra clave:Dependency pairs
Term rewriting
Program analysis
Termination
LENGUAJES Y SISTEMAS INFORMATICOS
id ES_fd6a04ca69d8b89c001952ea8a95ec74
oai_identifier_str oai:riunet.upv.es:10251/202263
network_acronym_str ES
network_name_str España
repository_id_str
spelling Context-Sensitive Dependency PairsAlarcón, BeatrizGutiérrez Gil, Raúl|||0000-0002-3984-2868Lucas Alba, Salvador|||0000-0001-9923-2108Dependency pairsTerm rewritingProgram analysisTerminationLENGUAJES Y SISTEMAS INFORMATICOS[EN] Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of context-sensitive rewriting (CSR), the dependency pair approach, one of the most powerful techniques for proving termination of rewriting, has not been investigated in connection with proofs of termination of CSR. In this paper, we show how to use dependency pairs in proofs of termination of CSR. The implementation and practical use of the developed techniques yield a novel and powerful framework which improves the current state-of-the-art of methods for proving termination of CSR.This work has been partially supported by the EU (FEDER) and the Spanish MEC, under grant TIN 2004-7943-C04-02, the Generalitat Valenciana under grant GV06/285, and the ICT for EU-India Cross-Cultural Dissemination ALA/95/23/2003/077-054 project. Beatriz Alarcón was partially supported by the Spanish MEC under FPU grant AP2005-3399.Springer-VerlagDepartamento de Sistemas Informáticos y ComputaciónEscuela Politécnica Superior de AlcoyEscuela Técnica Superior de Ingeniería InformáticaInstituto Universitario Valenciano de Investigación en Inteligencia ArtificialEuropean CommissionGeneralitat ValencianaEuropean Regional Development FundMinisterio de Educación y CienciaMinisterio de Ciencia, Innovación y UniversidadesRepositorio Institucional de la Universitat Politècnica de València Riunet20062006-01-01journal articlehttp://purl.org/coar/resource_type/c_6501VoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleapplication/pdfapplication/pdfhttps://riunet.upv.es/handle/10251/202263reponame:RiuNet. Repositorio Institucional de la Universitat Politécnica de Valénciainstname:Universitat Politècnica de València (UPV)InglésengEuropean Commission https://doi.org/10.13039/501100000780 ALA%2F95%2F23%2F2003%2F077-054 Network for developing collaborations and exchanges between EU-Indian Universities, R&D Research Centres and SMEsGeneralitat Valenciana https://doi.org/10.13039/501100003359 GV 06%2F285 Formal techniques for Applied Software TechnologyMinisterio de Educación y Ciencia https://doi.org/10.13039/501100008743 TIN2004-7943-C04-02Ministerio de Ciencia, Innovación y Universidades https://doi.org/10.13039/100014440 Formación de Profesorado Universitario (FPU) AP2005-3399open 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/2022632026-06-13T07:49:27Z
dc.title.none.fl_str_mv Context-Sensitive Dependency Pairs
title Context-Sensitive Dependency Pairs
spellingShingle Context-Sensitive Dependency Pairs
Alarcón, Beatriz
Dependency pairs
Term rewriting
Program analysis
Termination
LENGUAJES Y SISTEMAS INFORMATICOS
title_short Context-Sensitive Dependency Pairs
title_full Context-Sensitive Dependency Pairs
title_fullStr Context-Sensitive Dependency Pairs
title_full_unstemmed Context-Sensitive Dependency Pairs
title_sort Context-Sensitive Dependency Pairs
dc.creator.none.fl_str_mv Alarcón, Beatriz
Gutiérrez Gil, Raúl|||0000-0002-3984-2868
Lucas Alba, Salvador|||0000-0001-9923-2108
author Alarcón, Beatriz
author_facet Alarcón, Beatriz
Gutiérrez Gil, Raúl|||0000-0002-3984-2868
Lucas Alba, Salvador|||0000-0001-9923-2108
author_role author
author2 Gutiérrez Gil, Raúl|||0000-0002-3984-2868
Lucas Alba, Salvador|||0000-0001-9923-2108
author2_role author
author
dc.contributor.none.fl_str_mv Departamento de Sistemas Informáticos y Computación
Escuela Politécnica Superior de Alcoy
Escuela Técnica Superior de Ingeniería Informática
Instituto Universitario Valenciano de Investigación en Inteligencia Artificial
European Commission
Generalitat Valenciana
European Regional Development Fund
Ministerio de Educación y Ciencia
Ministerio de Ciencia, Innovación y Universidades
Repositorio Institucional de la Universitat Politècnica de València Riunet
dc.subject.none.fl_str_mv Dependency pairs
Term rewriting
Program analysis
Termination
LENGUAJES Y SISTEMAS INFORMATICOS
topic Dependency pairs
Term rewriting
Program analysis
Termination
LENGUAJES Y SISTEMAS INFORMATICOS
description [EN] Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of context-sensitive rewriting (CSR), the dependency pair approach, one of the most powerful techniques for proving termination of rewriting, has not been investigated in connection with proofs of termination of CSR. In this paper, we show how to use dependency pairs in proofs of termination of CSR. The implementation and practical use of the developed techniques yield a novel and powerful framework which improves the current state-of-the-art of methods for proving termination of CSR.
publishDate 2006
dc.date.none.fl_str_mv 2006
2006-01-01
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://riunet.upv.es/handle/10251/202263
url https://riunet.upv.es/handle/10251/202263
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.relation.none.fl_str_mv European Commission https://doi.org/10.13039/501100000780 ALA%2F95%2F23%2F2003%2F077-054 Network for developing collaborations and exchanges between EU-Indian Universities, R&D Research Centres and SMEs
Generalitat Valenciana https://doi.org/10.13039/501100003359 GV 06%2F285 Formal techniques for Applied Software Technology
Ministerio de Educación y Ciencia https://doi.org/10.13039/501100008743 TIN2004-7943-C04-02
Ministerio de Ciencia, Innovación y Universidades https://doi.org/10.13039/100014440 Formación de Profesorado Universitario (FPU) AP2005-3399
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
publisher.none.fl_str_mv Springer-Verlag
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_ 1869425537278017536
score 15,300724

Similares en LA Referencia