Un depurador abstracto, inductivo y paramétrico para programas multiparadigma

Presentamos un marco general para el diagnóstico abstracto de programas lógico- funcionales, válido para diferentes estrategias de estrechamiento. Asociamos a cada programa una semántica por punto fijo que modela las respuestas computadas. Nuestra metodología está basada en la interpretación abstrac...

Full description

Autores:
Alpuente Frasnedo, María
Correa Zabala, Francisco José
Tipo de recurso:
Trabajo de grado de pregrado
Fecha de publicación:
2004
Institución:
Universidad Autónoma de Bucaramanga - UNAB
Repositorio:
Repositorio UNAB
Idioma:
spa
OAI Identifier:
oai:repository.unab.edu.co:20.500.12749/9033
Acceso en línea:
http://hdl.handle.net/20.500.12749/9033
Palabra clave:
Innovaciones tecnológicas
Ciencia de los computadores
Desarrollo de tecnología
Ingeniería de sistemas
Investigaciones
Tecnologías de la información y las comunicaciones
TIC´s
Technological innovations
Computer science
Technology development
Systems engineering
Investigations
Information and communication technologies
ICT's
Declarative debugging
Abstract diagnosis
Abstract interpretation
Functional logic language
Multi-paradigm programming
Operational semantics
Fixed point semantics
Innovaciones tecnológicas
Ciencias de la computación
Desarrollo tecnológico
Ingeniería de sistemas
Investigaciones
Tecnologías de la información y la comunicación
Depuración declarativa
Diagnostico abstracto
Interpretación abstracta
Lenguaje lógico funcional
Programación multiparadigma
Semántica operacional
Semántica de punto fijo
Rights
License
Derechos de autor 2004 Revista Colombiana de Computación
id UNAB2_ba20b4b2021d3c1dca4ca04ec6996ff5
oai_identifier_str oai:repository.unab.edu.co:20.500.12749/9033
network_acronym_str UNAB2
network_name_str Repositorio UNAB
repository_id_str
dc.title.spa.fl_str_mv Un depurador abstracto, inductivo y paramétrico para programas multiparadigma
dc.title.translated.eng.fl_str_mv An abstract, inductive, and parametric debugger for multi-paradigm programs
title Un depurador abstracto, inductivo y paramétrico para programas multiparadigma
spellingShingle Un depurador abstracto, inductivo y paramétrico para programas multiparadigma
Innovaciones tecnológicas
Ciencia de los computadores
Desarrollo de tecnología
Ingeniería de sistemas
Investigaciones
Tecnologías de la información y las comunicaciones
TIC´s
Technological innovations
Computer science
Technology development
Systems engineering
Investigations
Information and communication technologies
ICT's
Declarative debugging
Abstract diagnosis
Abstract interpretation
Functional logic language
Multi-paradigm programming
Operational semantics
Fixed point semantics
Innovaciones tecnológicas
Ciencias de la computación
Desarrollo tecnológico
Ingeniería de sistemas
Investigaciones
Tecnologías de la información y la comunicación
Depuración declarativa
Diagnostico abstracto
Interpretación abstracta
Lenguaje lógico funcional
Programación multiparadigma
Semántica operacional
Semántica de punto fijo
title_short Un depurador abstracto, inductivo y paramétrico para programas multiparadigma
title_full Un depurador abstracto, inductivo y paramétrico para programas multiparadigma
title_fullStr Un depurador abstracto, inductivo y paramétrico para programas multiparadigma
title_full_unstemmed Un depurador abstracto, inductivo y paramétrico para programas multiparadigma
title_sort Un depurador abstracto, inductivo y paramétrico para programas multiparadigma
dc.creator.fl_str_mv Alpuente Frasnedo, María
Correa Zabala, Francisco José
dc.contributor.author.spa.fl_str_mv Alpuente Frasnedo, María
Correa Zabala, Francisco José
dc.contributor.cvlac.spa.fl_str_mv Correa Zabala, Francisco José [0000021172]
dc.contributor.orcid.spa.fl_str_mv Alpuente Frasnedo, María [0000-0002-9268-1178]
Correa Zabala, Francisco José [0000-0002-5862-3169]
dc.contributor.researchgate.spa.fl_str_mv Alpuente Frasnedo, María [Maria-Alpuente]
Correa Zabala, Francisco José [Francisco-Correa-Zabala]
dc.subject.none.fl_str_mv Innovaciones tecnológicas
Ciencia de los computadores
Desarrollo de tecnología
Ingeniería de sistemas
Investigaciones
Tecnologías de la información y las comunicaciones
TIC´s
topic Innovaciones tecnológicas
Ciencia de los computadores
Desarrollo de tecnología
Ingeniería de sistemas
Investigaciones
Tecnologías de la información y las comunicaciones
TIC´s
Technological innovations
Computer science
Technology development
Systems engineering
Investigations
Information and communication technologies
ICT's
Declarative debugging
Abstract diagnosis
Abstract interpretation
Functional logic language
Multi-paradigm programming
Operational semantics
Fixed point semantics
Innovaciones tecnológicas
Ciencias de la computación
Desarrollo tecnológico
Ingeniería de sistemas
Investigaciones
Tecnologías de la información y la comunicación
Depuración declarativa
Diagnostico abstracto
Interpretación abstracta
Lenguaje lógico funcional
Programación multiparadigma
Semántica operacional
Semántica de punto fijo
dc.subject.keywords.eng.fl_str_mv Technological innovations
Computer science
Technology development
Systems engineering
Investigations
Information and communication technologies
ICT's
Declarative debugging
Abstract diagnosis
Abstract interpretation
Functional logic language
Multi-paradigm programming
Operational semantics
Fixed point semantics
dc.subject.lemb.spa.fl_str_mv Innovaciones tecnológicas
Ciencias de la computación
Desarrollo tecnológico
Ingeniería de sistemas
Investigaciones
Tecnologías de la información y la comunicación
dc.subject.proposal.spa.fl_str_mv Depuración declarativa
Diagnostico abstracto
Interpretación abstracta
Lenguaje lógico funcional
Programación multiparadigma
Semántica operacional
Semántica de punto fijo
description Presentamos un marco general para el diagnóstico abstracto de programas lógico- funcionales, válido para diferentes estrategias de estrechamiento. Asociamos a cada programa una semántica por punto fijo que modela las respuestas computadas. Nuestra metodología está basada en la interpretación abstracta y es paramétrica con respecto a la estrategia de cómputo. Gracias a que la aproximación del conjunto de éxitos que presentamos es finita, la metodología de diagnóstico que se propone puede ser usada de manera estática. Una implementación de nuestro sistema de depuración \BUGGY" demuestra experimentalmente que el método permite encontrar algunos errores comunes sobre una muestra amplia de programas.
publishDate 2004
dc.date.issued.none.fl_str_mv 2004-12-01
dc.date.accessioned.none.fl_str_mv 2020-10-27T00:21:16Z
dc.date.available.none.fl_str_mv 2020-10-27T00:21:16Z
dc.type.coar.fl_str_mv http://purl.org/coar/resource_type/c_2df8fbb1
dc.type.driver.none.fl_str_mv info:eu-repo/semantics/article
dc.type.local.spa.fl_str_mv Artículo
dc.type.coar.none.fl_str_mv http://purl.org/coar/resource_type/c_7a1f
dc.type.redcol.none.fl_str_mv http://purl.org/redcol/resource_type/CJournalArticle
format http://purl.org/coar/resource_type/c_7a1f
dc.identifier.issn.none.fl_str_mv 2539-2115
1657-2831
dc.identifier.uri.none.fl_str_mv http://hdl.handle.net/20.500.12749/9033
dc.identifier.instname.spa.fl_str_mv instname:Universidad Autónoma de Bucaramanga UNAB
dc.identifier.repourl.none.fl_str_mv repourl:https://repository.unab.edu.co
identifier_str_mv 2539-2115
1657-2831
instname:Universidad Autónoma de Bucaramanga UNAB
repourl:https://repository.unab.edu.co
url http://hdl.handle.net/20.500.12749/9033
dc.language.iso.spa.fl_str_mv spa
language spa
dc.relation.none.fl_str_mv https://revistas.unab.edu.co/index.php/rcc/article/view/1073/1045
dc.relation.uri.none.fl_str_mv https://revistas.unab.edu.co/index.php/rcc/article/view/1073
dc.relation.references.none.fl_str_mv M. Alpuente, D. Ballis, F. Correa, and M. Falaschi. A Multi Paradigm Automatic Correction Scheme. In “Proc. of 11th Int’l Workshop on Functional and (Constraint) Logic Programming” (2002).
M. Alpuente, D. Ballis, F. Correa, and M. Falaschi. The System for Automatic Correction nobug. Technical Report, UPV (2002). Available at URL: http://www.dsic.upv.es/users/elp/papers.html.
M. Alpuente, D. Ballis, F. Correa, and M. Falaschi. Correction of functional logic program. In P. Degano, editor, “Programming Languages and Systems: 12th European Symposium on Programming, ESOP 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003.”, volume 2618 / 2003 of “Lecture Notes in Computer Science”. SpringerVerlag Heidelberg (2003).
M. Alpuente, F. Correa, and M. Falaschi. Declarative debugging framework for functional logic programs.
M. Alpuente, F. Correa, and M. Falaschi. Declarative Debugging of Funtional Logic Programs. In B. Gramlich and S. Lucas, editors, “Proc. of the International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001)”, volume 57 of “Electronic Notes in Theoretical Computer Science”. Elsevier Science Publishers (2001).
M. Alpuente, F. Correa, and M. Falaschi. Debugging Scheme of Functional Logic Programs. In M. Hanus, editor, “Proc. of International Workshop on Functional and (Constraint) Logic Programming, WFLP’01”, volume 64 of “Electronic Notes in Theoretical Computer Science”. Elsevier Science Publishers (2002).
M. Alpuente, F. Correa, M. Falaschi, and S. Marson. The Debugging System buggy. Technical Report, UPV (2001). Available at URL: http://www.dsic.upv.es/users/elp/soft.html.
M. Alpuente, M. Falaschi, and F. Manzo. Analyses of Unsatisfiability for Equational Logic Programming. Journal of Logic Programming 22(3), 221–252 (1995).
M. Alpuente, M. Falaschi, and G. Vidal. A Compositional Semantic Basis for the Analysis of Equational Horn Programs. Theoretical Computer Science 165(1), 97–131 (1996).
S. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. In “Proc. 21st ACM Symp. on Principles of Programming Languages, Portland”, pages 268–279, New York (1994). ACM Press.
K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, “Handbook of Theoretical Computer Science”, volume B: Formal Models and Semantics. Elsevier, Amsterdam and The MIT Press, Cambridge, Mass. (1990).
J. Boye, W. Drabent, and J. Maluszynski ´ . Declarative diagnosis of constraint programs: an assertion-based approach. In “Proc. of the 3rd Int’l Workshop on Automated Debugging - AADEBUG’97”, pages 123–141, Linkoping, Sweden (May 1997). U. of Linkoping Press.
F. Bueno, P. Deransart, W. Drabent, G. Ferrand, M Hermenegildo, J. Maluszynski, and G. Puebla ´ . On the role of semantic approximations in validation and diagnosis of constraint logic programs. In “Proc. of the 3rd. Int’l Workshop on Automated Debugging-AADEBUG’97”, pages 155–170. U. of Linkoping Press (1997).
M. Codish, M. Falaschi, and K. Marriott. Suspension Analysis for Concurrent Logic Programs. In K. Furukawa, editor, “Proc. of Eighth Int’l Conf. on Logic Programming”, pages 331–345. The MIT Press, Cambridge, MA (1991).
M. Comini, G. Levi, M. Meo, and G. Vitiello. Proving Properties of Logic Programs by Abstract Diagnosis. In M. Dams, editor, “Analysis and Verification of Multiple-Agent Languages, 5th LOMAPS Workshop”, volume
M. Comini, G. Levi, M. C. Meo, and G. Vitiello. Abstract diagnosis. Journal of Logic Programming 39(1-3), 43–93 (1999).
M. Comini, G. Levi, and G. Vitiello. Abstract Debugging of Logic Programs. In L. Fribourg and F. Turini, editors, “Proc. Logic Program Synthesis and Transformation and Metaprogramming in Logic 1994”, volume 883 of “Lecture Notes in Computer Science”, pages 440–450. Springer-Verlag, Berlin (1994).
M. Comini, G. Levi, and G. Vitiello. Declarative Diagnosis Revisited. In John W. Lloyd, editor, “Proceedings of the 1995 Int’l Symposium on Logic Programming”, pages 275–287. The MIT Press (1995).
M. Comini, G. Levi, and G. Vitiello. Efficient detection of incompleteness errors in the abstract debugging of logic programs. In M. Ducasse´, editor, “Proc. 2nd International Workshop on Automated and Algorithmic Debugging, AADEBUG’95” (1995).
F. Correa. “Depuraci´on Declarativa de Programas L´ogico Funcionales”. PhD thesis, Universidad Polit´ecnica de Valencia (2002). ISBN 84-688-5981-8.
P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In “Proc. of Fourth ACM Symp. on Principles of Programming Languages”, pages 238–252 (1977).
N. Dershowitz and Y. Lee. Deductive Debugging. In “Proceedings of the Fourth IEEE Symposium on Logic Programming”, pages 298–306, San Francisco, California (August 1987).
W. Drabent, S.Nadjim-Tehrani, and J. Maluszynski ˜ . The use of assertions in algorithmic debugging. In “Proceedings of the 1988 Iinternational Conference on Fifth Generation Computer Systems”, pages 573–581, Tokyo, Japan (December 1988).
R. Echahed. On completeness of narrowing strategies. In “Proc. of CAAP’88”, pages 89–101. Springer LNCS 299 (1988).
A. Edman and S. Tarnlund ¨ . Mechanization of an Oracle in a Debugging System. In “Proceedings of Eighth IJCAI”, pages 553–555, Karlsruhe, Germany (August 1983).
M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Computer Science 69(3), 289–318 (1989).
M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs. Information and Computation 103(1), 86–113 (1993).
M. Fay. First Order Unification in an Equational Theory. In “Proc of 4th Int’l Conf. on Automated Deduction”, pages 161–167 (1979).
G. Ferrand. Error Diagnosis in Logic Programming, and Adaptation of E.Y.Shapiro’s Method. Journal of Logic Programming 4(3), 177–198 (1987).
G. Ferrand and A. Tessier. Declarative Debugging. The Newsletter of the European Network in Computational Logic 3(1), 71–76 (1996).
L. Fribourg. SLOG: a logic programming language interpreter based on clausal superposition and rewriting. In “Proc. of Second IEEE Int’l Symp. on Logic Programming”, pages 172–185. IEEE, New York (1985).
M. Hanus. Combining Lazy Narrowing with Simplification. In “Proc. of 6th Int’l Symp. on Programming Language Implementation and Logic Programming”, pages 370–384. Springer LNCS 844 (1994).
M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming 19&20, 583–628 (1994).
M. Hanus. Towards the Global Optimization of Functional Logic Programs. In “Proc. of Fifth Int’l Conf. on Compiler Construction”, pages 68–82. Springer LNCS 786 (1994).
S. Holldobler ¨ . “Foundations of Equational Logic Programming”. Springer LNAI 353 (1989).
J. M. Hullot. Canonical Forms and Unification. In “Proc of 5th Int’l Conf. on Automated Deduction”, pages 318–334. Springer LNCS 87 (1980).
T. Kanamori, T. Kawamura, M. Maeji, and K. Horiuchi. Logic Program Diagnosis Specification. Icot technical report tr-447, Institute for New Generation Computer Technology, Tokyo, Japan (March 1989).
R. A. Kowalski. Predicate Logic as a Programming Language. In “Information Processing 74”, pages 569–574. North-Holland (1974).
R. A. Kowalski. “Logic for Problem Solving”. North-Holland (1979).
J. L. Lassez, M. J. Maher, and K. Marriott. Unification Revisited. In J. Minker, editor, “Foundations of Deductive Databases and Logic Programming”, pages 587–625. Morgan Kaufmann, Los Altos, Ca. (1988).
J. W. Lloyd. Declarative error diagnosis. New Generation Computing 2(2), 133–154 (1987).
J. W. Lloyd. “Foundations of Logic Programming”. Springer-Verlag, Berlin (1987). Second edition.
M. J. Maher. Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees. In “Proc. of Third IEEE Symp. on Logic In Computer Science”, pages 348–357. Computer Science Press, New York (1988).
M. J. Maher. On Parameterized Substitutions. Technical Report RC 16042, IBM - T.J. Watson Research Center, Yorktown Heights, NY (1990).
A. Middeldorp and E. Hamoen. Completeness Results for Basic Narrowing. Applicable Algebra in Engineering, Communication and Computing 5, 213–253 (1994).
J.J. Moreno-Navarro and M. Rodr´ıguez-Artalejo. Logic Programming with Functions and Predicates: The language Babel. Journal of Logic Programming 12(3), 191–224 (1992).
L. Naish. Declarative Debugging of Lazy Functional Programs. Australian Computer Science Communications 15(1), 287–294 (1993).
L. Naish. A Declarative Debugging Scheme. Technical report 95/1, Department of Computer Science, University of Melbourne, Melbourne, Australia (February 1995).
L. Naish and T. Barbour. Declarative Debugging of a Logical-Functional Language. Technical report 94/30, Department of Computer Science, University of Melbourne, Melbourne, Australia (December 1994).
L. Naish and T. Barbour. Towards a portable lazy functional declarative debugger. Technical Report, Department of Computer Science, University of Melbourne, Melbourne, Australia (1995).
C. Palamidessi. A fixpoint semantics for Guarded Horn Clauses. Technical Report CS-R8833, Centre for Mathematics and Computer Science, Amsterdam (1988).
R. Plasmeijer and M. van Eekelen. “Functional Programming and Parallel Graph Rewriting.” Addison Wesley (1993).
G. Plotkin. A structured approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University (1981).
C. Reade. “Elements of Functional Programming”. Addison-Wesley Publishing Company (1993).
U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In “Proc. of Second IEEE Int’l Symp. on Logic Programming”, pages 138–151. IEEE, New York (1985).
P. Rety ´ . Improving basic narrowing techniques. In “Proc. of the Conf. on Rewriting Techniques and Applications”, pages 228–241. Springer LNCS 256 (1987).
S. Safra and E. Shapiro. Meta Interpreters for Real. In H.-J. Kugler, editor, “Information Processing 86, Dublin, Ireland”, pages 271–278. North-Holland, Amsterdam (1986).
E. Y. Shaphiro. “Algorithmic Program Debugging”. The MIT Press, Cambridge, Massachusetts (1982). ACM Distinguished Dissertation.
J.R. Slagle. Automated Theorem-Proving for Theories with Simplifiers, Commutativity and Associativity. Journal of the ACM 21(4), 622–642 (1974).
J. Sparud and H. Nilsson. The architecture of a debugger for lazy functional languages. In M. Ducasse´, editor, “Proceedings of AADEBUG’95”, Saint-Malo, France (May 1995).
Peter Van Roy and Seif Haridi. “Concepts, Techniques, and Models of Computer Programming”. MIT Press (2004). ISBN 0-262-22069-5.
dc.rights.none.fl_str_mv Derechos de autor 2004 Revista Colombiana de Computación
dc.rights.coar.fl_str_mv http://purl.org/coar/access_right/c_abf2
dc.rights.uri.*.fl_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
dc.rights.uri.none.fl_str_mv http://creativecommons.org/licenses/by-nc-nd/2.5/co/
dc.rights.creativecommons.*.fl_str_mv Attribution-NonCommercial-ShareAlike 4.0 International
rights_invalid_str_mv Derechos de autor 2004 Revista Colombiana de Computación
http://creativecommons.org/licenses/by-nc-sa/4.0/
http://creativecommons.org/licenses/by-nc-nd/2.5/co/
Attribution-NonCommercial-ShareAlike 4.0 International
http://purl.org/coar/access_right/c_abf2
dc.format.mimetype.spa.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universidad Autónoma de Bucaramanga UNAB
publisher.none.fl_str_mv Universidad Autónoma de Bucaramanga UNAB
dc.source.none.fl_str_mv Revista Colombiana de Computación; Vol. 5 Núm. 2 (2004): Revista Colombiana de Computación; 1-21
institution Universidad Autónoma de Bucaramanga - UNAB
bitstream.url.fl_str_mv https://repository.unab.edu.co/bitstream/20.500.12749/9033/1/2004_Articulo_Un%20depurador%20abstracto%2c%20inductivo%20y%20param%c3%a9trico%20para%20programas%20multiparadigma.pdf
https://repository.unab.edu.co/bitstream/20.500.12749/9033/2/2004_Articulo_Un%20depurador%20abstracto%2c%20inductivo%20y%20param%c3%a9trico%20para%20programas%20multiparadigma.pdf.jpg
bitstream.checksum.fl_str_mv f346730a360442f8298b6a428b0e896b
f963702207f60c5ad4bfdea6cb333c73
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
repository.name.fl_str_mv Repositorio Institucional | Universidad Autónoma de Bucaramanga - UNAB
repository.mail.fl_str_mv repositorio@unab.edu.co
_version_ 1814278180370907136
spelling Alpuente Frasnedo, María105401f0-5c22-4bb9-84c1-13e625dd8833-1Correa Zabala, Francisco Joséb499813c-4d6c-4e84-ac97-ac85a8ab9ecc-1Correa Zabala, Francisco José [0000021172]Alpuente Frasnedo, María [0000-0002-9268-1178]Correa Zabala, Francisco José [0000-0002-5862-3169]Alpuente Frasnedo, María [Maria-Alpuente]Correa Zabala, Francisco José [Francisco-Correa-Zabala]2020-10-27T00:21:16Z2020-10-27T00:21:16Z2004-12-012539-21151657-2831http://hdl.handle.net/20.500.12749/9033instname:Universidad Autónoma de Bucaramanga UNABrepourl:https://repository.unab.edu.coPresentamos un marco general para el diagnóstico abstracto de programas lógico- funcionales, válido para diferentes estrategias de estrechamiento. Asociamos a cada programa una semántica por punto fijo que modela las respuestas computadas. Nuestra metodología está basada en la interpretación abstracta y es paramétrica con respecto a la estrategia de cómputo. Gracias a que la aproximación del conjunto de éxitos que presentamos es finita, la metodología de diagnóstico que se propone puede ser usada de manera estática. Una implementación de nuestro sistema de depuración \BUGGY" demuestra experimentalmente que el método permite encontrar algunos errores comunes sobre una muestra amplia de programas.We present a general framework for the abstract diagnosis of logic-functional programs, valid for different narrowing strategies. We associate to each program a fixed point semantics that models the computed responses. Our methodology is based on abstract interpretation and is parametric with respect to the computation strategy. Thanks to the fact that the approximation of the set of successes that we present is finite, the diagnostic methodology that is proposed can be used in a static way. An implementation of our \BUGGY" debugging system experimentally demonstrates that the method allows finding some common bugs on a wide sample of programs.application/pdfspaUniversidad Autónoma de Bucaramanga UNABhttps://revistas.unab.edu.co/index.php/rcc/article/view/1073/1045https://revistas.unab.edu.co/index.php/rcc/article/view/1073M. Alpuente, D. Ballis, F. Correa, and M. Falaschi. A Multi Paradigm Automatic Correction Scheme. In “Proc. of 11th Int’l Workshop on Functional and (Constraint) Logic Programming” (2002).M. Alpuente, D. Ballis, F. Correa, and M. Falaschi. The System for Automatic Correction nobug. Technical Report, UPV (2002). Available at URL: http://www.dsic.upv.es/users/elp/papers.html.M. Alpuente, D. Ballis, F. Correa, and M. Falaschi. Correction of functional logic program. In P. Degano, editor, “Programming Languages and Systems: 12th European Symposium on Programming, ESOP 2003, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003, Warsaw, Poland, April 7-11, 2003.”, volume 2618 / 2003 of “Lecture Notes in Computer Science”. SpringerVerlag Heidelberg (2003).M. Alpuente, F. Correa, and M. Falaschi. Declarative debugging framework for functional logic programs.M. Alpuente, F. Correa, and M. Falaschi. Declarative Debugging of Funtional Logic Programs. In B. Gramlich and S. Lucas, editors, “Proc. of the International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2001)”, volume 57 of “Electronic Notes in Theoretical Computer Science”. Elsevier Science Publishers (2001).M. Alpuente, F. Correa, and M. Falaschi. Debugging Scheme of Functional Logic Programs. In M. Hanus, editor, “Proc. of International Workshop on Functional and (Constraint) Logic Programming, WFLP’01”, volume 64 of “Electronic Notes in Theoretical Computer Science”. Elsevier Science Publishers (2002).M. Alpuente, F. Correa, M. Falaschi, and S. Marson. The Debugging System buggy. Technical Report, UPV (2001). Available at URL: http://www.dsic.upv.es/users/elp/soft.html.M. Alpuente, M. Falaschi, and F. Manzo. Analyses of Unsatisfiability for Equational Logic Programming. Journal of Logic Programming 22(3), 221–252 (1995).M. Alpuente, M. Falaschi, and G. Vidal. A Compositional Semantic Basis for the Analysis of Equational Horn Programs. Theoretical Computer Science 165(1), 97–131 (1996).S. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. In “Proc. 21st ACM Symp. on Principles of Programming Languages, Portland”, pages 268–279, New York (1994). ACM Press.K. R. Apt. Introduction to Logic Programming. In J. van Leeuwen, editor, “Handbook of Theoretical Computer Science”, volume B: Formal Models and Semantics. Elsevier, Amsterdam and The MIT Press, Cambridge, Mass. (1990).J. Boye, W. Drabent, and J. Maluszynski ´ . Declarative diagnosis of constraint programs: an assertion-based approach. In “Proc. of the 3rd Int’l Workshop on Automated Debugging - AADEBUG’97”, pages 123–141, Linkoping, Sweden (May 1997). U. of Linkoping Press.F. Bueno, P. Deransart, W. Drabent, G. Ferrand, M Hermenegildo, J. Maluszynski, and G. Puebla ´ . On the role of semantic approximations in validation and diagnosis of constraint logic programs. In “Proc. of the 3rd. Int’l Workshop on Automated Debugging-AADEBUG’97”, pages 155–170. U. of Linkoping Press (1997).M. Codish, M. Falaschi, and K. Marriott. Suspension Analysis for Concurrent Logic Programs. In K. Furukawa, editor, “Proc. of Eighth Int’l Conf. on Logic Programming”, pages 331–345. The MIT Press, Cambridge, MA (1991).M. Comini, G. Levi, M. Meo, and G. Vitiello. Proving Properties of Logic Programs by Abstract Diagnosis. In M. Dams, editor, “Analysis and Verification of Multiple-Agent Languages, 5th LOMAPS Workshop”, volumeM. Comini, G. Levi, M. C. Meo, and G. Vitiello. Abstract diagnosis. Journal of Logic Programming 39(1-3), 43–93 (1999).M. Comini, G. Levi, and G. Vitiello. Abstract Debugging of Logic Programs. In L. Fribourg and F. Turini, editors, “Proc. Logic Program Synthesis and Transformation and Metaprogramming in Logic 1994”, volume 883 of “Lecture Notes in Computer Science”, pages 440–450. Springer-Verlag, Berlin (1994).M. Comini, G. Levi, and G. Vitiello. Declarative Diagnosis Revisited. In John W. Lloyd, editor, “Proceedings of the 1995 Int’l Symposium on Logic Programming”, pages 275–287. The MIT Press (1995).M. Comini, G. Levi, and G. Vitiello. Efficient detection of incompleteness errors in the abstract debugging of logic programs. In M. Ducasse´, editor, “Proc. 2nd International Workshop on Automated and Algorithmic Debugging, AADEBUG’95” (1995).F. Correa. “Depuraci´on Declarativa de Programas L´ogico Funcionales”. PhD thesis, Universidad Polit´ecnica de Valencia (2002). ISBN 84-688-5981-8.P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. In “Proc. of Fourth ACM Symp. on Principles of Programming Languages”, pages 238–252 (1977).N. Dershowitz and Y. Lee. Deductive Debugging. In “Proceedings of the Fourth IEEE Symposium on Logic Programming”, pages 298–306, San Francisco, California (August 1987).W. Drabent, S.Nadjim-Tehrani, and J. Maluszynski ˜ . The use of assertions in algorithmic debugging. In “Proceedings of the 1988 Iinternational Conference on Fifth Generation Computer Systems”, pages 573–581, Tokyo, Japan (December 1988).R. Echahed. On completeness of narrowing strategies. In “Proc. of CAAP’88”, pages 89–101. Springer LNCS 299 (1988).A. Edman and S. Tarnlund ¨ . Mechanization of an Oracle in a Debugging System. In “Proceedings of Eighth IJCAI”, pages 553–555, Karlsruhe, Germany (August 1983).M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. Declarative Modeling of the Operational Behavior of Logic Languages. Theoretical Computer Science 69(3), 289–318 (1989).M. Falaschi, G. Levi, M. Martelli, and C. Palamidessi. A Model-Theoretic Reconstruction of the Operational Semantics of Logic Programs. Information and Computation 103(1), 86–113 (1993).M. Fay. First Order Unification in an Equational Theory. In “Proc of 4th Int’l Conf. on Automated Deduction”, pages 161–167 (1979).G. Ferrand. Error Diagnosis in Logic Programming, and Adaptation of E.Y.Shapiro’s Method. Journal of Logic Programming 4(3), 177–198 (1987).G. Ferrand and A. Tessier. Declarative Debugging. The Newsletter of the European Network in Computational Logic 3(1), 71–76 (1996).L. Fribourg. SLOG: a logic programming language interpreter based on clausal superposition and rewriting. In “Proc. of Second IEEE Int’l Symp. on Logic Programming”, pages 172–185. IEEE, New York (1985).M. Hanus. Combining Lazy Narrowing with Simplification. In “Proc. of 6th Int’l Symp. on Programming Language Implementation and Logic Programming”, pages 370–384. Springer LNCS 844 (1994).M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming 19&20, 583–628 (1994).M. Hanus. Towards the Global Optimization of Functional Logic Programs. In “Proc. of Fifth Int’l Conf. on Compiler Construction”, pages 68–82. Springer LNCS 786 (1994).S. Holldobler ¨ . “Foundations of Equational Logic Programming”. Springer LNAI 353 (1989).J. M. Hullot. Canonical Forms and Unification. In “Proc of 5th Int’l Conf. on Automated Deduction”, pages 318–334. Springer LNCS 87 (1980).T. Kanamori, T. Kawamura, M. Maeji, and K. Horiuchi. Logic Program Diagnosis Specification. Icot technical report tr-447, Institute for New Generation Computer Technology, Tokyo, Japan (March 1989).R. A. Kowalski. Predicate Logic as a Programming Language. In “Information Processing 74”, pages 569–574. North-Holland (1974).R. A. Kowalski. “Logic for Problem Solving”. North-Holland (1979).J. L. Lassez, M. J. Maher, and K. Marriott. Unification Revisited. In J. Minker, editor, “Foundations of Deductive Databases and Logic Programming”, pages 587–625. Morgan Kaufmann, Los Altos, Ca. (1988).J. W. Lloyd. Declarative error diagnosis. New Generation Computing 2(2), 133–154 (1987).J. W. Lloyd. “Foundations of Logic Programming”. Springer-Verlag, Berlin (1987). Second edition.M. J. Maher. Complete Axiomatizations of the Algebras of Finite, Rational and Infinite Trees. In “Proc. of Third IEEE Symp. on Logic In Computer Science”, pages 348–357. Computer Science Press, New York (1988).M. J. Maher. On Parameterized Substitutions. Technical Report RC 16042, IBM - T.J. Watson Research Center, Yorktown Heights, NY (1990).A. Middeldorp and E. Hamoen. Completeness Results for Basic Narrowing. Applicable Algebra in Engineering, Communication and Computing 5, 213–253 (1994).J.J. Moreno-Navarro and M. Rodr´ıguez-Artalejo. Logic Programming with Functions and Predicates: The language Babel. Journal of Logic Programming 12(3), 191–224 (1992).L. Naish. Declarative Debugging of Lazy Functional Programs. Australian Computer Science Communications 15(1), 287–294 (1993).L. Naish. A Declarative Debugging Scheme. Technical report 95/1, Department of Computer Science, University of Melbourne, Melbourne, Australia (February 1995).L. Naish and T. Barbour. Declarative Debugging of a Logical-Functional Language. Technical report 94/30, Department of Computer Science, University of Melbourne, Melbourne, Australia (December 1994).L. Naish and T. Barbour. Towards a portable lazy functional declarative debugger. Technical Report, Department of Computer Science, University of Melbourne, Melbourne, Australia (1995).C. Palamidessi. A fixpoint semantics for Guarded Horn Clauses. Technical Report CS-R8833, Centre for Mathematics and Computer Science, Amsterdam (1988).R. Plasmeijer and M. van Eekelen. “Functional Programming and Parallel Graph Rewriting.” Addison Wesley (1993).G. Plotkin. A structured approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University (1981).C. Reade. “Elements of Functional Programming”. Addison-Wesley Publishing Company (1993).U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In “Proc. of Second IEEE Int’l Symp. on Logic Programming”, pages 138–151. IEEE, New York (1985).P. Rety ´ . Improving basic narrowing techniques. In “Proc. of the Conf. on Rewriting Techniques and Applications”, pages 228–241. Springer LNCS 256 (1987).S. Safra and E. Shapiro. Meta Interpreters for Real. In H.-J. Kugler, editor, “Information Processing 86, Dublin, Ireland”, pages 271–278. North-Holland, Amsterdam (1986).E. Y. Shaphiro. “Algorithmic Program Debugging”. The MIT Press, Cambridge, Massachusetts (1982). ACM Distinguished Dissertation.J.R. Slagle. Automated Theorem-Proving for Theories with Simplifiers, Commutativity and Associativity. Journal of the ACM 21(4), 622–642 (1974).J. Sparud and H. Nilsson. The architecture of a debugger for lazy functional languages. In M. Ducasse´, editor, “Proceedings of AADEBUG’95”, Saint-Malo, France (May 1995).Peter Van Roy and Seif Haridi. “Concepts, Techniques, and Models of Computer Programming”. MIT Press (2004). ISBN 0-262-22069-5.Derechos de autor 2004 Revista Colombiana de Computaciónhttp://creativecommons.org/licenses/by-nc-sa/4.0/http://creativecommons.org/licenses/by-nc-nd/2.5/co/Attribution-NonCommercial-ShareAlike 4.0 Internationalhttp://purl.org/coar/access_right/c_abf2Revista Colombiana de Computación; Vol. 5 Núm. 2 (2004): Revista Colombiana de Computación; 1-21Innovaciones tecnológicasCiencia de los computadoresDesarrollo de tecnologíaIngeniería de sistemasInvestigacionesTecnologías de la información y las comunicacionesTIC´sTechnological innovationsComputer scienceTechnology developmentSystems engineeringInvestigationsInformation and communication technologiesICT'sDeclarative debuggingAbstract diagnosisAbstract interpretationFunctional logic languageMulti-paradigm programmingOperational semanticsFixed point semanticsInnovaciones tecnológicasCiencias de la computaciónDesarrollo tecnológicoIngeniería de sistemasInvestigacionesTecnologías de la información y la comunicaciónDepuración declarativaDiagnostico abstractoInterpretación abstractaLenguaje lógico funcionalProgramación multiparadigmaSemántica operacionalSemántica de punto fijoUn depurador abstracto, inductivo y paramétrico para programas multiparadigmaAn abstract, inductive, and parametric debugger for multi-paradigm programsinfo:eu-repo/semantics/articleArtículohttp://purl.org/coar/resource_type/c_7a1fhttp://purl.org/coar/resource_type/c_2df8fbb1http://purl.org/redcol/resource_type/CJournalArticleORIGINAL2004_Articulo_Un depurador abstracto, inductivo y paramétrico para programas multiparadigma.pdf2004_Articulo_Un depurador abstracto, inductivo y paramétrico para programas multiparadigma.pdfArtículoapplication/pdf318137https://repository.unab.edu.co/bitstream/20.500.12749/9033/1/2004_Articulo_Un%20depurador%20abstracto%2c%20inductivo%20y%20param%c3%a9trico%20para%20programas%20multiparadigma.pdff346730a360442f8298b6a428b0e896bMD51open accessTHUMBNAIL2004_Articulo_Un depurador abstracto, inductivo y paramétrico para programas multiparadigma.pdf.jpg2004_Articulo_Un depurador abstracto, inductivo y paramétrico para programas multiparadigma.pdf.jpgIM Thumbnailimage/jpeg7338https://repository.unab.edu.co/bitstream/20.500.12749/9033/2/2004_Articulo_Un%20depurador%20abstracto%2c%20inductivo%20y%20param%c3%a9trico%20para%20programas%20multiparadigma.pdf.jpgf963702207f60c5ad4bfdea6cb333c73MD52open access20.500.12749/9033oai:repository.unab.edu.co:20.500.12749/90332024-04-15 16:29:01.323open accessRepositorio Institucional | Universidad Autónoma de Bucaramanga - UNABrepositorio@unab.edu.co

Publicaciones similares