Tal Milea

Learn More
Proving termination of programs is an undecidable problem. In this work we provide a sound method for proving the termination of a certain class of programs by using the power of linear programming tools. We handle while-loops with a simple loop condition where the assignment of the variables is nondeterministically-chosen out of a set of possible linear(More)
  • 1