Nontraversible Paths in a Program

  • Authors:

  • Mallika Chellappa

  • Affiliations:

  • Aeronautical Development Establishment, Bangalore, India

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1987

Quantified Score

Hi-index 0.00

Visualization

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.