On the Number of Tests Necessary to Verify a Computer Program.

Abstract

This report discusses the use of flowchart graphs, adjacency matrices, and zero-one linear programming to find the minimum number of tests necessary to execute every segment of a computer program at least once. The methods of Lipow are used as the basis for determining the maximum incomparable set, i.e., the largest set of program segments through which one and only one test case should pass. The size of the maximum incomparable set gives the minimum number of tests necessary to execute each segment at least once, while the elements of this set give the paths of each test. The report develops methods for finding the maximum incomparable set for loopless and some elementary looping flowcharts. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1978
Accession Number
ADA065004

Entities

People

  • G. S. Popkin
  • M. L. Shooman

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Decomposition
  • Integer Programming
  • Linear Programming
  • New York
  • Procedures (Computers)
  • Standards
  • Structured Programming
  • Terminals
  • Triangles
  • Two Dimensional

Readers

  • Computer Science.
  • Graph Algorithms and Convex Optimization.