Lookahead-Based Approaches for Minimizing Adaptive Distinguishing Sequences - Testing Software and Systems Access content directly
Conference Papers Year : 2014

Lookahead-Based Approaches for Minimizing Adaptive Distinguishing Sequences

Uraz Cengiz Türker
  • Function : Author
  • PersonId : 994793
Tonguç Ünlüyurt
  • Function : Author
  • PersonId : 994794
Hüsnü Yenigün
  • Function : Author
  • PersonId : 994795

Abstract

For Finite State Machine (FSM) based testing, it has been shown that the use of shorter Adaptive Distinguishing Sequences (ads) yields shorter test sequences. It is also known, on the other hand, that constructing a minimum cost ADS is an NP-hard problem and it is NP-hard to approximate. In this paper, we introduce a lookahead-based greedy algorithm to construct reduced ADSs for FSMs. The greedy algorithm inspects a search space to make a decision. The size of the search space is adjustable, allowing a trade-off between the quality and the computation time. We analyse the performance of the approach on randomly generated FSMs by comparing the ADSs constructed by our algorithm with the ADSs that are computed by the existing algorithms.
Fichier principal
Vignette du fichier
978-3-662-44857-1_3_Chapter.pdf (443.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01405273 , version 1 (29-11-2016)

Licence

Attribution

Identifiers

Cite

Uraz Cengiz Türker, Tonguç Ünlüyurt, Hüsnü Yenigün. Lookahead-Based Approaches for Minimizing Adaptive Distinguishing Sequences. 26th IFIP International Conference on Testing Software and Systems (ICTSS), Sep 2014, Madrid, Spain. pp.32-47, ⟨10.1007/978-3-662-44857-1_3⟩. ⟨hal-01405273⟩
65 View
78 Download

Altmetric

Share

Gmail Facebook X LinkedIn More