Communication Dans Un Congrès Année : 2026

Certifying the Decidability of the Word Problem in Monoids at Large

Résumé

While the word problem for monoids is undecidable in general, having a decision procedure for some finitely presented monoid of interest has numerous applications. This paper presents a toolbox for the Rocq proof assistant that can be used to verify the decidability of the word problem for a given monoid and, in some cases, to produce the corresponding decision procedure. As this verification can be computationally intensive, the toolbox heavily relies on proofs by reflection guided by an external oracle. This approach has been successfully used on several large presentations from the literature, as well as on a database of one million 1-relation monoids.

The huge size of this database forced some unusual considerations onto the Rocq formalization, so that the formal proofs could be checked in a reasonable amount of time.

Fichier principal
Vignette du fichier
poplws26cppmain-p94-p-93771e7ce7-165368-final.pdf (726.56 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-05448783 , version 1 (08-01-2026)

Licence

Identifiants

Citer

Reinis Cirpons, Florent Hivert, Assia Mahboubi, Guillaume Melquiond, James D Mitchell, et al.. Certifying the Decidability of the Word Problem in Monoids at Large. CPP 2026 - 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2026, Rennes, France. pp.128-142, ⟨10.1145/3779031.3779101⟩. ⟨hal-05448783⟩
1698 Consultations
270 Téléchargements

Altmetric

Partager

  • More