5 citations · 6 across the 2 of their papers we have counts for
2 papers
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…
cs.SE2005★ 5 cited
Proving or Disproving likely Invariants with Constraint Reasoning
Tristan Denmat, Arnaud Gotlieb, Mireille Ducasse
A program invariant is a property that holds for every execution of the program. Recent work suggest to infer likely-only invariants, via dynamic analysis. A likely invariant is a…