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…
Proving termination with multiset orderings
The optimal approach to recursive programs
Inductive methods for proving properties of programs
Fixpoint approach to the theory of computation
Toward automatic program synthesis
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get Involved