most citedFormalizing Factorization on Euclidean Domains and Abstract Euclidean Algorithms

2 citations · 2 across the 2 of their papers we have counts for

collaborators
Showing cs.LOShow all

2 papers · 1 filter

cs.LO2026

Anti-Unification Completeness Analysis in PVS

Mauricio Ayala-Rincón, Thaynara Arielly de Lima, Maria Júlia Dias Lima +2

In syntactic anti-unification, one is concerned with finding the commonalities between terms, while (uniformly) abstracting their differences. The original goal of anti-unification…

cs.LO2024★ 2 cited

Formalizing Factorization on Euclidean Domains and Abstract Euclidean Algorithms

Thaynara Arielly de Lima, Andréia Borges Avelar, André Luiz Galdino +1

This paper discusses the extension of the Prototype Verification System (PVS) sub-theory for rings, part of the PVS algebra theory, with theorems related to the division algorithm…