280 citations · 436 across the 21 of their papers we have counts for
Showing 2013 · cs.LOShow all
2 papers · 2 filters
cs.LO2013
A Combined Approach for Constraints over Finite Domains and Arrays
Sébastien Bardin, Arnaud Gotlieb
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…
cs.LO2013★ 1 cited
Constraint-based reachability
Arnaud Gotlieb, Tristan Denmat, Nadjib Lazaar
Iterative imperative programs can be considered as infinite-state systems computing over possibly unbounded domains. Studying reachability in these systems is challenging as it req…