Accession Number:

ADA199333

Title:

Counting Paths in Computer Programs

Descriptive Note:

Memorandum rept.

Corporate Author:

ROYAL SIGNALS AND RADAR ESTABLISHMENT MALVERN (UNITED KINGDOM)

Personal Author(s):

Report Date:

1988-05-01

Pagination or Media Count:

8.0

Abstract:

An algebraic method is presented for assessing the numbers of paths through loop-free portions of computer programs, thus providing a useful measure of complexity. The underlying program model is that of a directed graph, though this does not exclude recursion. The algebraic structure is that of a path algebra but with one axiom relaxed. The theory has been implemented within the Malvern Program Analysis Suite MALPAS. Experience has shown it to be of particular value in guiding the analysis of large programs.

Subject Categories:

  • Computer Programming and Software
  • Active and Passive Radar Detection and Equipment

Distribution Statement:

APPROVED FOR PUBLIC RELEASE