RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación
Artículo científico (JournalArticle)
NuITP: Accelerating the inductive verification of equational programs through symbolic simplification
[EN] NuITP is an inductive theorem prover that combines advanced symbolic techniques such as narrowing, equality predicates, variant unification, variant satisfiability, order-sorted congruence closure, ordered rewriting, and strategy-based rewriting (all applied modulo axioms) to verify equational programs with expressive features such as sorts and subsorts, conditional equations and rewriting modulo axioms in Maude and in other equational languages. This paper presents the tool, explains its inference rules, and illustrates their use in proving several examples with substantial levels of automated proof simplification based on symbolic techniques., We cordially thank Claude Kirchner for his comments, which have helped us improve the paper. F. Duran has been partially supported by Spanish Government project PID2025-172454NB-I00. S. Escobar and J. Sapina have been partially supported by the grant CIPROM/2022/6 funded by Generalitat Valenciana and by the grant PID2024-162030OB-100 funded by MCIN/AEI/10.13039/501100011033 and ERDF A way of making Europe.