Proving Termination in the Context-Sensitive Dependency Pair Framework-Reference-Cited by-同舟云学术

Proving Termination in the Context-Sensitive Dependency Pair Framework

Published:2010 Issue: Volume: Page:18-34
ISSN:0302-9743
Container-title:Rewriting Logic and Its Applications
language:
Short-container-title:

Author:

Gutiérrez Raúl,Lucas Salvador

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-16310-4_3

Reference21 articles.

1. Lucas, S.: Context-Sensitive Computations in Functional and Functional Logic Programs. Journal of Functional and Logic Programming (1), 1–61 (1998)

2. Bruni, R., Meseguer, J.: Semantic Foundations for Generalized Rewrite Theories. Theoretical Computer Science 360(1), 386–414 (2006)

3. Durán, F., Lucas, S., Marché, C., Meseguer, J., Urbain, X.: Proving Operational Termination of Membership Equational Programs. Higher-Order and Symbolic Computation 21(1-2), 59–88 (2008)

4. Lecture Notes in Computer Science;J. Endrullis,2009

5. Fernández, M.L.: Relaxing Monotonicity for Innermostt Termination. Information Processing Letters 93(3), 117–123 (2005)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Context-sensitive Rewriting;ACM Computing Surveys;2021-07-31

2. mu-term: Verify Termination Properties Automatically (System Description);Automated Reasoning;2020

3. Dependency pairs for proving termination properties of conditional term rewriting systems;Journal of Logical and Algebraic Methods in Programming;2017-01

4. Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting;Lecture Notes in Computer Science;2015

5. Rewriting logic bibliography by topic: 1990–2011;The Journal of Logic and Algebraic Programming;2012-10