The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - March (1975 vol.1)
pp: 76-86
Sanat K. Basu , Department of Computer Science, University of Texas at Austin, Austin, Tex. 78712
Jayadev Misra , Department of Computer Science, University of Texas at Austin, Austin, Tex. 78712
ABSTRACT
Given a "DO WHILE" program P and a function F on a domain D, we investigate the problem of proving (or disproving) if P computes F over D. We show that if P satisfies certain natural constraints (well behaved), then there is a loop assertion, independent of the structure of the loop body, that is both necessary and sufficient for proving the hypothesis. We extend these results to classes of loop programs which are not well behaved and to FOR loops. We show the sufficiency of Hoare's DO WHILE axiom for well-behaved loop programs. Applications of these ideas to the problem of mechanical generation of assertions is discussed.
INDEX TERMS
Context, Input variables, Erbium, Radio frequency, Indexes, Humans, Computer science, proof, Assertion, DO WHILE axiom, equivalence, loop invariant, loop program
CITATION
Sanat K. Basu, Jayadev Misra, "Proving loop programs", IEEE Transactions on Software Engineering, vol.1, no. 1, pp. 76-86, March 1975, doi:10.1109/TSE.1975.6312822
20 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool