Documentos de conferencia

URI permanente para esta colección

https://hdl.handle.net/10784/27391

Examinar

Examinando Documentos de conferencia por Autor "Falaschi, M."

Mostrando 1 - 2 de 2
  • No hay miniatura disponible
    Ítem
    A debugging scheme for functional logic programs
    (Elsevier BV, 2002-01-01) Alpuente, M.; Correa, F.; Falaschi, M.; Alpuente, M.; Correa, F.; Falaschi, M.; Universidad EAFIT. Departamento de Ciencias; Lógica y Computación
    We present a generic scheme for the declarative debugging of functional logic programs which is valid for eager as well as lazy programs. In particular we show that the framework extends naturally some previous work and applies to the most modern lazy strategies, such as needed narrowing. First we associate to our programs a semantics based on a (continuous) immediate consequence operator, TR, which models computed answers. We show that, given the intended specification of a program R, it is possible to check the correctness of R by a single step of TR. We consider then a more effective methodology which is based on abstract interpretation: by approximating the intended specification of the success set we derive a finitely terminating diagnosis method, which can be used statically and is parametric w.r.t. to the chosen approximation. In order to correct the bugs, we sketch a preliminary deductive approach which uses example-guided unfolding. We specialize the incorrect rules w.r.t. sets of positive and negative examples which are gathered (bottom-up) during the diagnosis process, so that all refutations of negative examples and no refutation of positive examples are excluded. Our debugging framework does not require the user to either provide error symptoms in advance or answer difficult questions concerning program correctness. We extend an implementation of our system to the case of needed narrowing and illustrate it through some examples which demonstrate the practicality of our approach. © 2002 Published by Elsevier Science B.V.
  • No hay miniatura disponible
    Ítem
    Declarative debugging of functional logic programs
    (Elsevier BV, 2001-01-01) Alpuente, M.; Correa, F.J.; Falaschi, M.; Alpuente, M.; Correa, F.J.; Falaschi, M.; Universidad EAFIT. Departamento de Ciencias; Lógica y Computación
    We present a general framework for the declarative debugging of functional logic programs, which is valid both for eager as well as lazy programs. We associate to our programs a semantics based on a (continuous) immediate consequence operator which models computed answers. Then we show that, given the intended specification of a program P, it is possible to check the correctness of P by a single step of the immediate consequence operator. We also present a more effective methodology which is based on abstract interpretation. By approximating the intended specification of the success set we derive a finitely terminating debugging method, which can be used statically. Our framework is parametric w.r.t. to the chosen approximation of the success set. We present one specific example of approximation. We provide an implementation of our debugging system which shows experimentally on a wide set of benchmarks that we are able to find some common errors in the user programs. © 2001 Published by Elsevier Science B. V.