Skip to main content
SpringerLink
Log in

Conditional Confluence (System Description)

  • Conference paper
Rewriting and Typed Lambda Calculi (RTA 2014, TLCA 2014)

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

Abstract

This paper describes the Conditional Confluence tool, a fully automatic confluence checker for first-order conditional term rewrite systems. The tool implements various confluence criteria that have been proposed in the literature. A simple technique is presented to test conditional critical pairs for infeasibility, which makes conditional confluence criteria more useful. Detailed experimental data is presented.

The research described in this paper is supported by FWF (Austrian Science Fund) projects P22467 and I963.

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. Aoto, T., Yoshida, J., Toyama, Y.: Proving confluence of term rewriting systems automatically. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 93–102. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  2. Avenhaus, J., Loría-Sáenz, C.: On conditional rewrite systems with extra variables and deterministic logic programs. In: Pfenning, F. (ed.) LPAR 1994. LNCS, vol. 822, pp. 215–229. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  3. Baader, F., Nipkow, T.: Term Rewriting and All That. CUP (1998)

    Google Scholar 

  4. Bergstra, J.A., Klop, J.W.: Conditional rewrite rules: Confluence and termination. Journal of Computer and System Sciences 32(3), 323–362 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  5. Dershowitz, N., Okada, M., Sivakumar, G.: Confluence of conditional rewrite systems. In: Kaplan, S., Jouannaud, J.-P. (eds.) CTRS 1987. LNCS, vol. 308, pp. 31–44. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  6. Ganzinger, H.: A completion procedure for conditional equations. Journal of Symbolic Computation 11(1/2), 51–81 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  7. Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. In: Gramlich, B. (ed.) FroCos 2005. LNCS (LNAI), vol. 3717, pp. 216–231. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  8. Gmeiner, K., Nishida, N., Gramlich, B.: Proving confluence of conditional term rewriting systems via unravelings. In: Proc. 2nd IWC, pp. 35–39 (2013)

    Google Scholar 

  9. González-Moreno, J.C., Hortalá-González, M.T., Rodríguez-Artalejo, M.: Denotational versus declarative semantics for functional programming. In: Kleine Büning, H., Jäger, G., Börger, E., Richter, M.M. (eds.) CSL 1991. LNCS, vol. 626, pp. 134–148. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  10. Hirokawa, N., Klein, D.: Saigawa: A confluence tool. In: Proc. 1st IWC, p. 49 (2012)

    Google Scholar 

  11. Kounalis, E., Rusinowitch, M.: A proof system for conditional algebraic specifications. In: Okada, M., Kaplan, S. (eds.) CTRS 1990. LNCS, vol. 516, pp. 51–63. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  12. Marchiori, M.: On deterministic conditional rewriting. Computation Structures Group Memo, vol. 405. MIT Laboratory for Computer Science (1987)

    Google Scholar 

  13. Marchiori, M.: Unravelings and ultra-properties. In: Hanus, M., Rodríguez-Artalejo, M. (eds.) ALP 1996. LNCS, vol. 1139, pp. 107–121. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  14. Nishida, N., Sakai, M., Sakabe, T.: Soundness of unravelings for conditional term rewriting systems via ultra-properties related to linearity. Logical Methods in Computer Science 8, 1–49 (2012)

    Article  MathSciNet  Google Scholar 

  15. Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer (2002)

    Google Scholar 

  16. Suzuki, T., Middeldorp, A., Ida, T.: Level-confluence of conditional rewrite systems with extra variables in right-hand sides. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol. 914, pp. 179–193. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  17. Zankl, H., Felgenhauer, B., Middeldorp, A.: CSI – A confluence tool. In: Bjørner, N., Sofronie-Stokkermans, V. (eds.) CADE 2011. LNCS, vol. 6803, pp. 499–505. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  18. Zhang, H.: Implementing contextual rewriting. In: Rusinowitch, M., Remy, J.-L. (eds.) CTRS 1992. LNCS, vol. 656, pp. 363–377. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  19. Zhang, H., Remy, J.-L.: Contextual rewriting. In: Jouannaud, J.-P. (ed.) RTA 1985. LNCS, vol. 202, pp. 46–62. Springer, Heidelberg (1985)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Innsbruck, Innsbruck, Austria

    Thomas Sternagel & Aart Middeldorp

Authors
  1. Thomas Sternagel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Aart Middeldorp
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Inria, 23 avenue d’Italie, CS 81321, 75214, Paris Cedex 13, France

    Gilles Dowek

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Sternagel, T., Middeldorp, A. (2014). Conditional Confluence (System Description). In: Dowek, G. (eds) Rewriting and Typed Lambda Calculi. RTA TLCA 2014 2014. Lecture Notes in Computer Science, vol 8560. Springer, Cham. https://doi.org/10.1007/978-3-319-08918-8_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08918-8_31

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08917-1

  • Online ISBN: 978-3-319-08918-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation