Unification modulo Lists with Reverse as Solving Simple Sets of Word Equations - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2019

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

Abstract

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
Origin Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

  • HAL Id : hal-02123648 , version 2

Cite

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⟩
113 View
266 Download

Share

Gmail Mastodon Facebook X LinkedIn More