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 :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [25 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02123648
Contributor : Siva Anantharaman <>
Submitted on : Wednesday, May 8, 2019 - 6:01:20 PM
Last modification on : Wednesday, June 26, 2019 - 3:18:22 PM

File

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

Identifiers

  • HAL Id : hal-02123648, version 1

Citation

Siva Anantharaman, Peter Hibbs, Paliath Narendran, Michael Rusinowitch. Unification modulo Lists with Reverse as Solving Simple Sets of Word Equations. 2019. ⟨hal-02123648⟩

Share

Metrics

Record views

36

Files downloads

171