Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0950-5849(94)90033-7 | Information and Software Technology |
Keywords | Field | DocType |
formal specifications,completeness,complete theories,types of incompleteness,sources of incompleteness | Data mining,Software engineering,Computer science,Algorithm,Formal specification,Software,Completeness (statistics) | Journal |
Volume | Issue | ISSN |
36 | 6 | 0950-5849 |
Citations | PageRank | References |
5 | 0.46 | 7 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| V.S. Alagar | 1 | 5 | 0.46 |
| D Kourkopoulos | 2 | 5 | 0.46 |