Contact Us

The History of Artificial Intelligence

Automatic program verification V: verification-oriented proof rules for arrays, records and pointers.

purl.stanford.edu/kb470yn0165
Title:
Automatic program verification V: verification-oriented proof rules for arrays, records and pointers.
Author:
Luckham, David C. and Suzuki, Norihisa
Author (no Collectors):
Luckham, David C. and Suzuki, Norihisa
Description:
A practical method is presented for automating in a uniform way the verification of Pascal programs that operate on the standard Pascal data structures ARRAY, RECORD, and POINTER. New assertion language primitives are introduced for describing computational effects of operations on these data structures. Axioms defining the semantics of the new primitives are given. Proof rules for standard Pascal operations on pointer variables are then defined in terms of the extended assertion language. Similar rules for records and arrays are special cases. An extensible axiomatic rule for the Pascal memory allocation operation, NEW, is also given. These rules have been implemented in the Stanford Pascal program verifier. Examples illustrating the verification of programs which operate on list structures implemented with pointers and records are discussed. These include programs with side-effects.
Topic:
Computer science
Subject:
Stanford University. Computer Science Department
Language:
English
Physical Description:
1 text file
Publication Info:
cau and Stanford (Calif.)
Date:
March 01, 1976
Place created:
Stanford (Calif.)
Imprint:
Stanford (Calif.), March 1, 1976
Genre:
technical reports
Identifier:
CS-TR-1976-549
Repository:
Stanford University. Libraries. Department of Special Collections and University Archives
Collection:
Stanford University, Department of Computer Science, Technical Reports and Stanford Artificial Intelligence Laboratory records, 1963-2009
Manuscript number:
3840/2