Title :
Nontraversible Paths in a Program
Author :
Chellappa, Mallika
Author_Institution :
Flight Control Systems Division, Aeronautical Development Establishment
fDate :
6/1/1987 12:00:00 AM
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;
Journal_Title :
Software Engineering, IEEE Transactions on
DOI :
10.1109/TSE.1987.233480
