Unification modulo Lists with Reverse as Solving Simple Sets of Word Equations - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2019

Unification modulo Lists with Reverse as Solving Simple Sets of Word Equations

Résumé

Decision procedures for various list theories have been investigated in the literature with applications to automated verification. Here we show that the unifiability problem for some list theories with a reverse operator is NP-complete. We also give a unifiability algorithm for the case where the theories are extended with a length operator on lists.
Fichier principal
Vignette du fichier
Research-Report2019.pdf (199.4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02123648 , version 1 (08-05-2019)
hal-02123648 , version 2 (01-08-2019)

Identifiants

  • HAL Id : hal-02123648 , version 2

Citer

Siva Anantharaman, Peter Hibbs, Paliath Narendran, Michael Rusinowitch. Unification modulo Lists with Reverse as Solving Simple Sets of Word Equations. [Research Report] LIFO, Université d'Orléans; INSA, Centre Val de Loire. 2019. ⟨hal-02123648v2⟩
109 Consultations
263 Téléchargements

Partager

Gmail Facebook X LinkedIn More