Found 1 document(s)
Page 1 of 1
-
The traditional method for proving program termination consists in inferring a ranking function. In many cases (i.e. programs with unbounded non-determinism), a single ranking function over natural numbers is not suffici...