Abstract model checking and refinement of temporal logic in /spl alpha/SPIN

Abstract

We give an overview of the features offered by the tool /spl alpha/SPIN in order to perform abstract model checking of LTL formulas. Shortly, these features are: construction of over-approximated PROMELA models, checking satisfaction of universal formulas, checking refutation of existential formulas, and on-the-fly refinement of the model by means of a refinement of the temporal formula to be verified.