Inference rules for program annotation

Nachum Dershowitz, Zohar Manna

Research output: Contribution to journalConference articlepeer-review


Methods are presented whereby an Algol-like program, given together with its specifications, can be documented automatically. The program Is incrementally annotated with invariant relationships that hold between program variables at intermediate points In the program and explain the actual workings of the program regardless of whether the program Is correct. Thus this documentation can be used for proving the correctness of the program or may serve as an aid In the debugging of an Incorrect program. The annotation techniques are formulated as Hoare-like inference rules which derive invariants from the assignment statements, from the control structure of the program, or, heuristically, from suggested Invariants. The application of these rules Is demonstrated by an example, one of a number that have run on an experimental Implementation.

Original languageEnglish
Pages (from-to)158-167
Number of pages10
JournalProceedings - International Conference on Software Engineering
StatePublished - 10 May 1978
Externally publishedYes
Event3rd International Conference on Software Engineering, ICSE 1978 - Philadelphia, United States
Duration: 10 May 197812 May 1978


  • Inference rules
  • Invariant assertions
  • Program annotation
  • Program correctness
  • Verification


Dive into the research topics of 'Inference rules for program annotation'. Together they form a unique fingerprint.

Cite this