A debugging scheme for functional logic programs
| dc.contributor.author | Alpuente, M. | |
| dc.contributor.author | Correa, F. | |
| dc.contributor.author | Falaschi, M. | |
| dc.contributor.department | Universidad EAFIT. Departamento de Ciencias | spa |
| dc.contributor.researchgroup | Lógica y Computación | spa |
| dc.creator | Alpuente, M. | |
| dc.creator | Correa, F. | |
| dc.creator | Falaschi, M. | |
| dc.date.accessioned | 2021-03-26T21:35:19Z | |
| dc.date.available | 2021-03-26T21:35:19Z | |
| dc.date.issued | 2002-01-01 | |
| dc.description.abstract | 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. | eng |
| dc.identifier | https://eafit.fundanetsuite.com/Publicaciones/ProdCientif/PublicacionFrw.aspx?id=1852 | |
| dc.identifier.doi | 10.1016/S1571-0661(04)80345-1 | |
| dc.identifier.issn | 15710661 | |
| dc.identifier.other | SCOPUS;2-s2.0-11244330102 | |
| dc.identifier.uri | http://hdl.handle.net/10784/27404 | |
| dc.language.iso | eng | eng |
| dc.publisher | Elsevier BV | |
| dc.relation.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-11244330102&doi=10.1016%2fS1571-0661%2804%2980345-1&partnerID=40&md5=1b22704031415fa4cb87dd1436495b35 | |
| dc.rights | https://v2.sherpa.ac.uk/id/publication/issn/1571-0661 | |
| dc.source | Electronic Notes In Theoretical Computer Science | |
| dc.subject.keyword | Approximation theory | eng |
| dc.subject.keyword | Computational complexity | eng |
| dc.subject.keyword | Computer programming languages | eng |
| dc.subject.keyword | Mathematical operators | eng |
| dc.subject.keyword | Program debugging | eng |
| dc.subject.keyword | Semantics | eng |
| dc.subject.keyword | Software engineering | eng |
| dc.subject.keyword | Functional logic programming | eng |
| dc.subject.keyword | Logic languages | eng |
| dc.subject.keyword | Program correctness | eng |
| dc.subject.keyword | Program specification | eng |
| dc.subject.keyword | Logic programming | eng |
| dc.title | A debugging scheme for functional logic programs | eng |
| dc.type | info:eu-repo/semantics/conferencePaper | eng |
| dc.type | conferencePaper | eng |
| dc.type | info:eu-repo/semantics/publishedVersion | eng |
| dc.type | publishedVersion | eng |
| dc.type.local | Documento de conferencia | spa |