Observations of Fallibility in Applications of Modern Programming Methodologies

  • Authors:

  • S. L. Gerhart;L. Yelowitz

  • Affiliations:

  • Department of Computer Science, Duke University;-

  • Venue:
  • IEEE Transactions on Software Engineering
  • Year:
  • 1976

Quantified Score

Hi-index 0.00

Visualization

Abstract

Errors, inconsistencies, or confusing points are noted in a variety of published algorithms, many of which are being used as examples in formulating or teaching principles of such modern programming methodologies as formal specification, systematic construction, and correctness proving. Common properties of these points of contention are abstracted. These properties are then used to pinpoint possible causes of the errors and to formulate general guidelines which might help to avoid further errors. The common characteristic of mathematical rigor and reasoning in these examples is noted, leading to some discussion about fallibility in mathematics, and its relationship to fallibility in these programming methodologies. The overriding goal is to cast a more realistic perspective on the methodologies, particularly with respect to older methodologies, such as testing, and to provide constructive recommendations for their improvement.