Verification of Array, Record, and Pointer Operations in Pascal
ACM Transactions on Programming Languages and Systems (TOPLAS)
Unrestricted procedure calls in Hoare's logic
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Complementary Definitions of Programming Language Semantics
Complementary Definitions of Programming Language Semantics
A Discipline of Programming
Design of Well-Structured and Correct Programs
Design of Well-Structured and Correct Programs
Report on the programming language Euclid
ACM SIGPLAN Notices
The Multiple Assignment Statement
IEEE Transactions on Software Engineering
Side effects and aliasing can have simple axiomatic descriptions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parameter-passing and the lambda calculus
POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Constraints: a uniform approach to aliasing and typing
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Ten Years of Hoare's Logic: A Survey—Part I
ACM Transactions on Programming Languages and Systems (TOPLAS)
Recursion As an Effective Step in Program Development
ACM Transactions on Programming Languages and Systems (TOPLAS)
Paths: an abstract alternative to pointers
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A logic for expressions with side-effects
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Containment defines a class of recursive data structures
ACM SIGPLAN Notices
Secure mechanical verification of mutually recursive procedures
Information and Computation
Predicate Abstraction of ANSI-C Programs Using SAT
Formal Methods in System Design
A logical analysis of aliasing in imperative higher-order functions
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Simplifying reasoning about objects with Tako
Proceedings of the 2006 conference on Specification and verification of component-based systems
A logical analysis of aliasing in imperative higher-order functions
Journal of Functional Programming
Local reasoning about a copying garbage collector
ACM Transactions on Programming Languages and Systems (TOPLAS)
Supporting reuse in event b development: modularisation approach
ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
Procedures in the refinement calculus: a new approach?
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
| Hi-index | 0.00 |
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.