Modular Termination of Basic Narrowing

DOI10.1007/978-3-540-70590-1_1zbMATH Open1145.68439DBLPconf/rta/AlpuenteEI08OpenAlexW1504504569WikidataQ57978201 ScholiaQ57978201MaRDI QIDQ3522005FDOQ3522005

Authors Santiago Escobar, María Alpuente, José Iborra

Publication date 28 August 2008

Published in Rewriting Techniques and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70590-1_1

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Modular termination of basic narrowing and equational unification
• scientific article; zbMATH DE number 4041327
• On modularity in term rewriting and narrowing
• Basic narrowing revisited
• Termination of narrowing revisited

Cites work

• scientific article; zbMATH DE number 1729952 (Why is no real title available?)
• scientific article; zbMATH DE number 4041327 (Why is no real title available?)
• scientific article; zbMATH DE number 4047065 (Why is no real title available?)
• scientific article; zbMATH DE number 3688776 (Why is no real title available?)
• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1889386 (Why is no real title available?)
• scientific article; zbMATH DE number 826301 (Why is no real title available?)
• A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
• Completeness results for basic narrowing
• Counterexamples to termination for the direct sum of term rewriting systems
• Foundations of Software Science and Computation Structures
• Foundations of equational logic programming
• Incremental constraint satisfaction for equational logic programming
• Modular Termination of Basic Narrowing
• Modular and incremental automated termination proofs
• Modular proofs for completeness of hierarchical term rewriting systems
• On modularity in term rewriting and narrowing
• Symbolic Model Checking of Infinite-State Systems Using Narrowing
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Termination of narrowing revisited
• Termination of term rewriting using dependency pairs
• The integration of functions into logic programming: From theory to practice

Cited in

(6)

• Modular termination of basic narrowing and equational unification
• Reviving basic narrowing modulo
• Modular Termination of Basic Narrowing
• Termination of Narrowing Using Dependency Pairs
• scientific article; zbMATH DE number 7453112 (Why is no real title available?)
• scientific article; zbMATH DE number 7455704 (Why is no real title available?)

This page was built for publication: Modular Termination of Basic Narrowing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522005)