Mostrar el registro sencillo del ítem
dc.contributor.author | Gutiérrez Gil, Raúl | es_ES |
dc.contributor.author | Lucas Alba, Salvador | es_ES |
dc.contributor.author | Urbain, Xavier | es_ES |
dc.date.accessioned | 2024-01-31T19:02:39Z | |
dc.date.available | 2024-01-31T19:02:39Z | |
dc.date.issued | 2008 | es_ES |
dc.identifier.issn | 0302-9743 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/202271 | |
dc.description.abstract | [EN] Recently, the dependency pairs (DP) approach has been generalized to context-sensitive rewriting (CSR). Although the context-sensitive dependency pairs (CS-DP) approach provides a very good basis for proving termination of CSR, the current developments basically correspond to a ten-years-old DP approach. Thus, the task of adapting all recently introduced dependency pairs techniques to get a more powerful approach becomes an important issue. In this direction, usable rules are one of the most interesting and powerful notions. Actually usable rule have been investigated in connection with proofs of innermost termination of CSR. However, the existing results apply to a quite restricted class of systems. In this paper, we introduce a notion of usable rules that can be used in proofs of termination of CSR with arbitrary systems. Our benchmarks show that the performance of the CS-DP approach is much better when such usable rules are considered in proofs of termination of CSR. | es_ES |
dc.description.sponsorship | Work partially supported by the EU (FEDER) and the Spanish MEC, under grants TIN 2004-7943-C04-02, TIN 2007-68118-C02 and HA 2006-0007. | 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 | Termination | es_ES |
dc.subject.classification | LENGUAJES Y SISTEMAS INFORMATICOS | es_ES |
dc.title | Usable Rules for Context-Sensitive Rewrite Systems | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1007/978-3-540-70590-1_9 | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/MEC//TIN2004-7943-C04-02/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/MEC//TIN2007-68118-C02/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/MEC//HA 2006-0007/ | 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 | Gutiérrez Gil, R.; Lucas Alba, S.; Urbain, X. (2008). Usable Rules for Context-Sensitive Rewrite Systems. Lecture Notes in Computer Science. 5117:126-141. https://doi.org/10.1007/978-3-540-70590-1_9 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | http://dx.doi.org/10.1007/978-3-540-70590-1_9 | es_ES |
dc.description.upvformatpinicio | 126 | es_ES |
dc.description.upvformatpfin | 141 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 5117 | es_ES |
dc.relation.pasarela | S\34405 | es_ES |
dc.contributor.funder | European Regional Development Fund | es_ES |
dc.contributor.funder | Ministerio de Educación y Ciencia | es_ES |