Skip to main content
Article thumbnail
Location of Repository

By Liveness Invisible, Ranking Yi Fang, Nir Piterman, Amir Pnueli, Lenore Zuck, New York and Zuckg@cs. Nyu. Edu

Abstract

Abstract. The method of Invisible Invariants was developed originally in orderto verify safety properties of parameterized systems fully automatically. Roughly speaking, the method is based on a small model property that implies it is suf-ficient to prove some properties on small instantiations of the system, and on a heuristic that generates candidate invariants. Liveness properties usually requirewell 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 ofwhose proof obligations are of the correct form to be handled by the small model theorem. We then develop abstractions and generalization techniques that allowfor fully automatic verification of liveness properties of parameterized systems. We demonstrate the application of the method on several examples. 1 Introduction Uniform verification of parameterized systems is one of the most challenging problemsin verification today. Given a parameterized system S(N) : P [1]k \Delta \Delta \Delta kP [N] and aproperty p, uniform verification attempts to verify S(N) j = p for every N? 1. Oneof the most powerful approaches to verification which is not restricted to finite-stat

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.4185
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://mtc.epfl.ch/~piterman/p... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.