Article

Context-sensitive dependency pairs

Authors:

Beatriz Alarcón,

Raúl Gutiérrez,

Salvador LucasAuthors Info & Claims

FSTTCS'06: Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science

Pages 297 - 308

https://doi.org/10.1007/11944836_28

Published: 13 December 2006 Publication History

Abstract

Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although there is a good number of techniques for proving termination of context-sensitive rewriting (CSR), the dependency pair approach, one of the most powerful techniques for proving termination of rewriting, has not been investigated in connection with proofs of termination of CSR. In this paper, we show how to use dependency pairs in proofs of termination of CSR. The implementation and practical use of the developed techniques yield a novel and powerful framework which improves the current state-of-the-art of methods for proving termination of CSR.

References

[1]

T. Arts and J. Giesl. Termination of Term Rewriting Using Dependency Pairs Theoretical Computer Science, 236:133-178, 2000.

Digital Library

[2]

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

Digital Library

[3]

C. Borralleras, S. Lucas, and A. Rubio. Recursive Path Orderings can be Context-Sensitive. In Proc. of CADE'02, LNAI 2392:314-331, Springer-Verlag, Berlin, 2002.

Digital Library

[4]

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

Digital Library

[5]

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

Digital Library

[6]

B. Gramlich and S. Lucas. Simple termination of context-sensitive rewriting. In Proc. of RULE'02, pages 29-41, ACM Press, New York, 2002.

Digital Library

[7]

J. Giesl and A. Middeldorp. Transforming Context-Sensitive Rewrite Systems. In Proc. of RTA'99, LNCS 1631:271-285, Springer-Verlag, Berlin, 1999.

Digital Library

[8]

J. Giesl and A. Middeldorp. Transformation techniques for context-sensitive rewrite systems. Journal of Functional Programming, 14(4): 379-427, 2004.

Digital Library

[9]

J. Giesl, R. Thiemann, and P. Schneider-Kamp. The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. In Proc. of LPAR'04, LNCS 3452:301-331, Springer-Verlag, Berlin, 2004.

[10]

N. Hirokawa and A. Middeldorp. Dependency Pairs Revisited. In Proc. of RTA'04, LNCS 3091:249-268, Springer-Verlag, Berlin, 2004.

[11]

N. Hirokawa and A. Middeldorp. Automating the dependency pair method. Information and Computation, 199:172-199, 2005.

Digital Library

[12]

S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1):1-61, January 1998.

[13]

S. Lucas. Context-sensitive rewriting strategies. Information and Computation, 178(1):293-343, 2002.

Digital Library

[14]

S. Lucas. MU-TERM: A Tool for Proving Termination of Context-Sensitive Rewriting In Proc. of RTA'04, LNCS 3091:200-209, Springer-Verlag, Berlin, 2004. Available at http://www.dsic.upv.es/~slucas/csr/termination/muterm.

[15]

S. Lucas. Polynomials for proving termination of context-sensitive rewriting. In Proc. of FOSSACS'04, LNCS 2987:318-332, Springer-Verlag, Berlin 2004.

[16]

S. Lucas. Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theoretical Informatics and Applications, 39(3):547-586, 2005.

[17]

S. Lucas. Proving termination of context-sensitive rewriting by transformation. Information and Computation, to appear 2006.

Digital Library

[18]

E. Ohlebusch. Advanced Topics in Term Rewriting. Springer-Verlag, Berlin, 2002.

Digital Library

[19]

TeReSe, editor, Term Rewriting Systems, Cambridge University Press, 2003.

[20]

H. Zantema. Termination of Context-Sensitive Rewriting. In Proc. of RTA'97, LNCS 1232:172-186, Springer-Verlag, Berlin, 1997.

Digital Library

Cited By

Giesl JRaffelsieper MSchneider-Kamp PSwiderski SThiemann R(2011)Automated termination proofs for haskell by term rewritingACM Transactions on Programming Languages and Systems (TOPLAS)10.1145/1890028.189003033:2(1-39)Online publication date: 7-Feb-2011
https://dl.acm.org/doi/10.1145/1890028.1890030
Gutiérrez RLucas S(2010)Proving termination in the context-sensitive dependency pair frameworkProceedings of the 8th international conference on Rewriting logic and its applications10.5555/1927806.1927811(18-34)Online publication date: 20-Mar-2010
https://dl.acm.org/doi/10.5555/1927806.1927811
Contejean ÉPaskevich AUrbain XCourtieu PPons OForest JGallagher JVoigtländer J(2010)A3PAT, an approach for certified automated termination proofsProceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation10.1145/1706356.1706370(63-72)Online publication date: 19-Jan-2010
https://dl.acm.org/doi/10.1145/1706356.1706370
Show More Cited By

Context-sensitive dependency pairs
1. Mathematics of computing
  1. Continuous mathematics
    1. Calculus
2. Theory of computation

Recommendations

Context-sensitive dependency pairs

Termination is one of the most interesting problems when dealing with context-sensitive rewrite systems. Although a good number of techniques for proving termination of context-sensitive rewriting (CSR) have been proposed so far, the adaptation to CSR ...
Relative Termination via Dependency Pairs

A term rewrite system is terminating when no infinite reduction sequences are possible. Relative termination generalizes termination by permitting infinite reductions as long as some distinguished rules are not applied infinitely many times. Relative ...
Proving termination of context-sensitive rewriting by transformation

Context-sensitive rewriting (CSR) is a restriction of rewriting that forbids reductions on selected arguments of functions. With CSR, we can achieve a terminating behavior with non-terminating term rewriting systems, by pruning (all) infinite rewrite ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

FSTTCS'06: Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science

December 2006

430 pages

ISBN:3540499946

Editors:
S. Arun-Kumar
Department of Computer Science and Engineering, Indian Institute of Technology Delhi, New Delhi, India
,
Naveen Garg
Department of Computer Science and Engineering, Indian Institute of Technology, Delhi, India

Sponsors

Indian Statistical Institute, Kolkata: Indian Statistical Institute, Kolkata
IARCS: Indian Association for Research in Computing Science
Indian Institute of Technology, Delhi: Indian Institute of Technology, Delhi

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 13 December 2006

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

9
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Giesl JRaffelsieper MSchneider-Kamp PSwiderski SThiemann R(2011)Automated termination proofs for haskell by term rewritingACM Transactions on Programming Languages and Systems (TOPLAS)10.1145/1890028.189003033:2(1-39)Online publication date: 7-Feb-2011
https://dl.acm.org/doi/10.1145/1890028.1890030
Gutiérrez RLucas S(2010)Proving termination in the context-sensitive dependency pair frameworkProceedings of the 8th international conference on Rewriting logic and its applications10.5555/1927806.1927811(18-34)Online publication date: 20-Mar-2010
https://dl.acm.org/doi/10.5555/1927806.1927811
Contejean ÉPaskevich AUrbain XCourtieu PPons OForest JGallagher JVoigtländer J(2010)A3PAT, an approach for certified automated termination proofsProceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation10.1145/1706356.1706370(63-72)Online publication date: 19-Jan-2010
https://dl.acm.org/doi/10.1145/1706356.1706370
Lucas S(2009)Automatic Proofs of Termination With Elementary InterpretationsElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2009.12.004258:1(41-61)Online publication date: 1-Dec-2009
https://dl.acm.org/doi/10.1016/j.entcs.2009.12.004
Alarcón BLucas S(2009)Using Context-Sensitive Rewriting for Proving Innermost Termination of RewritingElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2009.07.055248(3-17)Online publication date: 1-Aug-2009
https://dl.acm.org/doi/10.1016/j.entcs.2009.07.055
Falke SKapur D(2009)Termination of context-sensitive rewriting with built-in numbers and collection data structuresProceedings of the 18th international conference on Functional and Constraint Logic Programming10.1007/978-3-642-11999-6_4(44-61)Online publication date: 28-Jun-2009
https://dl.acm.org/doi/10.1007/978-3-642-11999-6_4
Lucas SMeseguer JAntoy SAlbert E(2008)Order-sorted dependency pairsProceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming10.1145/1389449.1389463(108-119)Online publication date: 15-Jul-2008
https://dl.acm.org/doi/10.1145/1389449.1389463
Hirokawa NMiddeldorp A(2007)Tyrolean termination toolInformation and Computation10.1016/j.ic.2006.08.010205:4(474-511)Online publication date: 1-Apr-2007
https://dl.acm.org/doi/10.1016/j.ic.2006.08.010
Alarcón BLucas S(2007)Termination of Innermost Context-Sensitive Rewriting Using Dependency PairsProceedings of the 6th international symposium on Frontiers of Combining Systems10.1007/978-3-540-74621-8_5(73-87)Online publication date: 10-Sep-2007
https://dl.acm.org/doi/10.1007/978-3-540-74621-8_5

View Options

View options

Media

Figures

Other

Tables

View Table of Contents