Abstract
Debugging tools are a practical need for diagnosing the causes of erroneous computations. Declarative programming paradigms involving complex operational details, such as constraint solving and lazy evaluation, do not fit well to traditional debugging techniques relying on the inspection of low-level computation traces. As a solution to this problem, declarative diagnosis uses Computation Trees (shortly, CTs) in place of traces. CTs are built a posteriori to represent the structure of a computation whose top level outcome is regarded as an error symptom by the user. Each node in a CT represents the computation of some observable result, depending on the results of its children nodes. Declarative diagnosis explores a CT looking for a so-called buggy node which computes an incorrect result from children whose results are correct; such a node must point to an incorrect program fragment. The search for a buggy node can be implemented with the help of an external oracle (usually the user with some semiautomatic support) who has a reliable declarative knowledge of the expected program semantics, the so-called intended interpretation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Caballero, R.: Declarative Debugger of Incorrect Answers for Constraint Functional-Logic Programs. In: Proc. WCFLP 2005, ACM SIGPLAN, pp. 8–13 (2005)
Caballero, R., Rodríguez-Artalejo, M.: A Declarative Debugging System for Lazy Functional Logic Programs. In: ENTCS, vol. 64, 63 pages (2002)
Caballero, R., Rodríguez-Artalejo, M.: \(\mathcal{DDT}\). In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol. 2998, pp. 70–84. Springer, Heidelberg (2004)
Ferrand, G., Lesaint, W., Tessier, A.: Towards declarative diagnosis of constraint programs over finite domains. ArXiv Computer Science e-prints (2003)
Hermenegildo, M., Puebla, G., Bueno, F., López-García, P.: Abstract Verification and Debugging of Constraint Logic Programs. In: Proc. CSCLP 2002, pp. 1–14 (2002)
López-Fraguas, F.J., Rodríguez-Artalejo, M., del Vado-Vírseda, R.: A New Generic Scheme for Functional Logic Programming with Constraints. Journal Higher-Order and Symbolic Computation (to appear, 2006) Extended version of Constraint Functional Logic Programming Revisited, WRLA 2004, ENTCS 117, pp. 5–50 (2005)
Fraguas, F.J.L., Hernández, J.S.: TOY: A Multiparadigm Declarative System. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 244–247. Springer, Heidelberg (1999), http://toy.sourceforge.net
Naish, L.: A Declarative Debugging Scheme. Journal of Functional and Logic Programming (1997-3)
Pope, B., Naish, L.: Practical aspects of declarative debugging in Haskell 98. In: Proc. PPDP 2003, pp. 230–240. ACM Press, New York (2003)
Shapiro, E.Y.: Algorithmic Program Debugging. The MIT Press, Cambridge (1982)
Tessier, A., Ferrand, G.: Declarative Diagnosis in the CLP Scheme, ch. 5. LNCS, vol. 1870, pp. 151–174. Springer, Heidelberg (2000)
del Vado Vírseda, R.: Declarative Constraint Programming with Definitional Trees. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol. 3717, pp. 184–199. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Caballero, R., Artalejo, M.R., del Vado Vírseda, R. (2006). Declarative Diagnosis of Wrong Answers in Constraint Functional-Logic Programming. In: Etalle, S., Truszczyński, M. (eds) Logic Programming. ICLP 2006. Lecture Notes in Computer Science, vol 4079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11799573_31
Download citation
DOI: https://doi.org/10.1007/11799573_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36635-5
Online ISBN: 978-3-540-36636-2
eBook Packages: Computer ScienceComputer Science (R0)