5 citations · 8 across the 5 of their papers we have counts for
Showing 2005 · cs.SEShow all
2 papers · 2 filters
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…
cs.SE2005
A Tracer Driver for Versatile Dynamic Analyses of Constraint Logic Programs
Ludovic Langevine, Mireille Ducasse
Programs with constraints are hard to debug. In this paper, we describe a general architecture to help develop new debugging tools for constraint programming. The possible tools ar…