Patrick Kabasci

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In automated termination provers like our tool AProVE [4], often the need arises to solve Boolean combinations of constraints in non-linear (integer) arithmetic to perform a proof step for a successful termination proof. Examples for prominent termination techniques where this is the case are well-founded orders based on polynomial [3] or matrix(More)
  • 1