Completeness and Consistency Analysis of State-Based Requirements (1995)
| Venue: | IEEE Transactions on Software Engineering |
| Citations: | 58 - 9 self |
BibTeX
@INPROCEEDINGS{Heimdahl95completenessand,
author = {Mats P. E. Heimdahl and Nancy G. Leveson},
title = {Completeness and Consistency Analysis of State-Based Requirements},
booktitle = {IEEE Transactions on Software Engineering},
year = {1995},
pages = {3--14}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper describes methods for automatically analyzing formal, state-based requirements specifications for completeness and consistency. The approach uses a low-level functional formalism, simplifying the analysis process. State space explosion problems are eliminated by applying the analysis at a high level of abstraction; i.e, instead of generating a reachability graph for analysis, the analysis is performed directly on the model. The method scales up to large systems by decomposing the specification into smaller, analyzable parts and then using functional composition rules to ensure that verified properties hold for the entire specification. The analysis algorithms and tools have been validated on TCAS II, a complex, airborne, collisionavoidance system required on all commercial aircraft with more than 30 passengers that fly in U.S. airspace. 1 Introduction This paper describes methods and tools for automatically analyzing software requirements for completeness and consistency. C...
