Skip to Main content Skip to Navigation
Conference papers

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
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.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01545557
Contributor : Quentin Plazar <>
Submitted on : Thursday, June 22, 2017 - 4:47:05 PM
Last modification on : Tuesday, February 25, 2020 - 8:08:10 AM
Document(s) archivé(s) le : Wednesday, January 10, 2018 - 4:37:35 PM

File

camera_ready.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01545557, version 1

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. ⟨hal-01545557⟩

Share

Metrics

Record views

810

Files downloads

456