5 citations · 15 across the 8 of their papers we have counts for
8 papers
Data Mining-Based Techniques for Software Fault Localization
Peggy Cellier, Mireille Ducassé, Sébastien Ferré +2
This chapter illustrates the basic concepts of fault localization using a data mining technique. It utilizes the Trityp program to illustrate the general method. Formal concept ana…
Observational semantics of the Prolog Resolution Box Model
Pierre Deransart, Mireille Ducassé, Gérard Ferrand
This paper specifies an observational semantics and gives an original presentation of the Byrd box model. The approach accounts for the semantics of Prolog tracers independently of…
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…
Generic and Efficient Program Monitoring by trace analysis
Erwan Jahier, Mireille Ducass'e
Program execution monitoring consists of checking whole executions for given properties in order to collect global run-time information. Monitoring is very useful to maintain progr…
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…