DocumentCode :
1084228
Title :
Completeness and consistency in hierarchical state-based requirements
Author :
Heimdahl, Mats P E ; Leveson, Nancy G.
Author_Institution :
Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA
Volume :
22
Issue :
6
fYear :
1996
fDate :
6/1/1996 12:00:00 AM
Firstpage :
363
Lastpage :
377
Abstract :
This paper describes methods for automatically analyzing formal, state-based requirements specifications for some aspects of 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, collision-avoidance system required on all commercial aircraft with more than 30 passengers that fly in U.S. Airspace
Keywords :
formal specification; program diagnostics; reachability analysis; TCAS II; abstraction; completeness; complex airborne collision-avoidance system; consistency; formal methods; formal semantics; formal state-based requirements specifications; hierarchical state-based requirements; low-level functional formalism; reachability graph; reactive systems; state-based requirements; state-space explosion problems; static analysis; Aircraft; Algorithm design and analysis; Computer science; Error correction; Explosions; Performance analysis; Robustness; Software safety; Software systems; Timing;
fLanguage :
English
Journal_Title :
Software Engineering, IEEE Transactions on
Publisher :
ieee
ISSN :
0098-5589
Type :
jour
DOI :
10.1109/32.508311
Filename :
508311
Link To Document :
بازگشت