An Executable Mechanised Formalisation of an Adaptive State Counting Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2020

An Executable Mechanised Formalisation of an Adaptive State Counting Algorithm

Résumé

This paper demonstrates the applicability of state-of-the-art proof assistant tools to establish completeness properties of a test strategy and the correctness of its associated test generation algorithms, as well as to generate trustworthy executable code for these algorithms. To this end, a variation of an established test strategy is considered, which generates adaptive test cases based on a reference model represented as a possibly nondeterministic finite state machine (FSM). These test cases are sufficient to check whether the reduction conformance relation holds between the reference model and an implementation whose behaviour can also be represented by an FSM. Both the mechanical verification of this test strategy and the generation of a provably correct implementation are performed using the well-known Isabelle/HOL proof assistant.
Fichier principal
Vignette du fichier
497758_1_En_15_Chapter.pdf (358.09 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03239826 , version 1 (27-05-2021)

Licence

Identifiants

Citer

Robert Sachtleben. An Executable Mechanised Formalisation of an Adaptive State Counting Algorithm. 32th IFIP International Conference on Testing Software and Systems (ICTSS), Dec 2020, Naples, Italy. pp.236-254, ⟨10.1007/978-3-030-64881-7_15⟩. ⟨hal-03239826⟩
44 Consultations
33 Téléchargements

Altmetric

Partager

More