Error diagnosis in logic programming, an adaptation of E.Y. Shapiro's method
Journal of Logic Programming
New Generation Computing
Computing in Horn clause theories
Computing in Horn clause theories
Equivalences of logic programs
Foundations of deductive databases and logic programming
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Handbook of logic in computer science (vol. 2)
A model-theoretic reconstruction of the operational semantics of logic programs
Information and Computation
From logic programming to Prolog
From logic programming to Prolog
ACM SIGPLAN Notices
Term rewriting and all that
Tracing piece by piece: affordable debugging for lazy functional languages
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming
QuickCheck: a lightweight tool for random testing of Haskell programs
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Functional Programming and Parallel Graph Rewriting
Functional Programming and Parallel Graph Rewriting
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Proving Properties of Logic Programs by Abstract Diagnosis
Selected papers from the 5th LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages
Call pattern analysis for functional logic programs
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Loop detection in term rewriting using the eliminating unfoldings
Theoretical Computer Science
Declarative Debugging of Membership Equational Logic Specifications
Concurrency, Graphs and Models
A Declarative Debugger for Maude Functional Modules
Electronic Notes in Theoretical Computer Science (ENTCS)
A Fully Abstract Semantics for Constructor Systems
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Termination of narrowing revisited
Theoretical Computer Science
Declarative diagnosis of temporal concurrent constraint programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
A compact fixpoint semantics for term rewriting systems
Theoretical Computer Science
An integrated framework for the diagnosis and correction of rule-based programs
Theoretical Computer Science
Transformation and debugging of functional logic programs
A 25-year perspective on logic programming
Enhancing the debugging of Maude specifications
WRLA'10 Proceedings of the 8th international conference on Rewriting logic and its applications
Abstract diagnosis of first order functional logic programs
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
A survey on algorithmic debugging strategies
Advances in Engineering Software
Hi-index | 0.00 |
We present a generic scheme for the declarative debugging of functional programs modeled as term rewriting systems. We associate to our programs a semantics based on a (continuous) immediate consequence operator, TR, which models the (values/normal forms) semantics of R. Then, we develop an effective debugging methodology which is based on abstract interpretation: by approximating the intended specification of the semantics of R we derive a finitely terminating bottom-up diagnosis method, which can be used statically. Our debugging framework does not require the user to either provide error symptoms in advance or answer questions concerning program correctness. We have made available a prototypical implementation in Haskell and have tested it on some non trivial examples.