Proving and Debugging Set-Based Specifications

Jean-François Couchot 1 Frédéric Dadeau 1 David Déharbe 1 Silvio Ranise 1
1 CASSIS - Combination of approaches to the security of infinite states systems
FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies (UMR 6174), INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00329994
Contributor : Frédéric Dadeau <>
Submitted on : Monday, October 13, 2008 - 5:31:43 PM
Last modification on : Friday, July 6, 2018 - 3:06:09 PM

Links full text

Identifiers

Citation

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⟩

Share

Metrics

Record views

155