Transition invariants

A. Podelski, A. Rybalchenko
2004 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.  
Proof rules for program verification rely on auxiliary assertions. We propose a (sound and relatively complete) proof rule whose auxiliary assertions are transition invariants. A transition invariant of a program is a binary relation over program states that contains the transitive closure of the transition relation of the program. A relation is disjunctively well-founded if it is a finite union of well-founded relations. We characterize the validity of termination or another liveness property
more » ... liveness property by the existence of a disjunctively well-founded transition invariant. The main contribution of our proof rule lies in its potential for automation via abstract interpretation.
doi:10.1109/lics.2004.1319598 dblp:conf/lics/PodelskiR04 fatcat:wk4bavbz3vax3ltcyk66k2hk3a