DocumentCode
746699
Title
Nontraversible Paths in a Program
Author
Chellappa, Mallika
Author_Institution
Flight Control Systems Division, Aeronautical Development Establishment
Issue
6
fYear
1987
fDate
6/1/1987 12:00:00 AM
Firstpage
751
Lastpage
756
Abstract
A finite-state machine representation of a program graph is shown to have the property of exposing nontraversible paths in a program. A minimal covering set of paths for such a program may fail to yield realizable test cases, as the nontraversible paths have inconsistent path predicates.
Keywords
Directed graph; finite state machine; path analysis; path predicates; test case selection; test cover; Computer errors; Control systems; Flowcharts; Imaging phantoms; Performance evaluation; Testing; Directed graph; finite state machine; path analysis; path predicates; test case selection; test cover;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/TSE.1987.233480
Filename
1702280
Link To Document