Skip to Main content Skip to Navigation
Conference papers

Specification and Validation of Algorithms Generating Planar Lehman Words

Alain Giorgetti 1, 2 Valerio Senni 3
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
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.
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/hal-00753008
Contributor : Alain Giorgetti <>
Submitted on : Tuesday, July 21, 2015 - 2:58:52 PM
Last modification on : Thursday, November 12, 2020 - 9:42:08 AM
Long-term archiving on: : Thursday, October 22, 2015 - 10:13:44 AM

File

GS12.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00753008, version 1

Citation

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⟩

Share

Metrics

Record views

911

Files downloads

272