Context-Sensitive Dependency Pairs-Reference-Cited by-同舟云学术

Context-Sensitive Dependency Pairs

Published:2006 Issue: Volume: Page:297-308
ISSN:0302-9743
Container-title:FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science
language:
Short-container-title:

Author:

Alarcón Beatriz,Gutiérrez Raúl,Lucas Salvador

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11944836_28.pdf

Reference20 articles.

1. Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236, 133–178 (2000)

2. Alarcón, B., Gutiérrez, R., Iborra, J., Lucas, S.: Proving Termination of Context-Sensitive Rewriting with MU-TERM. Electronic Notes in Theoretical Computer Science (to appear, 2007)

3. LNAI;C. Borralleras,2002

4. Durán, F., Lucas, S., Meseguer, J., Marché, C., Urbain, X.: Proving Operational Termination of Membership Equational Programs. Higher-Order and Symbolic Computation (to appear, 2006)

5. Giesl, J., Arts, T., Ohlebusch, E.: Modular Termination Proofs for Rewriting Using Dependency Pairs. Journal of Symbolic Computation 34(1), 21–58 (2002)

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

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

2. Automated termination proofs for haskell by term rewriting;ACM Transactions on Programming Languages and Systems;2011-01

3. Transforming Outermost into Context-Sensitive Rewriting;Logical Methods in Computer Science;2010-06-29

4. Proving Termination in the Context-Sensitive Dependency Pair Framework;Rewriting Logic and Its Applications;2010

5. Termination of Context-Sensitive Rewriting with Built-In Numbers and Collection Data Structures;Functional and Constraint Logic Programming;2010