Modular Termination of Basic Narrowing
From MaRDI portal
Publication:3522005
DOI10.1007/978-3-540-70590-1_1zbMATH Open1145.68439DBLPconf/rta/AlpuenteEI08OpenAlexW1504504569WikidataQ57978201 ScholiaQ57978201MaRDI QIDQ3522005FDOQ3522005
Santiago Escobar, José Iborra, María Alpuente
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Termination of term rewriting using dependency pairs
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Counterexamples to termination for the direct sum of term rewriting systems
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
- Foundations of Software Science and Computation Structures
- Completeness results for basic narrowing
- Foundations of equational logic programming
- The integration of functions into logic programming: From theory to practice
- Incremental constraint satisfaction for equational logic programming
- On modularity in term rewriting and narrowing
- Modular proofs for completeness of hierarchical term rewriting systems
- Modular and incremental automated termination proofs
- Termination of narrowing revisited
- Modular Termination of Basic Narrowing
Cited In (4)
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)
