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
2 LSL - Laboratoire Sûreté des Logiciels
3 SRL - Simula Research Laboratory [Lysaker]

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.

Mots clés: Constraint programming; Automated reasoning; Software verification and validation

Domaines: Logique en informatique [cs.LO]

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⟩