Termination of Narrowing Using Dependency Pairs

DOI10.1007/978-3-540-89982-2_31zbMath1185.68218OpenAlexW1493847381WikidataQ57978208 ScholiaQ57978208MaRDI QIDQ5504664

Santiago Escobar, José Iborra, María Alpuente

Publication date: 22 January 2009

Published in: Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89982-2_31

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

An integrated framework for the diagnosis and correction of rule-based programs ⋮ Termination of narrowing via termination of rewriting ⋮ Termination of Narrowing Using Dependency Pairs

Uses Software

• AProVE
• MU-TERM

Cites Work

• Unnamed Item
• Unnamed Item
• A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
• Mechanizing and improving dependency pairs
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Termination of narrowing via termination of rewriting
• Termination of narrowing revisited
• Termination of term rewriting using dependency pairs
• Proving Termination of Context-Sensitive Rewriting with MU-TERM
• Modular Termination of Basic Narrowing
• The integration of functions into logic programming: From theory to practice
• Termination Analysis of Logic Programs Based on Dependency Graphs
• Termination of Narrowing Using Dependency Pairs
• Logic for Programming, Artificial Intelligence, and Reasoning
• Rewriting Techniques and Applications

This page was built for publication: Termination of Narrowing Using Dependency Pairs