Rule-Based Unification in Combined Theories and the Finite Variant Property - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2019

Rule-Based Unification in Combined Theories and the Finite Variant Property

Abstract

We investigate the unification problem in theories defined by rewrite systems which are both convergent and forward-closed. These theories are also known in the context of protocol analysis as theories with the finite variant property and admit a variant-based unification algorithm. In this paper, we present a new rule-based unification algorithm which can be seen as an alternative to the variant-based approach. In addition, we define forward-closed combination to capture the union of a forward-closed convergent rewrite system with another theory, such as the Associativity-Commutativity, whose function symbols may occur in right-hand sides of the rewrite system. Finally, we present a combination algorithm for this particular class of non-disjoint unions of theories.
Fichier principal
Vignette du fichier
combi-fc.pdf (334.96 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01988419 , version 1 (02-04-2019)

Identifiers

Cite

Ajay K. Eeralla, Serdar Erbatur, Andrew M. Marshall, Christophe Ringeissen. Rule-Based Unification in Combined Theories and the Finite Variant Property. LATA 2019 - 13th International Conference on Language and Automata Theory and Applications, Mar 2019, Saint-Petersbourg, Russia. pp.356--367, ⟨10.1007/978-3-030-13435-8_26⟩. ⟨hal-01988419⟩
76 View
212 Download

Altmetric

Share

Gmail Facebook X LinkedIn More