CONFident: una herramienta para el análisis de la confluencia de sistemas de reescritura

[ES] CONFident es una herramienta que demuestra la confluencia, una de las propiedades más importantes en el análisis de sistemas de reescritura. Para ello hace uso de algunas herramientas como infChecker o mu-term. Por ejemplo, infChecker es crucial para demostrar la asociabilidad de pares críticos y la viabilidad de condiciones en CTRSs, entre otras tareas; mu-term es la herramienta que demuestra la terminación. La terminación tiene gran importancia en sistemas de reescritura. CONFident es compatible con diversos tipos de sistemas, como pueden ser los TRSs, CS-TRSs y CTRSs de tipo JOIN, ORIENTED y SEMI-EQUATIONAL. Ha quedado demostrado que los problemas más apropiados para CONFident son los de tipo CTRS para los cuales ha obtenido unos resultados competitivos.[EN] CONFident is a tool that proves confluence, one of the most important properties in rewriting systems’ analysis. For this purpose it makes use of some tools such as infChecker or mu-term. For instance, infChecker is crucial for proving joinability of critical pairs and feasibility of conditions in CTRSs, among other tasks; mu-term is the termination prover. Termination plays an important role in rewrite systems. CONFident supports several types of systems, including TRSs, CS-TRSs and JOIN, ORIENTED and SEMI-EQUATIONAL CTRSs. Specifically for CTRSs, CONFident has obtained very good results.Vítores Vicente, M. (2022). CONFident: una herramienta para el análisis de la confluencia de sistemas de reescritura. Universitat Politècnica de València. http://hdl.handle.net/10251/182291TFG

Proving and disproving confluence of context-sensitive rewriting

[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.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/098Lucas 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.10074912012

Book of Abstracts. V International Workshop on Proximity Data, Multivariate Analysis and Classification

Abstracts of the V International Workshop on Proximity Data, Multivariate Analysis and Classification. July 11-12, 2023 (Valladolid, Spain)