MOCKINGBIRD - A LOGICAL METHODOLOGY FOR TESTING

被引：8

作者：

GORLICK, MM ^{[1
]}

KESSELMAN, CF ^{[1
]}

MAROTTA, DA ^{[1
]}

PARKER, DS ^{[1
]}

机构：

[1] AEROSPACE CORP, COMP SCI LAB, LOS ANGELES, CA 90009 USA

来源：

JOURNAL OF LOGIC PROGRAMMING | 1990年 / 8卷 / 1-2期

关键词：

D O I：

10.1016/0743-1066(90)90053-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Mockingbird is a testing methodology founded on a formal specification of the test space. The specification is executable and bidirectional. When run in one direction it acts as a generator, producing tests whose properties conform to the specification. When run in the opposite direction it acts as an acceptor, validating tests against the specification. The specification language is a combination of context-free grammars and constraint systems. The semantics of the specification are based on constraint logic programming. This paper describes the philosophy, design, and implementation of Mockingbird and its use in testing a large, complex system. © 1990.

引用

页码：95 / 119

页数：25

共 40 条

[1]

Abramson H., 1984, 1984 International Symposium on Logic Programming (cat. no. 84CH2007-3), P233

[2]

[Anonymous], 1986, ART PROLOG ADV PROGR

[3] AN AUTOMATIC GENERATOR FOR COMPILER TESTING [J].

BAZZICHI, F ;

SPADAFORA, I .

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1982, 8 (04) :343-353

[4] AUTOMATIC-GENERATION OF RANDOM SELF-CHECKING TEST CASES [J].

BIRD, DL ;

MUNOZ, CU .

IBM SYSTEMS JOURNAL, 1983, 22 (03) :229-245

[5]

BOCHMANN GV, 1986, PROTOCOL SPECIFICATI, V5, P131

[6] GENERATING TEST PROGRAMS FROM SYNTAX [J].

BURKHARDT, WH .

COMPUTING, 1967, 2 (01) :53-+

[7] COMPILER TESTING USING A SENTENCE GENERATOR [J].

CELENTANO, A ;

CRESPIREGHIZZI, S ;

DELLAVIGNA, P ;

GHEZZI, C ;

GRANATA, G ;

SAVORETTI, F .

SOFTWARE-PRACTICE & EXPERIENCE, 1980, 10 (11) :897-918

[8]

Clocksin W. F., 1984, PROGRAMMING PROLOG

[9]

COLMERAUER A, 1978, LECTURE NOTES COMPUT, V63

[10]

DAVIS RE, 1982, LOGIC PROGRAMM, P141

← 1 2 3 4 →