Verifying Invariants Using theorem Proving

Our goal is to use a theorem prover in order to verify in-variance properties of distributed systems in a \model checking like" manner. A system S is described by a set of sequential components, each one given by a transition relation and a predicate Init deening the set of initial states. In order to verify that P is an invariant of S, we try to compute, in a model checking like manner, the weakest predicate P 0 stronger than P and weaker than Init which is an inductive invariant, that is, whenever P 0 is true in some state, then P 0 remains true after the execution of any possible transition. The fact that P is an invariant can be expressed by a set of predicates (having no more quantiiers than P) on the set of program variables, one for every possible transition of the system. In order to prove these predicates, we use either automatic or assisted theorem proving depending on their nature. We show in this paper how this can be done in an eecient way using the Prototype Veriication System PVS. A tool implementing this veriica-tion method is presented.