Automatic program verification V: verification-oriented proof rules for arrays, records and pointers.
- Luckham, David C.
- Place of creation:
- Stanford (Calif.), March 01, 1976
- Type of resource:
- Technical reports
- technical reports
- 1 text file
- Digital origin:
- reformatted digital
- 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.
- Stanford University, Department of Computer Science, Technical Reports, Stanford Artificial Intelligence Laboratory records, 1963-2009
- Finding Aid:
- Stanford University, Department of Computer Science, Technical Reports (3840/2)
- Stanford University. Computer Science Department
- Technical Report #:
- Stanford University. Libraries. Department of Special Collections and University Archives
- Use and reproduction:
- The materials are open for research use and may be used freely for non-commercial purposes with an attribution. For commercial permission requests, please contact the Stanford University Archives (email@example.com).