Liveness with Invisible Ranking

The method of Invisible Invariants was developed originally in order to verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based on a small model property that implies it is sufficient to prove some properties on small instantiations of the system, and on a heuristic that generates candidate invariants. Liveness properties usually require well founded ranking, and do not fall within the scope of the small model theorem. In this paper we develop novel proof rules for liveness properties, all of whose proof obligations are of the correct form to be handled by the small model We then develop abstractions and generalization techniques that allow for fully automatic verification of liveness properties of parameterized systems. We demonstrate the application of the method on several examples.

• Type: Conference
• Year: 2004
• Where: VMCAI
• Authors: Yi Fang, Nir Piterman, Amir Pnueli, Lenore D. Zuck
• Keywords: Liveness Properties, Parameterized Systems, Small Model, Software Engineering, VMCAI 2004