Assignment and Procedure Call Proof Rules
- 1 October 1980
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 2 (4), 564-579
- https://doi.org/10.1145/357114.357119
Abstract
The multiple assignment statement is defined in full generality—including assignment to subscripted variables and record fields—using the “axiomatic” approach of Hoare. Proof rules are developed for calls of procedures using global variables, var parameters, result parameters, and value parameters, using the idea of multiple assignment to provide understanding. An attempt is made to clarify some issues that have arisen concerning the use of rules of inference to aid in generating “verification conditions” in mechanical verifiers and the use of logical variables to denote initial values of program variables.Keywords
This publication has 9 references indexed in Scilit:
- Verification of Array, Record, and Pointer Operations in PascalACM Transactions on Programming Languages and Systems, 1979
- The Multiple Assignment StatementIEEE Transactions on Software Engineering, 1978
- Soundness and Completeness of an Axiom System for Program VerificationSIAM Journal on Computing, 1978
- Proof rules for the programming language EuclidActa Informatica, 1978
- The Design of Well-Structured and Correct ProgramsPublished by Springer Nature ,1978
- Report on the programming language EuclidACM SIGPLAN Notices, 1977
- Rules of inference for procedure callsActa Informatica, 1977
- An axiomatic definition of the programming language PASCALActa Informatica, 1973
- Procedures and parameters: An axiomatic approachLecture Notes in Mathematics, 1971