Article thumbnail

On Two Problems in the Generation of Program Test Paths ; CU-CS-081-75

By Harold N Gabow, Sachindra N Maheshwari and Leon J Osterweil

Abstract

In this paper we analyze the complexity of algorithms for two problems that arise in automatic test path generation for programs: the problem of building a path through a specified set of flow graph nodes and the problem of building a path which satisfies impossible-pairs restrictions in a flow graph. We give a highly efficient algorithm for the first problem, and show that the second problem is NO-complete in the sense of Cook and Karp

Publisher: CU Scholar
Year: 1975
OAI identifier: oai:scholar.colorado.edu:csci_techreports-1078

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.