On path analysis for test-case generation

Date

1974

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

In this thesis we give a method for constructing a directed graph from a computer program, written in Fortran, for the purpose of test-case analysis. An algorithm is presented for finding (i) all paths through the graph G from the entry to the exit node by eliminating nodes of the graph according to the increasing order of the in-degrees of the nodes; (ii) a subset of the set of all paths which contains every edge of the graph at least once ; (iii) the shortest and longest path through graph G. Each of the above algorithms was implemented by a computer program written in Fortran. Various alternatives for handling the astronomical number of paths one encounters in larger programs are then discussed.

Description

Keywords

Citation