Abstract
Abstract : The functional correctness technique is presented and explained. An implication of the underlying theory for the derivation of loop invariants is discussed. The functional verification conditions concerning program loops are shown to be a specialization of the commonly used inductive assertion verification conditions. The functional technique is compared and contrasted with subgoal induction. Finally, the difficulty of proving initialized loops is examined in light of the inductive assertion and functional correctness theories. (Author)
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
