Counting Paths in Computer Programs

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1988
Accession Number
ADA199333

Entities

People

  • B. D. Bramson

Organizations

  • Royal Signals and Radar Establishment

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Analyzers
  • Computer Programming
  • Computer Programs
  • Computers
  • Contracts
  • Graph Theory
  • Identities
  • Language
  • Polynomials
  • Procurement
  • Sequences
  • Specifications
  • Standards
  • Verification

Readers

  • Computational Linguistics
  • Computer Networking
  • Systems Analysis and Design