Skip to main content
SpringerLink
Log in
Book cover

International Conference on Mathematics of Program Construction

MPC 2006: Mathematics of Program Construction pp 416–432Cite as

Constructing Rewrite-Based Decision Procedures for Embeddings and Termination

  • Conference paper

  • 486 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4014))

Abstract

We prove tractability of ground relational Knuth-Bendix completion procedures. We apply this result to formally develop three dynamic rule-based declarative and tractable decision procedures for termination analysis: for detection of simple and homeomorphic embeddings of ground terms and for termination of ground term rewrite systems. Our algorithms are of general interest for the automated analysis of dynamic reachability, termination and ordering constraints. Our approach is particularly suited for declarative rule-based programming environments.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Struth, G.: Knuth-bendix completion as a data structure. In: MacCaull, W., Winter, M., Düntsch, I. (eds.) RelMiCS 2005. LNCS, vol. 3929, pp. 225–236. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Struth, G.: Knuth-Bendix completion for non-symmetric transitive relations. In: van den Brand, M., Verma, R. (eds.) Proc. of 2nd Int. Wksh. on Rule-Based Programming, RULE 2001. Electron. Notes in Theor. Comput. Sci., vol. 59. Elsevier, Amsterdam (2001)

    Google Scholar 

  3. Struth, G.: Canonical Transformations in Algebra, Universal Algebra and Logic. PhD thesis. Inst. für Informatik, Univ. des Saarlandes (1998)

    Google Scholar 

  4. Plaisted, D.A.: Polynomial termination and constraint satisfaction tests. In: Kirchner, C. (ed.) RTA 1993. LNCS, vol. 690, pp. 405–420. Springer, Heidelberg (1993)

    Google Scholar 

  5. Kozen, D.: Complexity of finitely presented algebras. Techn. Report TR-76-294, Dept. of Computer Science, Cornell Univ. (1979)

    Google Scholar 

  6. Snyder, W.: Efficient ground completion: an O(n log n) algorithm for generating reduced sets of ground rewrite rules equivalent to a set of ground equations E. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol. 355, pp. 419–433. Springer, Heidelberg (1989)

    Google Scholar 

  7. Nelson, G.: Techniques for program verification. Techn. Report CSL-81-10, Xerox Palo Alto Research Center (1981)

    Google Scholar 

  8. Kapur, D.: Shostak’s congruence closure as completion. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 23–37. Springer, Heidelberg (1997)

    Google Scholar 

  9. Struth, G.: An algebra of resolution. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol. 1833, pp. 214–228. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  10. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Google Scholar 

  11. Levy, J., Agustí, J.: Bi-rewrite systems. J. of Symb. Comput. 22, 279–314 (1996)

    Article  MATH  Google Scholar 

  12. Wechler, W.: Universal Algebra for Computer Scientists. Springer, Heidelberg (1992)

    MATH  Google Scholar 

  13. Dershowitz, N.: Termination of rewriting. J. of Symb. Comput. 3, 69–116 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  14. Plaisted, D.A.: The undecidability of self-embedding for term rewriting systems. Inform. Proc. Lett. 20, 61–64 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  15. Bol, R.: Loop checking in partial deduction. J. of Logic Programming 16, 25–46 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  16. Leuschel, M.A.: On the power of homeomorphic embedding for online termination. In: Levi, G. (ed.) SAS 1998. LNCS, vol. 1503, pp. 230–245. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  17. Glück, R., Sørensen, M.H.: A roadmap to metacomputation by supercompilation. In: Danvy, O., Thiemann, P., Glück, R. (eds.) Dagstuhl Seminar 1996. LNCS, vol. 1110, pp. 137–160. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Sheffield, Regent Court, 211 Portobello Street, Sheffield, S1 4DP, UK

    Georg Struth

Authors
  1. Georg Struth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Cybernetics at Tallinn University of Technology, Akadeemia tee 21, EE-12618, Tallinn, Estonia

    Tarmo Uustalu

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Struth, G. (2006). Constructing Rewrite-Based Decision Procedures for Embeddings and Termination. In: Uustalu, T. (eds) Mathematics of Program Construction. MPC 2006. Lecture Notes in Computer Science, vol 4014. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11783596_24

Download citation

  • DOI: https://doi.org/10.1007/11783596_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35631-8

  • Online ISBN: 978-3-540-35632-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation