Skip to Main content Skip to Navigation
Conference papers

Adaptive Localizer Based on Splitting Trees

Abstract : When testing a black box system that cannot be reset, it may be useful to use a localizer procedure that will ensure that the test sequence goes at some point through a state that can be identified with a characterizing set of input sequences. In this paper, we propose a procedure that will localize when the separating sequences are organized in a splitting tree. Compared to previous localizing sequences based on characterization sets, using the tree structure one can define an adaptive localizer, and the complexity of localizing depends on the height of the tree instead of the number of states.
Complete list of metadata

Cited literature [5 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, January 9, 2018 - 3:42:10 PM
Last modification on : Friday, March 26, 2021 - 3:30:28 AM
Long-term archiving on: : Wednesday, May 23, 2018 - 5:40:42 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Roland Groz, Adenilso Simao, Catherine Oriat. Adaptive Localizer Based on Splitting Trees. 29th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2017, St. Petersburg, Russia. pp.326-332, ⟨10.1007/978-3-319-67549-7_21⟩. ⟨hal-01678983⟩



Record views


Files downloads