COMPUTATIONAL-COMPLEXITY OF TEST-GENERATION FOR ETG PLAS

被引：0

作者：

MIN, YH ^{[1
]}

MALAIYA, YK ^{[1
]}

GUPTA, B ^{[1
]}

机构：

[1] SO ILLINOIS UNIV,DEPT COMP SCI,CARBONDALE,IL 62901

来源：

IEE PROCEEDINGS-E COMPUTERS AND DIGITAL TECHNIQUES | 1989年 / 136卷 / 02期

关键词：

D O I：

10.1049/ip-e.1989.0016

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：107 / 111

页数：5

共 50 条

[1] Computational Complexity in Test-Generation Algorithms
Sziray, Jozsef
2014 9TH INTERNATIONAL DESIGN & TEST SYMPOSIUM (IDT), 2014, : 124 - 129
[2] PROBABILISTIC ANALYSIS OF ALGORITHMS FOR STUCK-AT TEST-GENERATION IN PLAS
FRANCO, J
LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1992, 174 : 56 - 75
[3] AN OVERVIEW OF COMPUTATIONAL-COMPLEXITY
COOK, SA
COMMUNICATIONS OF THE ACM, 1983, 26 (06) : 401 - 408
[4] AMORTIZED COMPUTATIONAL-COMPLEXITY
TARJAN, RE
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1985, 6 (02): : 306 - 318
[5] THE COMPUTATIONAL-COMPLEXITY OF ABDUCTION
BYLANDER, T
ALLEMANG, D
TANNER, MC
JOSEPHSON, JR
ARTIFICIAL INTELLIGENCE, 1991, 49 (1-3) : 25 - 60
[6] ON THE COMPUTATIONAL-COMPLEXITY OF BISIMULATION
MOLLER, F
SMOLKA, SA
ACM COMPUTING SURVEYS, 1995, 27 (02) : 287 - 289
[7] TEST-GENERATION
KARJALAINEN, J
MICROPROCESSING AND MICROPROGRAMMING, 1986, 18 (1-5): : 353 - 353
[8] 2 LOWER BOUNDS ON COMPUTATIONAL-COMPLEXITY OF INFINITE WORD GENERATION
HROMKOVIC, J
KARHUMAKI, J
INFORMATION PROCESSING '94, VOL I: TECHNOLOGY AND FOUNDATIONS, 1994, 51 : 479 - 484
[9] THE COMPUTATIONAL-COMPLEXITY OF WRITING SYSTEMS
SIMONS, GF
FIFTEENTH LACUS FORUM 1988, 1989, : 538 - 553
[10] ON THE COMPUTATIONAL-COMPLEXITY OF SMALL DESCRIPTIONS
GAVALDA, R
WATANABE, O
SIAM JOURNAL ON COMPUTING, 1993, 22 (06) : 1257 - 1275