No . STAN-CS-78-65 1 PROVING TERMINATION WITH MULTISET ORDERINGS

A common tool for proving the termination of programs is the well-founded set, a set ordered in such a way as to admit no infinite descending sequences. The basic approach is to find a termination function that maps the elements of the program into some wellfounded set, such that the value of the termination function is continually reduced throughout the… (More)