Partial Models and Weak Equivalence

被引：0

作者：

Bonifacio, Adilson Luiz ^{[1
]}

Moura, Arnaldo Vieira ^{[2
]}

机构：

[1] Univ Londrina, Dept Comp, Londrina, Brazil

[2] Univ Estadual Campinas, Comp Inst, Campinas, SP, Brazil

来源：

THEORETICAL ASPECTS OF COMPUTING - ICTAC 2014 | 2014年 / 8687卷

关键词：

test suite completeness; partial models; weak equivalence; confirmed sets; CHECKING SEQUENCES; LENGTH;

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

One of the important tasks in model-based testing is checking completeness of test suites. In this paper we first extend some known sufficient conditions for test suite completeness by also allowing partial implementations. We also study a new notion of equivalence, and show that the same conditions are still sufficient when treating complete implementations. But when we also allow for partial implementations under this new notion of equivalence such conditions are not sufficient anymore for the completeness of test suites.

引用

页码：80 / 96

页数：17

共 12 条

[1]

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

[2] MODEL PARTITIONS AND COMPACT TEST CASE SUITES [J].