Specification and Validation of Algorithms Generating Planar Lehman Words
Résumé
This paper presents specifications and implementations of algorithms for the generation of planar
Lehman words (that is, A. B. Lehman's code for rooted planar maps), together with their validation.
The focus is on computer assistance for the task of validation of an implementation with respect to
a different implementation or a formal specification. The paper also provides some combinatorial
results that are, to our knowledge, new.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...