Un Depurador Abstracto, Inductivo y Paramétrico para Programas Multiparadigma

We present a general framework for the abstract debugging of functional logic programs which is valid for different narrowing strategies. We associate to our programs a fixpoint semantics which models computed answers. Our methodology is based on abstract interpretation and it is parametric with respect to the computation strategy.interpretation and it is parametric with respect to the computation strategy. By approximating the intended specification of the success set we derive a finitely terminating debugging method, which can be used statically. We use an implementation of our debugging system “BUGGY” which shows experimentally on a wide set of benchmarks that we are able to find some common errors in the user programs.