Efficient and Complete FD-Solving for Extended Array Constraints *

Quentin Plazar 1 Mathieu Acher 1 Sébastien Bardin 2 Arnaud Gotlieb 3
1 DiverSe - Diversity-centric Software Engineering
Inria Rennes – Bretagne Atlantique , IRISA_D4 - LANGAGE ET GÉNIE LOGICIEL
2 LSL - Laboratoire Sûreté des Logiciels
DILS - Département Ingénierie Logiciels et Systèmes : DRT/LIST/DILS
3 SRL - Simula Research Laboratory [Lysaker]
Abstract : Array constraints are essential for handling data structures in automated reasoning and software verification. Unfortunately, the use of a typical finite domain (FD) solver based on local consistency-based filtering has strong limitations when constraints on indexes are combined with constraints on array elements and size. This paper proposes an efficient and complete FD-solving technique for extended constraints over (possibly unbounded) arrays. We describe a simple but particularly powerful transformation for building an equisatisfiable formula that can be efficiently solved using standard FD reasoning over arrays, even in the unbounded case. Experiments show that the proposed solver significantly outperforms FD solvers, and successfully competes with the best SMT-solvers.
Keywords : Constraint programming Automated reasoning Software verification and validation
Type de document :
Communication dans un congrès
IJCAI 2017, Aug 2017, Melbourne, Australia. Proceedings of the 26th International Joint Conference on Artificial Intelligence
Liste complète des métadonnées

Littérature citée [27 références]  Voir  Masquer  Télécharger
https://hal.archives-ouvertes.fr/hal-01545557
Contributeur : Quentin Plazar <>
Soumis le : jeudi 22 juin 2017 - 16:47:05
Dernière modification le : jeudi 7 février 2019 - 15:06:52
Document(s) archivé(s) le : mercredi 10 janvier 2018 - 16:37:35

Fichier

camera_ready.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01545557, version 1

Collections

UNIV-RENNES1 | INRIA | CEA | DRT | IRISA | INRIA2017 | UNIV-PARIS-SACLAY | UR1-UFR-ISTIC | LIST | CEA-UPSAY | UNIV-RENNES

Citation

Quentin Plazar, Mathieu Acher, Sébastien Bardin, Arnaud Gotlieb. Efficient and Complete FD-Solving for Extended Array Constraints *. IJCAI 2017, Aug 2017, Melbourne, Australia. Proceedings of the 26th International Joint Conference on Artificial Intelligence. 〈hal-01545557〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

665

Téléchargements de fichiers

251

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD