 |
|
|
|
| HAL: hal-00456558, version 1 |
| DOI: 10.1007/978-3-642-11319-2_21 |
| Detailed view |  Export this paper |
|
|
| Verification, Model Checking, and Abstract Interpretation, Madrid : Espagne (2010) |
|
|
|
|
| An Analysis of Permutations in Arrays |
|
|
| Valentin Perrelle 1Nicolas Halbwachs 1 |
|
|
| (2010-01) |
|
|
|
| This paper is concerned with the synthesis of invariants in programs with arrays. More specifically, we consider properties concerning array contents up to a permutation. For instance, to prove a sorting procedure, one has to show that the result is sorted, but also that it is a permutation of the initial array. In order to analyze this kind of properties, we define an abstract interpretation working on multisets of values, and able to discover invariant equations about such multisets. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | VERIMAG (VERIMAG - IMAG) |
|
|
|
CNRS : UMR5104 – Université Joseph Fourier - Grenoble I – Institut National Polytechnique de Grenoble (INPG) |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Data Structures and Algorithms |
|
|
| static analysis – abstract interpretation – array analysis – multisets – permutation invariant properties |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00456558, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00456558 | |
| oai:hal.archives-ouvertes.fr:hal-00456558 | |
| From: Nicolas Halbwachs | |
| Submitted on: Monday, 15 February 2010 17:00:14 | |
| Updated on: Tuesday, 16 February 2010 08:22:36 | |
