Termination Analysis with Algorithmic Learning

An algorithmic-learning-based termination analysis technique is presented. The new technique combines transition predicate abstraction, algorithmic learning, and decision procedures to compute transition invariants as proofs of program termination. Compared to the previous approaches that mostly aim to find a particular form of transition invariants, our technique does not commit to any particular one. For the examples that the previous approaches simply give up and report failure our technique can still prove the termination. We compare our technique with others on several benchmarks from literature including PolyRank examples, SNU realtime benchmark, and Windows device driver examples. The result shows that our technique outperforms others both in efficiency and effectiveness.

• Type: Journal
• Year: 2012
• Where: CAV
• Authors: Wonchan Lee, Bow-Yaw Wang, Kwangkeun Yi
• Keywords: CAV 2012, Hardware, Termination Analysis, Transition Invariants, Windows Device Driver