Mostrar el registro sencillo del ítem
dc.contributor.author | Lucas Alba, Salvador![]() |
es_ES |
dc.contributor.author | Vítores-Vicente, Miguel![]() |
es_ES |
dc.contributor.author | Gutiérrez Gil, Raúl![]() |
es_ES |
dc.date.accessioned | 2023-07-11T18:01:37Z | |
dc.date.available | 2023-07-11T18:01:37Z | |
dc.date.issued | 2022-04 | es_ES |
dc.identifier.issn | 2352-2208 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/194829 | |
dc.description.abstract | [EN] Context-sensitive rewriting is a restriction of term rewriting where reductions are allowed on specific arguments of function symbols only, and then in particular positions of terms. Confluence is an abstract property of reduction relations guaranteeing that two diverging reduction sequences can always be joined into a common reduct. In this paper we investigate confluence of context-sensitive rewriting and present some novel results. In particular, a characterization of local confluence of context-sensitive rewriting as the joinability of an extended class of critical pairs which we introduce here. We also show that the treatment of joinability of critical pairs using theorem proving and solving feasibility problems is useful to automatically prove and disprove confluence of context-sensitive rewriting. Our techniques have been implemented in a new tool, CONFident. We show by means of benchmarks the impact of the new techniques discussed in the paper. | es_ES |
dc.description.sponsorship | Partially supported by grant RTI2018-094403-B-C32 funded by MCIN/AEI/10.13039/501100011033 and by "ERDF A way of making Europe", and PROMETEO/2019/098 | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | Elsevier | es_ES |
dc.relation.ispartof | Journal of Logical and Algebraic Methods in Programming | es_ES |
dc.rights | Reconocimiento - No comercial - Sin obra derivada (by-nc-nd) | es_ES |
dc.subject | Confluence | es_ES |
dc.subject | Context-sensitive rewriting | es_ES |
dc.subject | Program analysis | es_ES |
dc.subject.classification | LENGUAJES Y SISTEMAS INFORMATICOS | es_ES |
dc.title | Proving and disproving confluence of context-sensitive rewriting | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1016/j.jlamp.2022.100749 | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/GVA//PROMETEO%2F2019%2F098//DEEPTRUST/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI//RTI2018-094403-B-C32-AR//RAZONAMIENTO FORMAL PARA TECNOLOGIAS FACILITADORAS Y EMERGENTES/ | es_ES |
dc.relation.projectID | info:eu-repo/grantAgreement/AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/RTI2018-094403-B-C32/ES/RAZONAMIENTO FORMAL PARA TECNOLOGIAS FACILITADORAS Y EMERGENTES/ | |
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.description.bibliographicCitation | Lucas Alba, S.; Vítores-Vicente, M.; Gutiérrez Gil, R. (2022). Proving and disproving confluence of context-sensitive rewriting. Journal of Logical and Algebraic Methods in Programming. 126:1-20. https://doi.org/10.1016/j.jlamp.2022.100749 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | https://doi.org/10.1016/j.jlamp.2022.100749 | es_ES |
dc.description.upvformatpinicio | 1 | es_ES |
dc.description.upvformatpfin | 20 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 126 | es_ES |
dc.relation.pasarela | S\453330 | es_ES |
dc.contributor.funder | GENERALITAT VALENCIANA | es_ES |
dc.contributor.funder | AGENCIA ESTATAL DE INVESTIGACION | es_ES |
dc.contributor.funder | European Regional Development Fund | es_ES |
dc.contributor.funder | Universitat Politècnica de València |