Proving loop programs

Given a `DO WHILE' program P and a function F on a domain D , the authors investigate the problem of proving (or disproving) if P computes F over D . It is shown that if P satisfies certain natural constraints (well behaved), then there is a loop assertion independent of the structure of the loop bo... View More