Dima Elenbogen

Learn More
Two programs are said to be mutually terminating if they terminate on exactly the same inputs. We suggest inference rules and a proof system for proving mutual termination of a given pair of procedures f , f and the respective subprograms that they call under a free context. Given a (possibly partial) mapping between the procedures of the two programs, the(More)
I would like to thank Prof. Ofer Strichman very much for his devoted guidance throughout the course of this research. I highly appreciate the remarks of Prof. Shmuel Katz; many of them led to some of the ideas presented in this work. I would also like to acknowledge Ms. Yardena Kolet, the secretary of graduate studies in my faculty, for her assistance in(More)
Two programs are said to be mutually terminating if they terminate on exactly the same inputs. We suggest a proof rule that uses a mapping between the functions of the two programs for proving mutual termination of functions f , f. The rule's premise requires proving that given the same arbitrary input in, f (in) and f (in) call mapped functions with the(More)
  • 1