An integrated framework for the diagnosis and correction of rule-based programs
From MaRDI portal
Publication:604477
DOI10.1016/j.tcs.2010.07.009zbMath1205.68113OpenAlexW2075067317WikidataQ57978166 ScholiaQ57978166MaRDI QIDQ604477
F. Correa, Demis Ballis, María Alpuente, Moreno Falaschi
Publication date: 11 November 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.07.009
Related Items (2)
Abstract Diagnosis of First Order Functional Logic Programs ⋮ A Logical Framework for Debugging in Declarative Constraint Programming
Uses Software
Cites Work
- Characterizing and proving operational termination of deterministic conditional term rewriting systems
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Declarative modeling of the operational behavior of logic languages
- A compact fixpoint semantics for term rewriting systems
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Narrowing vs. SLD-resolution
- Deductive and inductive synthesis of equational programs
- ELAN from a rewriting logic point of view
- Foundations of equational logic programming
- A model-theoretic reconstruction of the operational semantics of logic programs
- Kima: An automated error correction system for concurrent logic programs
- Rules + strategies for transforming lazy functional logic programs
- Termination of term rewriting using dependency pairs
- Algebraic and logic programming. Third international conference, ALP '92, Volterra, Italy, September 2--4, 1992. Proceedings
- Kernel-LEAF: A logic plus functional language
- Evaluation Strategies for Functional Logic Programming
- Declarative Debugging of Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Accóon Integrada Hispano-Italiana HI2000-0161 and by Generalitat Valenciana under grant GV01-424.
- A Declarative Debugging System for Lazy Functional Logic Programs
- Abstract Diagnosis of First Order Functional Logic Programs
- Abstract Diagnosis of Functional Programs
- A needed narrowing strategy
- Effectively Checking the Finite Variant Property
- Transformation and Debugging of Functional Logic Programs
- Multi-paradigm Declarative Languages
- Error diagnosis in logic programming an adaptation of E.Y. Shapiro's method
- Logic programming with functions and predicates: The language Babel
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Higher-order narrowing with definitional trees
- Induction of logic programs by example-guided unfolding
- The s-semantics approach: Theory and applications
- Transformation of logic programs: Foundations and techniques
- The integration of functions into logic programming: From theory to practice
- Inductive Logic Programming: Theory and methods
- Analyses of unsatisfiability for equational logic programming
- Uniform Lazy Narrowing
- Abstract diagnosis
- Assertion based Inductive Verification Methods for Logic Programs
- Order-Sorted Generalization
- A Declarative Debugger for Maude Functional Modules
- Variant Narrowing and Equational Unification
- Declarative Debugging of Missing Answers for Maude.
- Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming
- Termination of Narrowing Using Dependency Pairs
- Sufficient conditions for modular termination of conditional term rewriting systems
- Inductive logic programming
- Verification of Erlang processes by dependency pairs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An integrated framework for the diagnosis and correction of rule-based programs
