Abstract
The conventional axiomatic definitions are given for multiple assignment to simple variables and for assignment to a single subscripted variable, along with examples to illustrate their use. The original contributions of this paper are the extension of the definition to include multiple assignment to several subscripted variables, and the development of a nontrivial, practical algorithm in which multiple assignment to several subscripted variables is indeed useful. Arguments are given to support the conjecture that the use of subscripted variables, like the use of pointers, can lead to exponential explosion of the length of a proof (and thus of the time needed to understand a program) unless the programmer is careful.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E.W. Dijkstra, A Discipline of Programming. Englewood Cliffs, N.J.: Prentice-Hall, 1976.
D. Gries, Assignment to subscripted variables, Computer Science Department, Cornell University, Tech. Rep. 77–305, Sept. 1976.
C.A.R. Hoare, An axiomatic approach to computer programming, CACM 12 (Oct 69), 576–580, 583.
C.A.R. Hoare and N. Wirth, An axiomatic definition of the programming language PASCAL, Acta Informatica 2 (1973), 335–355.
D.E. Knuth, The Art of Computer Programming, vol. 3. Reading, MA: Addison-Wesley, 1973.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gries, D. (1979). The multiple assignment statement. In: Bauer, F.L., et al. Program Construction. Lecture Notes in Computer Science, vol 69. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014663
Download citation
DOI: https://doi.org/10.1007/BFb0014663
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09251-3
Online ISBN: 978-3-540-35312-6
eBook Packages: Springer Book Archive