Comparing EventB, {log} and Why3 Models of Sparse Sets
Résumé
Many representations for sets are available in programming languages libraries. This paper focuses on sparse sets and two of their operations used in some constraint solvers for representing integer variable domains, which are finite sets of values, as an alternative to range sequences. We formalize this data structure and two of its operations and prove their correctness, in three deductive formal verification tools, EventB, {log} and Why3. Furthermore, we draw some comparisons regarding specifications and proofs.
Domaines
Informatique [cs]Origine | Accord explicite pour ce dépôt |
---|