Specification and Validation of Algorithms Generating Planar Lehman Words - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Specification and Validation of Algorithms Generating Planar Lehman Words

Abstract

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.
Fichier principal
Vignette du fichier
GS12.pdf (293.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00753008 , version 1 (21-07-2015)

Identifiers

  • HAL Id : hal-00753008 , version 1

Cite

Alain Giorgetti, Valerio Senni. Specification and Validation of Algorithms Generating Planar Lehman Words. GASCom 2012 - 8th International Conference on random generation of combinatorial structures, Jun 2012, Bordeaux, France. ⟨hal-00753008⟩
645 View
95 Download

Share

Gmail Facebook Twitter LinkedIn More