Nontraversible Paths in a Program

@article{Chellappa1987NontraversiblePI,
  title={Nontraversible Paths in a Program},
  author={Morimoto P. Burlina R. Chellappa},
  journal={IEEE Transactions on Software Engineering},
  year={1987},
  volume={SE-13},
  pages={751-756}
}
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. 

Citations

Publications citing this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…