Inference rules for program annotation

Available Online:

https://purl.stanford.edu/hs853nx1376

Title:

Inference rules for program annotation

Relation:

Stanford University. Libraries. Department of Special Collections and University Archives3840/2https://purl.stanford.edu/hs853nx1376, Stanford University, Department of Computer Science, Technical Reports, and Stanford Artificial Intelligence Laboratory records, 1963-2009

PublishDate:

2021-02-05T23:22:29Z

Description:

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 acutal 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-llike 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 two examples which have run on an experimental implementation.

Identifier:

CS-TR-1977-631

Contributor:

Dershowitz, Nachum (autAuthor) and Manna, Zohar (autAuthor)

Type:

Text and technical reports

Date:

1977-10-01

Language:

engEnglish

Format:

1 text file, technical reports, and image/jpeg

Subject:

Stanford University. Computer Science Department and Computer science

Thumbnail:

{data={format=image/jpeg, width=309, @id=https://stacks.stanford.edu/image/iiif/hs853nx1376%2Fhs853nx1376_01/full/!400,400/0/default.jpg, @type=dctypes:Image, service={data={@context=http://iiif.io/api/image/2/context.json, @id=https://stacks.stanford.edu/image/iiif/hs853nx1376%2Fhs853nx1376_01, profile=http://iiif.io/api/image/2/level2.json}}, height=400}}

Exhibit Tags:

Technical Report