5 citations · 7 across the 4 of their papers we have counts for
4 papers · 1 filter
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…
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…
Rigorous design of tracers: an experiment for constraint logic programming
Mireille Ducasse, Ludovic Langevine, Pierre Deransart
In order to design and implement tracers, one must decide what exactly to trace and how to produce this trace. On the one hand, trace designs are too often guided by implementation…
Proceedings of the Fourth International Workshop on Automated Debugging (AADEBUG 2000)
M. Ducasse
Over the past decades automated debugging has seen major achievements. However, as debugging is by necessity attached to particular programming paradigms, the results are scattered…