SciELO - Scientific Electronic Library Online

 
vol.9 número2Dynamic EDCF parameters for QoS control in IEEE 802.11 hot spotsA contradiction-driven approach to theory formation: conceptual issues, pragmatics in human learning, potentialities índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Journal of the Brazilian Computer Society

versión impresa ISSN 0104-6500

Resumen

COUCHOT, J.-F.; DEHARBE, D.; GIORGETTI, A.  y  RANISE, S.. Scalable automated proving and debugging of set-based specifications. J. Braz. Comp. Soc. [online]. 2003, vol.9, n.2, pp. 17-36. ISSN 0104-6500.  http://dx.doi.org/10.1590/S0104-65002003000300003.

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.

Palabras llave : Set-theory; First-order logic with equality; Decision procedures; Superposition; BDDs; haRVey.

        · texto en Inglés     · pdf en Inglés