Examinando por Autor "Correa, F."

Mostrando 1 - 5 de 5
  • 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
    An integrated framework for the diagnosis and correction of rule-based programs
    (ELSEVIER SCIENCE BV, 2010-10-29) Alpuente, M.; Ballis, D.; Correa, F.; Falaschi, M.; Alpuente, M.; Ballis, D.; Correa, F.; Falaschi, M.; Universidad EAFIT. Departamento de Ingeniería de Sistemas; I+D+I en Tecnologías de la Información y las Comunicaciones
    We present a generic scheme for the declarative debugging of programs that are written in rewriting-based languages that are equipped with narrowing. Our aim is to provide an integrated development environment in which it is possible to debug a program and then correct it automatically. Our methodology is based on the combination (in a single framework) of a semantics-based diagnoser that identifies those parts of the code that contain errors and an inductive learner that tries to repair them, once the bugs have been located in the program. We develop our methodology in several steps. First, we associate with our programs a semantics that is based on a (continuous) immediate consequence operator, TR, which models the answers computed by narrowing and is parametric w.r.t. the evaluation strategy, which can be eager or lazy. Then, 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. In order to develop an effective debugging method, we approximate the computed answers semantics of R and derive a finitely terminating bottom-up abstract diagnosis method, which can be used statically. Finally, a bug-correction program synthesis methodology attempts to correct the erroneous components of the wrong code. We propose a hybrid, top-down (unfolding-based) as well as bottom-up (induction-based), correction approach that is driven by a set of evidence examples which are automatically produced as an outcome by the diagnoser. The resulting program is proven to be correct and complete w.r.t. the considered example sets. Our debugging framework does not require the user to provide error symptoms in advance or to answer difficult questions concerning program correctness. An implementation of our debugging system has been undertaken which demonstrates the workability of our approach. © 2010 Elsevier B.V. All rights reserved.
  • No hay miniatura disponible
    Ítem
    An integrated framework for the diagnosis and correction of rule-based programs
    (ELSEVIER SCIENCE BV, 2010-10-29) Alpuente, M.; Ballis, D.; Correa, F.; Falaschi, M.; Alpuente, M.; Ballis, D.; Correa, F.; Falaschi, M.; Universidad EAFIT. Departamento de Ciencias; Lógica y Computación
    We present a generic scheme for the declarative debugging of programs that are written in rewriting-based languages that are equipped with narrowing. Our aim is to provide an integrated development environment in which it is possible to debug a program and then correct it automatically. Our methodology is based on the combination (in a single framework) of a semantics-based diagnoser that identifies those parts of the code that contain errors and an inductive learner that tries to repair them, once the bugs have been located in the program. We develop our methodology in several steps. First, we associate with our programs a semantics that is based on a (continuous) immediate consequence operator, TR, which models the answers computed by narrowing and is parametric w.r.t. the evaluation strategy, which can be eager or lazy. Then, 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. In order to develop an effective debugging method, we approximate the computed answers semantics of R and derive a finitely terminating bottom-up abstract diagnosis method, which can be used statically. Finally, a bug-correction program synthesis methodology attempts to correct the erroneous components of the wrong code. We propose a hybrid, top-down (unfolding-based) as well as bottom-up (induction-based), correction approach that is driven by a set of evidence examples which are automatically produced as an outcome by the diagnoser. The resulting program is proven to be correct and complete w.r.t. the considered example sets. Our debugging framework does not require the user to provide error symptoms in advance or to answer difficult questions concerning program correctness. An implementation of our debugging system has been undertaken which demonstrates the workability of our approach. © 2010 Elsevier B.V. All rights reserved.
  • No hay miniatura disponible
    Ítem
    Métodos numéricos
    (Fondo Editorial Universidad EAFIT, 2010-01-01) Correa, F.; Correa, F.; Universidad EAFIT. Departamento de Ingeniería de Sistemas; I+D+I en Tecnologías de la Información y las Comunicaciones
    La obra aborda de forma agradable un panorama conceptual del tema y propone con riqueza metodológica, posibilidades de aplicación de cada método con argumentos matemáticos y computacionales.Los lectores que desarrollen las competencias planteadas
  • No hay miniatura disponible
    Ítem
    Métodos numéricos
    (Fondo Editorial Universidad EAFIT, 2010-01-01) Correa, F.; Correa, F.; Universidad EAFIT. Departamento de Ciencias; Lógica y Computación
    La obra aborda de forma agradable un panorama conceptual del tema y propone con riqueza metodológica, posibilidades de aplicación de cada método con argumentos matemáticos y computacionales.Los lectores que desarrollen las competencias planteadas