Examinando por Autor "Correa, F.J."
Mostrando 1 - 4 de 4
Resultados por página
Opciones de ordenación
Ítem Correction of functional logic programs(SPRINGER, 2003-01-01) Alpuente, M.; Ballis, D.; Correa, F.J.; Falaschi, M.; Alpuente, M.; Ballis, D.; Correa, F.J.; Falaschi, M.; Universidad EAFIT. Departamento de Ciencias; Lógica y ComputaciónWe propose a new methodology for synthesizing correct functional logic programs. We aim to create an integrated development environment in which it is possible to debug a program and correct it automatically. We start from a declarative diagnoser that we have developed previously which allows us to identify wrong program rules w.r.t. an intended specification. Then a bug-correction, program synthesis methodology tries to correct the erroneous components of the wrong code. We propose a hybrid, top-down (unfolding-based) as well as bottom-up (induction-based), approach for the automatic correction of functional logic programs which 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. Finally, we also provide a prototypical implementation which we use for an experimental evaluation of our system. © Springer-Verlag Berlin Heidelberg 2003.Í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ónWe 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.Ítem Red de Media Técnica en Informática de Antioquia: años de aprendizajes y conocimientos Compartidos(Corporación Colombia Digital, 2012-03-01) Correa, F.J.; Correa, F.J.; Universidad EAFIT. Departamento de Ingeniería de Sistemas; I+D+I en Tecnologías de la Información y las ComunicacionesPresentamos la Red de Media Técnica en Informática de Antioquia, RMTI. Mostramos el esquema organizacional y administrativo partiendo de los elementos teóricos básicos y de la experiencia adquirida.Ítem Red de Media Técnica en Informática de Antioquia: años de aprendizajes y conocimientos Compartidos(Corporación Colombia Digital, 2012-03-01) Correa, F.J.Presentamos la Red de Media Técnica en Informática de Antioquia, RMTI. Mostramos el esquema organizacional y administrativo partiendo de los elementos teóricos básicos y de la experiencia adquirida.