Proving and Debugging Set-Based Specifications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Proving and Debugging Set-Based Specifications


We present a technique to prove invariants of model-based specifications in a fragment of set theory. Proof obligations containing set theory constructs are translated to first-order logic with equality augmented with (an extension of) the theory of arrays with extensionality. The idea underlying the translation is that sets are represented by their characteristic function which, in turn, is encoded by an array of Booleans indexed on the elements of the set. A theorem proving procedure automating the verification of the proof obligations obtained by the translation is described. Furthermore, we discuss how a sub-formula can be extracted from a failed proof attempt and used by a model finder to build a counter-example. To be concrete, we use a B specification of a simple process scheduler on which we illustrate our technique.

Dates and versions

inria-00329994 , version 1 (13-10-2008)



Jean-François Couchot, Frédéric Dadeau, David Déharbe, Silvio Ranise. Proving and Debugging Set-Based Specifications. 6th Brazilian Workshop on Formal Methods, May 2004, Campina Grande, Brazil. pp.189-208, ⟨10.1016/j.entcs.2004.04.012⟩. ⟨inria-00329994⟩
40 View
0 Download



Gmail Facebook X LinkedIn More