Skip to Main content Skip to Navigation
New interface
Conference papers

Parallelizing Heuristics for Generating Synchronizing Sequences

Abstract : Synchronizing sequences are used in the context of finite state machine based testing in order to initialize an implementation to a particular state. The cubic complexity of even the fastest heuristic algorithms known in the literature to construct a synchronizing sequence can be a problem in practice. In order to scale the performance of synchronizing heuristics, some algorithmic improvements together with a parallel implementation of these heuristics are proposed in this paper. An experimental study is also presented which shows that the improved/parallel implementation can yield a considerable speedup over the sequential implementation.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, November 21, 2017 - 3:52:58 PM
Last modification on : Tuesday, November 21, 2017 - 3:56:00 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Sertaç Karahoda, Osman Tufan Erenay, Kamer Kaya, Uraz Cengiz Türker, Husnu Yenigun. Parallelizing Heuristics for Generating Synchronizing Sequences. 28th IFIP International Conference on Testing Software and Systems (ICTSS), Oct 2016, Graz, Austria. pp.106-122, ⟨10.1007/978-3-319-47443-4_7⟩. ⟨hal-01643717⟩



Record views


Files downloads