Name
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. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1016/j.entcs.2004.04.012 | Electronic Notes in Theoretical Computer Science |
Keywords | Field | DocType |
Set-theory,First-Order Logic with Equality,Decision Procedures,Superposition,BDDs,haRVey | Discrete mathematics,Extensionality,Set theory,Programming language,Computer science,Scheduling (computing),Automated theorem proving,Proof theory,Theoretical computer science,Invariant (mathematics),Boolean data type,Debugging | Journal |
Volume | ISSN | Citations |
95 | 1571-0661 | 3 |
PageRank | References | Authors |
0.46 | 8 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| J.-F. Couchot | 1 | 3 | 0.46 |
| F. Dadeau | 2 | 7 | 1.24 |
| David Déharbe | 3 | 301 | 35.01 |
| Alain Giorgetti | 4 | 161 | 19.38 |
| S. Ranise | 5 | 3 | 0.46 |