Mostrar el registro sencillo del ítem
dc.contributor.author | Alarcón, Beatriz | es_ES |
dc.contributor.author | Gutiérrez Gil, Raúl | es_ES |
dc.contributor.author | Lucas Alba, Salvador | es_ES |
dc.date.accessioned | 2024-01-31T19:02:12Z | |
dc.date.available | 2024-01-31T19:02:12Z | |
dc.date.issued | 2006 | es_ES |
dc.identifier.issn | 0302-9743 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/202263 | |
dc.description.abstract | [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. | es_ES |
dc.description.sponsorship | 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. | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | Springer-Verlag | es_ES |
dc.relation.ispartof | Lecture Notes in Computer Science | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject | Dependency pairs | es_ES |
dc.subject | Term rewriting | es_ES |
dc.subject | Program analysis | es_ES |
dc.subject | Termination | es_ES |
dc.subject.classification | LENGUAJES Y SISTEMAS INFORMATICOS | es_ES |
dc.title | Context-Sensitive Dependency Pairs | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1007/11944836_28 | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/EC//ALA%2F95%2F23%2F2003%2F077-054//Network for developing collaborations and exchanges between EU-Indian Universities, R&D Research Centres and SMEs/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/GVA//GV 06%2F285//Formal techniques for Applied Software Technology/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/MEC//TIN2004-7943-C04-02/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/MCIU//AP2005-3399//Ayudas para la formación de Profesorado Universitario (FPU)/ | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Escola Tècnica Superior d'Enginyeria Informàtica | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Escuela Politécnica Superior de Alcoy - Escola Politècnica Superior d'Alcoi | es_ES |
dc.description.bibliographicCitation | Alarcón, B.; Gutiérrez Gil, R.; Lucas Alba, S. (2006). Context-Sensitive Dependency Pairs. Lecture Notes in Computer Science. 4337:297-308. https://doi.org/10.1007/11944836_28 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | https://doi.org/10.1007/11944836_28 | es_ES |
dc.description.upvformatpinicio | 297 | es_ES |
dc.description.upvformatpfin | 308 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 4337 | es_ES |
dc.relation.pasarela | S\30931 | es_ES |
dc.contributor.funder | European Commission | es_ES |
dc.contributor.funder | Generalitat Valenciana | es_ES |
dc.contributor.funder | European Regional Development Fund | es_ES |
dc.contributor.funder | Ministerio de Educación y Ciencia | es_ES |
dc.contributor.funder | Ministerio de Ciencia, Innovación y Universidades | es_ES |