@inproceedings {43261,
	title = {Active Disjunctive Constraint Acquisition},
	journal = {Knowledge Representation (KR), Research Track, Rhodes, Greece, September 2-8},
	year = {2023},
	author = {Menguy, Gr{\'e}goire and Bardin, Sebastien and Lazaar, Nadjib and Gotlieb, Arnaud}
}
@inproceedings {42448,
	title = {Automated Program Analysis: Revisiting Precondition Inference through Constraint Acquisition},
	journal = {31st International Joint Conference on Artificial Intelligence and the 25th European Conference on Artificial Intelligence (IJCAI-ECAI 22)},
	year = {2022},
	publisher = {IJCAI},
	author = {Menguy, Gr{\'e}goire and Bardin, Sebastien and Lazaar, Nadjib and Gotlieb, Arnaud}
}
@inproceedings {25386,
	title = {Efficient and Complete FD-Solving for Extended Array Constraints},
	journal = {Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence},
	year = {2017},
	month = {08/2017},
	pages = {1231-1238},
	publisher = {IJCAI},
	doi = {10.24963/ijcai.2017/171},
	author = {Plazar, Quentin and Acher, Mathieu and Bardin, Sebastien and Gotlieb, Arnaud}
}
@article {Simula.simula.2180,
	title = {A Combined Approach for Constraints Over Finite Domains and Arrays},
	journal = {journal},
	year = {2014},
	publisher = {Springer Berlin Heidelberg},
	author = {Bardin, Sebastien and Gotlieb, Arnaud and Flener, Pierre}
}
@inproceedings {Simula.simula.1220,
	title = {fdcc: a Combined Approach for Solving Constraints Over Finite Domains and Arrays},
	journal = {Proceedings of CPAIOR 2012 (Constraint Programming-Artificial Intelligence-Operations Research), Nantes, France},
	year = {2012},
	pages = {17-33},
	publisher = {Springer Berlin Heidelberg},
	type = {Conference},
	address = {Berlin Heidelberg},
	abstract = {Arrays are ubiquitous in the context of software verification. However, effective reasoning over arrays is still rare in CP, as local reasoning is dramatically ill-conditioned for constraints over arrays. In this paper, we propose an approach combining both global symbolic reasoning and local filtering in order to solve constraint systems involving arrays (with accesses, updates and size constraints) and finite-domain constraints over their elements and indexes. Our approach, named FDCC, is based on a combination of a congruence closure algorithm for the standard theory of arrays and a CP solver over finite domains. The tricky part of the work lies in the bi-directional communication mechanism between both solvers. We identify the significant information to share, and design ways to master the communication overhead. Experiments on random instances show that FDCC solves more formulas than any portfolio combination of the two solvers taken in isolation, while overhead is kept reasonable.},
	keywords = {Conference},
	doi = {10.1007/978-3-642-29828-8\_2},
	author = {Bardin, Sebastien and Gotlieb, Arnaud},
	editor = {Beldiceanu, Nicolas and Jussien, Narendra and Pinson, {\'E}ric}
}
