A Mechanised Proof of an Adaptive State Counting Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

A Mechanised Proof of an Adaptive State Counting Algorithm

Robert Sachtleben
  • Function : Author
  • PersonId : 1067243
Robert M. Hierons
  • Function : Author
  • PersonId : 1067244
Wen-Ling Huang
  • Function : Author
  • PersonId : 1067245
Jan Peleska
  • Function : Author
  • PersonId : 1067246


In this paper it is demonstrated that the capabilities of state-of-the-art proof assistant tools are sufficient to present mechanised and, at the same time, human-readable proofs establishing completeness properties of test methods and the correctness of associated test generation algorithms. To this end, the well-known Isabelle/HOL proof assistant is used to mechanically verify a complete test theory elaborated by the second author for checking the reduction conformance relation between a possibly nondeterministic finite state machine (FSM) serving as reference model and an implementation whose behaviour can also be represented by an FSM. The formalisation also helps to clarify an ambiguity in the original test generation algorithm which was specified in natural language and could be misinterpreted in a way leading to insufficient fault coverage.
Fichier principal
Vignette du fichier
482770_1_En_11_Chapter.pdf (406.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02526349 , version 1 (31-03-2020)





Robert Sachtleben, Robert M. Hierons, Wen-Ling Huang, Jan Peleska. A Mechanised Proof of an Adaptive State Counting Algorithm. 31th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2019, Paris, France. pp.176-193, ⟨10.1007/978-3-030-31280-0_11⟩. ⟨hal-02526349⟩
21 View
15 Download



Gmail Facebook Twitter LinkedIn More