Skip to main content
SpringerLink
Log in

Modularity of termination using dependency pairs

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1379))

Included in the following conference series:

Abstract

The framework of dependency pairs allows automated termination and innermost termination proofs for many TRSs where such proofs were not possible before. In this paper we present a refinement of this framework in order to prove termination in a modular way. Our modularity results significantly increase the class of term rewriting systems where termination resp. innermost termination can be proved automatically. Moreover, the modular approach to dependency pairs yields new modularity criteria which extend previous results in this area. In particular, existing results for modularity of innermost termination can easily be obtained as direct consequences of our new criteria.

This work was partially supported by the Deutsche Forschungsgemeinschaft under grants no. Wa 652/7-1,2 as part of the focus program ‘Deduktion’.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Arts & J. Giesl, Termination of constructor systems. In Proc. RTA-96, LNCS 1103, pp. 63–77, New Brunswick, NJ, 1996.

    MathSciNet  Google Scholar 

  2. T. Arts & J. Giesl, Automatically proving termination where simplification orderings fail. TAPSOFT '97, LNCS 1214, pp. 261–273, Lille, France, 1997.

    Google Scholar 

  3. T. Arts & J. Giesl, Proving innermost normalisation automatically. In Proc. RTA-97, LNCS 1232, pp. 157–172, Sitges, Spain, 1997.

    MathSciNet  Google Scholar 

  4. T. Arts & J. Giesl, Modularity of termination using dependency pairs. Tech. Rep. IBN 97/45, TU Darmstadt, 1997. http://www.inferenzsysteme. informatik.tu-darmstadt.de/~reports/notes/ibn-97-45.ps

    Google Scholar 

  5. T. Arts, Termination by absence of infinite chains of dependency pairs. In Proc. CAAP '96, LNCS 1059, pp. 196–210, Linköping, Sweden, 1996.

    MathSciNet  Google Scholar 

  6. T. Arts, Automatically proving termination and innermost normalisation of term rewriting systems. PhD Thesis, Utrecht Univ., The Netherlands, 1997.

    Google Scholar 

  7. N. Dershowitz, Termination of rewriting. JSC, 3:69–116, 1987.

    MathSciNet  MATH  Google Scholar 

  8. N. Dershowitz, Hierarchical Termination. In Proc. CTRS-94, LNCS 968, pp. 89–105, Jerusalem, Israel, 1994.

    Google Scholar 

  9. N. Dershowitz & C. Hoot, Natural termination. TCS, 142(2):179–207, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  10. K. Drosten, Termersetzungssysteme. Springer, Berlin, 1989.

    Book  MATH  Google Scholar 

  11. M. Fernandez & J.-P. Jouannaud, Modular termination of term rewriting systems revisited. In Proc. 10th Workshop on Specification of Abstract Data Types, LNCS 906, pp. 255–273, S. Maxgherita, Italy, 1995.

    Google Scholar 

  12. J. Giesl, Generating polynomial orderings for termination proofs. In Proc. RTA-95, LNCS 914, pp. 426–431, Kaiserslautern, Germany, 1995.

    Google Scholar 

  13. B. Gramlich, Generalized sufficient conditions for modular termination of rewriting. Appl. Algebra in Engineering, Comm. & Comp., 5:131–158, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  14. B. Gramlich, Abstract relations between restricted termination and confluence properties of rewrite systems. Fundamenta Informaticae, 24:3–23, 1995.

    MathSciNet  MATH  Google Scholar 

  15. B. Gramlich, Termination and confluence properties of structured rewrite systems. PhD Thesis, Universität Kaiserslautern, Germany, 1996.

    Google Scholar 

  16. B. Gramlich, On proving termination by innermost termination. In Proc. RTA-96, LNCS 1103, pp. 93–107, New Brunswick, NJ, 1996.

    MathSciNet  Google Scholar 

  17. G. Huet & D. Lankford, On the uniform halting problem for term rewriting systems. Technical Report 283, INRIA, Le Chesnay, France, 1978.

    Google Scholar 

  18. S. Kamin & J.-J. Levy, Two generalizations of the recursive path ordering. Department of Computer Science, University of Illinois, IL, 1980.

    Google Scholar 

  19. M. R. K. Krishna Rao, Modular proofs for completeness of hierarchical term rewriting systems. TCS, 151:487–512, 1995.

    Article  MATH  Google Scholar 

  20. M. Kurihara & A. Ohuchi, Modularity of simple termination of term rewriting systems with shared constructors. TCS, 103:273–282, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  21. D. S. Lankford, On proving term rewriting systems are noetherian. Technical Report Memo MTP-3, Louisiana Tech. University, Ruston, LA, 1979.

    Google Scholar 

  22. A. Middeldorp, A sufficient condition for the termination of the direct sum of term rewriting systems. LICS '89, pp. 396–401, Pacific Grove, CA, 1989.

    Google Scholar 

  23. A. Middeldorp, Modular properties of term rewriting systems. PhD Thesis, Free University Amsterdam, The Netherlands, 1990.

    Google Scholar 

  24. A. Middeldorp & Y. Toyama, Completeness of combinations of constructor systems. JSC, 15:331–348, 1993.

    MathSciNet  MATH  Google Scholar 

  25. A. Middeldorp & H. Zantema, Simple termination of rewrite systems. TCS, 175:127–158, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  26. E. Ohlebusch, On the modularity of termination of term rewriting systems. TCS, 136:333–360, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  27. E. Ohlebusch, Modular properties of composable term rewriting systems. JSC, 1:1–42, 1995.

    MathSciNet  Google Scholar 

  28. M. Rusinowitch, On termination of the direct sum of term-rewriting systems. Information Processing Letters, 26:65–70, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  29. M. Schmidt-Schauß, M. Marchiori, & S. E. Panitz, Modular termination of r-consistent and left-linear term rewriting systems. TCS, 149:361–374, 1995.

    Article  MATH  Google Scholar 

  30. J. Steinbach, Generating polynomial orderings. Information Processing Letters, 49:85–93, 1994.

    Article  MATH  Google Scholar 

  31. J. Steinbach, Simplification orderings: history of results. Fundamenta Informaticae, 24:47–87, 1995.

    MathSciNet  MATH  Google Scholar 

  32. Y. Toyama, Counterexamples to the termination for the direct sum of term rewriting systems. Information Processing Letters, 25:141–143, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  33. Y. Toyama, J. W. Klop, & H. P. Barendregt, Termination for direct sums of left-linear complete term rewriting systems. J. ACM, 42:1275–1304, 1995.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Laboratory, Ericsson Telecom AB, 126 25, Stockholm, Sweden

    Thomas Arts

  2. FB Informatik, Darmstadt University of Technology, Alexanderstr. 10, 64283, Darmstadt, Germany

    Jürgen Giesl

Authors
  1. Thomas Arts
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jürgen Giesl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Tobias Nipkow

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag

About this paper

Cite this paper

Arts, T., Giesl, J. (1998). Modularity of termination using dependency pairs. In: Nipkow, T. (eds) Rewriting Techniques and Applications. RTA 1998. Lecture Notes in Computer Science, vol 1379. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052373

Download citation

  • DOI: https://doi.org/10.1007/BFb0052373

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64301-2

  • Online ISBN: 978-3-540-69721-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation