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.
Document type :
Reports
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02123648
Contributor : Siva Anantharaman <>
Submitted on : Thursday, August 1, 2019 - 11:06:45 AM
Last modification on : Tuesday, August 13, 2019 - 11:32:01 AM

File

Research-Report2019.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02123648, version 2

Citation

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⟩

Share

Metrics

Record views

44

Files downloads

10