Minimization of counterexample in SPIN

Paul Gastin (1) , Pierre Moro (1) , Marc Zeitoun (1)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

We propose an algorithm to find a counter-example to some property in a finite state program. This algorithm is derived from SPIN's one, but it finds a counter-example faster than SPIN does. (In particular it still works in linear time.) Moreover, it does not require more memory than SPIN. We further propose another algorithm to compute a counter-example of minimal size. Again, this algorithm does not use more memory than SPIN does to approximate a minimal counter-example. The cost to find a counter-example of minimal size is that one has to revisit more states than SPIN. We provide an implementation and discuss experimental results.

Mots clés: SPIN; Software verification; minimal counterexample

Domaines: Cryptographie et sécurité [cs.CR]

Paul Gastin, Pierre Moro, Marc Zeitoun. Minimization of counterexample in SPIN. 11th SPIN Workshop, Mar 2004, Barcelone, Spain. pp.92-108. ⟨hal-00147953⟩