Arguing the correctness of loops has three phases: … then show that each iteration maintains its true … [e.g., by induction] … The third step is to argue that whenever … we must prove termination by other means. … Google-1 Google-2 Copyright clearance needed for quotation.
Arguing the correctness of loops has three phases: … then show that each iteration maintains its true … [e.g., by induction] … The third step is to argue that whenever … we must prove termination by other means. … Google-1 Google-2
Copyright clearance needed for quotation.
Related Topics
Topic: program proof via assertions (61 items)