Using adaptive distinguishing sequences in checking sequence constructions

Hierons, Robert M. and Jourdan, Guy-Vincent and Ural, Hasan and Yenigün, Hüsnü (2008) Using adaptive distinguishing sequences in checking sequence constructions. In: Proceedings of ACM Symposium on Applied Computing, Fortaleza, Ceara, Brazil

This is the latest version of this item.

Full text not available from this repository.

Official URL: http://doi.acm.org/10.1145/1363686.1363850

Abstract

A number of methods have been published to construct checking sequences for testing from Finite State Machine-based specifications. Many of these methods require the existence of a preset distinguishing sequence in the model. In this paper, we show that usually an adaptive distinguishing sequence is sufficient for these methods to work. This result is significant because adaptive distinguishing sequences are strictly more common and up to exponentially shorter than preset ones.

Item Type:	Papers in Conference Proceedings
Subjects:	Q Science > QA Mathematics > QA075 Electronic computers. Computer science Q Science > QA Mathematics > QA076 Computer software
ID Code:	7547
Deposited By:	Hüsnü Yenigün
Deposited On:	13 Dec 1901 22
Last Modified:	08 Oct 2008 00:23

Available Versions of this Item

Using Adaptive Distinguishing Sequences in Checking Sequence Constructions. (deposited 31 Oct 2007 09:36)
- Using adaptive distinguishing sequences in checking sequence constructions. (deposited 13 Dec 1901 22) [Currently Displayed]

Repository Staff Only: item control page