A New Proposal for Debugging Datalog Programs

Caballero, Rafael; García-Ruiz, Yolanda; Sáenz-Pérez, Fernando

doi:10.1016/j.entcs.2008.06.035

Cited by 6 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In principle, one could also think of a kind of logical statements somewhat similar to acas, but asserting the equality of the observed and expected sets of computed answers for one and the same goal with a finite search space. We have not developed this idea, which could support the declarative diagnosis of a third kind of unexpected results, namely incorrect answer sets as done for Datalog [5]. In fact, we think that a separate diagnosis of wrong and missing answers is pragmatically more convenient for users of CF LP languages.…”

Section: Discussionmentioning

confidence: 99%

“…'), nl. As the example shows, the code for each function now displays information about the values of the arguments and the contents of the constraint store at the moment of using any user defined function (lines [4][5]. Then the predicate corresponding to the original function, now renamed with the Bis suffix, is called (line 7).…”

Section: Implementation In the Toy Systemmentioning

confidence: 99%

See 1 more Smart Citation

Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming

Caballero¹,

Artalejo²,

Vírseda³

2008

Functional and Logic Programming

View full text Add to dashboard Cite

Abstract. We present a declarative method for diagnosing missing computed answers in CF LP (D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instantiated by any constraint domain D given as parameter. As far as we know, declarative diagnosis of missing answers in such an expressive framework has not been tackled before. Our approach combines and extends previous work done separately for constraint logic programming and lazy functional programming languages. Diagnosis can be started whenever a user finds that the set of computed answers for a given goal with finite search space misses some expected solution w.r.t. an intended interpretation of the program, that provides a declarative description of its expected behavior. Diagnosis proceeds by exploring a proof tree, that provides a declarative view of the answer-collection process performed by the computation, and it ends up with the detection of some function definition in the program that is incomplete w.r.t. the intended interpretation. We can prove the logical correctness of the diagnosis method under the assumption that the recollection of computed answers performed by the goal solving system can be represented as a proof tree. We argue the plausibility of this assumption, and we describe the prototype of a tool which implements the diagnosis method.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Implementation In the Toy Systemmentioning

confidence: 99%

Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming

Caballero¹,

Artalejo²,

Vírseda³

2008

Functional and Logic Programming

View full text Add to dashboard Cite

show abstract

“…Our proposal contains, to our knowledge, the first explicit and formally defined value-focused static analysis and associated optimization for Datalog. Altough the idea was previously toyed with in [8,31] as a debugging tool, our work is also, still to our knowledge, the first formalization of a Datalog trace semantics, not to mention a certified one.…”

Section: Related Workmentioning

confidence: 99%

Developing and certifying Datalog optimizations in coq/mathcomp

Bégay

Crégut

Monin

2021

Proceedings of the 10th ACM SIGPLAN International Conference on Certified Programs and Proofs

View full text Add to dashboard Cite

We introduce a static analysis and two program transformations for Datalog to circumvent performance issues that arise with the implementation of primitive predicates, notably in the framework of a large scale telecommunication application. To this effect, we introduce a new trace semantics for Datalog with a verified mechanization. This work can be seen as both a first step and a proof of concept for the creation of a full-blown library of verified Datalog optimizations, on top of an existing Coq/MathComp formalization of Datalog [5,14] towards the development of a realistic environment for certified data-centric applications. CCS Concepts: • Security and privacy → Logic and verification; • Theory of computation → Program analysis; • Networks → Network dynamics.

show abstract

“…In [11] we proposed a novel way of applying declarative debugging (also called algorithmic debugging, a term first coined in the logic programming field by E.H. Shapiro [12]), to Datalog programs. In that work, we introduced the notion of computation graphs (shortly CGs) as a suitable structure for representing and debugging Datalog computations.…”

Section: Introductionmentioning

confidence: 99%

A Theoretical Framework for the Declarative Debugging of Datalog Programs

Caballero

García-Ruiz

Sáenz-Pérez

2008

Semantics in Data and Knowledge Bases

Self Cite

View full text Add to dashboard Cite

Abstract. The logic programming language Datalog has been extensively researched as a query language for deductive databases. Although similar to Prolog, the Datalog operational mechanisms are more intricate, leading to computations quite hard to debug by traditional approaches. In this paper, we present a theoretical framework for debugging Datalog programs based on the ideas of declarative debugging. In our setting, a debugging session starts when the user detects an unexpected answer for some query, and ends with the debugger pointing to either an erroneous predicate or to a set of mutually recursive predicates as the cause of the unexpected answer. Instead of representing the computations by means of trees, as usual in declarative debugging, we propose graphs as a more convenient structure in the case of Datalog, proving formally the soundness and completeness of the debugging technique. We also present a debugging tool implemented in the publicly available deductive database system DES following this theoretical framework.

show abstract

A New Proposal for Debugging Datalog Programs

Cited by 6 publications

References 6 publications

Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming

Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming

Developing and certifying Datalog optimizations in coq/mathcomp

A Theoretical Framework for the Declarative Debugging of Datalog Programs

Contact Info

Product

Resources

About