Journal of Automated Reasoning

, Volume 58, Issue 2, pp 231–251 | Cite as

Confluence of Orthogonal Term Rewriting Systems in the Prototype Verification System

  • Ana Cristina Rocha-Oliveira
  • André Luiz Galdino
  • Mauricio Ayala-Rincón
Article
  • 65 Downloads

Abstract

Orthogonality is a discipline of programming which syntactically guarantees determinism of functional specifications. Essentially, orthogonality avoids critical forks in term rewriting systems (TRSs) twofold: avoiding overlappings between left-hand sides of the rules (non-ambiguity) prohibiting rules in the definitions of functions that may apply simultaneously and forbidding repetitions of variables in the left-hand side of the rules (left-linearity) that may produce forks. In the theory of term rewriting systems, determinism is captured by the well-known property of confluence that is a consequence of orthogonality. This work describes a complete formalization in PVS of the theorem of confluence of orthogonal term rewriting systems. The formalization includes definitions and results on parallel reduction, in particular Rosen’s Parallel Moves Lemma. It is made available as a PVS theoryorthogonality inside the directory TRS of the NASA Langley PVS Library. Like all of TRS, orthogonality is intended to stay close to textbook proofs. The present proof uses the Parallel Moves Lemma at dominating positions of a parallel context. In this manner, all parallel forks filling the holes of the context are joined and, as result, a term of joinability for the whole fork is constructed.

Keywords

Term rewriting system Confluence Orthogonality Left-linearity Non-ambiguity Critical pairs Non-termination 

References

  1. 1.
    Avelar, A., Galdino, A., de Moura, F., Ayala-Rincón, M.: First-order unification in the PVS proof assistant. Logic J. IGPL 22(5), 758–789 (2014)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Ayala-Rincón, M., Avelar, A.B., Galdino, A.L., Rocha-Oliveira, A.C.: TRS: a PVS Theory for Term Rewriting Systems. http://trs.cic.unb.br—Universidade de Brasília, and http://shemesh.larc.nasa.gov/fm/ftp/larc/PVS-library/library.html—NASA Langley Research Center PVS libraries (Last visited: August, 2015)
  3. 3.
    Ayala-Rincón, M., Fernández, M., Gabbay, M.J., Rocha-Oliveira, A.C.: Checking overlaps of nominal rewriting rules. In Pre-proc. Logical and Semantic Frameworks with Applications (LSFA). ENTCS (2015)Google Scholar
  4. 4.
    Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)CrossRefMATHGoogle Scholar
  5. 5.
    Bezem, M., Klop, J.W., de Vrijer, R. (eds.): Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2003)Google Scholar
  6. 6.
    Galdino, A.L., Ayala-Rincón, M.: A formalization of Newman’s and Yokouchi’s lemmas in a higher-order language. J. Formal. Reason. 1(1), 39–50 (2008)MathSciNetMATHGoogle Scholar
  7. 7.
    Galdino, A.L., Ayala-Rincón, M.: A formalization of the Knuth–Bendix(–Huet) critical pair theorem. J. Autom. Reason. 45(3), 301–325 (2010)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Huet, G.P.: Confluent reductions: abstract properties and applications to term rewriting systems. J. ACM 27(4), 797–821 (1980)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Huet, G.P., Lévy, J.-J.: Computations in orthogonal rewriting systems, I. In: Computational Logic—Essays in Honor of Alan Robinson, pp. 395–414 (1991)Google Scholar
  10. 10.
    Rocha-Oliveira, A.C., Ayala-Rincón, M.: Formalizing the confluence of orthogonal rewriting systems. In: Proceedings of 7th Workshop on Logical and Semantic Frameworks, with Applications, LSFA, pp. 145–152 (2012)Google Scholar
  11. 11.
    Rosen, B.K.: Tree-manipulating systems and Church–Rosser theorems. J. ACM 20(1), 160–187 (1973)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    Shankar, N., Owre, S., Rushby, J.M., Stringer-Calvert, D.W.J.: PVS Prover Guide. Technical report, SRI International. http://pvs.csl.sri.com/doc/pvs-prover-guide.pdf (2001)
  13. 13.
    Suzuki, T., Kikuchi, K., Aoto, T., Toyama, Y.: Confluence of orthogonal nominal rewriting systems revisited. In: Proceedings of the 26th International Conference on Rewriting Techniques and Applications (RTA 2015), pp. 301–317. LIPIcs (2015)Google Scholar
  14. 14.
    Takahashi, M.: Parallel reductions in lambda-calculus. Inf. Comput. 118(1), 120–127 (1995)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Thiemann, R.: Formalizing bounded increase. In: Interactive Theorem Proving—4th International Conference, ITP 2013, Rennes, France, July 22–26, 2013. Proceedings, pp. 245–260 (2013)Google Scholar
  16. 16.
    van Oostrom, V.: Developing developments. Theor. Comput. Sci. 175(1), 159–181 (1997)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2016

Authors and Affiliations

  • Ana Cristina Rocha-Oliveira
    • 1
  • André Luiz Galdino
    • 2
  • Mauricio Ayala-Rincón
    • 1
  1. 1.Grupo de Teoria da Computação, Departamentos de Ciência da Computação e MatemáticaUniversidade de BrasíliaBrasíliaBrazil
  2. 2.Departamento de MatemáticaUniversidade Federal de Goiás - Regional CatalãoGoiásBrazil

Personalised recommendations