(IN)COMPLETENESS IN SPECIFICATIONS

被引:5
作者
ALAGAR, VS
KOURKOPOULOS, D
机构
[1] Department of Computer Science, Concordia University, West Montreal, Que. H3G 1M8
关键词
FORMAL SPECIFICATIONS; COMPLETENESS; COMPLETE THEORIES; TYPES OF INCOMPLETENESS; SOURCES OF INCOMPLETENESS;
D O I
10.1016/0950-5849(94)90033-7
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Completeness is usually listed as a desirable attribute of specifications; incompleteness, as a reason for the failure of software to satisfy its intended requirements. Unfortunately, these terms are rarely given anything but intuitive definitions, making it unclear how to achieve the former, or alternatively, avoid the latter. This article examines the notion of (in)completeness in specifications from a number of perspectives, and then introduces a pragmatic definition of incompleteness: a classification based on its potential sources. From this, it observes that completeness, though needed to properly, reason about, and capture the behaviour of, the system, is undesirable in some cases.
引用
收藏
页码:331 / 342
页数:12
相关论文
共 19 条
[1]   A LOGIC COVERING UNDEFINEDNESS IN PROGRAM PROOFS [J].
BARRINGER, H ;
CHENG, JH ;
JONES, CB .
ACTA INFORMATICA, 1984, 21 (03) :251-269
[2]  
BARWISE J, 1978, ACTA INFORM, V10, P27
[3]   UNDERSTANDING AND CONTROLLING SOFTWARE COSTS [J].
BOEHM, BW ;
PAPACCIO, PN .
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 1988, 14 (10) :1462-1477
[5]  
COHEN B, 1986, SPECIFICATION COMPLE
[6]  
FAIRLEY RE, 1985, SOFTWARE ENG CONCEPT
[7]  
GINSBERG I, 1988, READINGS NONMONOTONI
[8]   REASONING ABOUT ACTION .1. A POSSIBLE WORLDS APPROACH [J].
GINSBERG, ML ;
SMITH, DE .
ARTIFICIAL INTELLIGENCE, 1988, 35 (02) :165-195
[9]  
HANKS S, 1980, ARTIF INTELL, V13, P379
[10]  
Hobbs J. R., 1985, FORMAL THEORIES COMM