Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs

Abstract

Proving program termination is typically done by finding a well-founded ranking function for the program states. Existing termination provers typically find ranking functions using either linear algebra or templates. As such they are often restricted to finding linear ranking functions over mathematical integers. This class of functions is insufficient for… (More)
DOI: 10.1007/978-3-662-46669-8_8

7 Figures and Tables

Topics

Statistics

0102030201520162017
Citations per Year

Citation Velocity: 11

Averaging 11 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.
  • Presentations referencing similar topics