On structured digraphs and program testing

Authors:
Simeon C. Ntafos;S. Louis Hakimi
Affiliations:
Department of Mathematical Sciences, University of Texas at Dallas, Richardson, TX;Department of Electrical Engineering and Computer SCience, Northwestern University, Evanston, IL
Venue:
IEEE Transactions on Computers
Year:
1981

Citing 5
Cited 0

Flow diagrams, turing machines and languages with only two formation rules

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Chapter I: Notes on structured programming

Structured programming
On Two Problems in the Generation of Program Test Paths

IEEE Transactions on Software Engineering
On Path Cover Problems in Digraphs and Applications to Program Testing

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	14.98

Visualization

Abstract

In this paper certain graph theoretic problems dealing with the testing of structured programs are treated. A structured digraph is a digraph that represents a structured program. A labeling procedure which characterizes structured digraphs is described. An efficient algorithm for finding a minimum path cover for the vertices of digraphs that belong to an important family of structured digraphs is given. To model interactions among code segments the notions of "required pairs" and "must pairs" are introduced and the corresponding constrained path cover problems are shown to be NP-complete, even for acyclic structured digraphs.