Lower bounds on lengths of checking sequences

被引：11

作者：

Jourdan, Guy-Vincent ^{[1
]}

Ural, Hasan ^{[1
]}

Yeniguen, Huesnue ^{[2
]}

Zhang, Ji Chao ^{[1
]}

机构：

[1] Univ Ottawa, SITE, Ottawa, ON K1N 6N5, Canada

[2] Sabanci Univ, FENS, TR-34956 Istanbul, Turkey

来源：

FORMAL ASPECTS OF COMPUTING | 2010年 / 22卷 / 06期

基金：

加拿大自然科学与工程研究理事会;

关键词：

Testing; Model-based testing; Finite state machines; Fault detection; Checking sequence construction; Distinguishing sequences; FORMAL VERIFICATION; GENERATION; DESIGN;

D O I：

10.1007/s00165-009-0135-6

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

Lower bounds on the lengths of checking sequences constructed for testing from Finite State Machine-based specifications are established. These bounds consider the case where a distinguishing sequence is used in forming state recognition and transition verification subsequences and identify the effects of overlapping among such subsequences. Empirical results show that the existing methods for construction of checking sequences provide checking sequences with lengths that are within acceptable distance to these lower bounds.

引用

页码：667 / 679

页数：13

共 36 条

[1]

ADLAHO AV, 1991, IEEE T Comm, V39, P1604

[2]

[Anonymous], 1964, 5 ANN S SWITCH CIRC, DOI DOI 10.1109/SWCT.1964.8

[3]

BARNETT M, 2003, SPRINGER VERLAG LECT, V2931, P252

[4]

Binder RV., 1999, Testing Object-Oriented Systems: Models, Patterns, and Tools