The Correctness Proof of a Quadratic-Hash Algorithm

Abstract

The statements of a program do not always provide sufficient information for proving its correctness. The correctness of the algorithm implemented by the program must often be proved with the pure mathematical techniques or exhaustive enumeration. An example program is presented for which the correctness proof of the program is trivial provided that the correctness of the underlying algorithm can be demonstrated. The program can be viewed as an abstraction of a quadratic hash algorithm. It is used at the end of the paper to encode the algorithm most efficiently.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1975
Accession Number
ADA013112

Entities

People

  • A. N. Habermann

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Coefficients
  • Computations
  • Computer Programming
  • Decomposition
  • English Language
  • Iterations
  • Language
  • Native Americans
  • Numbers
  • Prime Numbers
  • Programming Languages
  • Scientific Research
  • Separators
  • Sequences

Fields of Study

  • Computer science

Readers

  • Mathematical Modeling and Probability Theory.
  • Operations Research