NP Satisfiability for Arrays as Powers

paper ps   
We show that the satisfiability problem for the quantifier-free theory of product structures with the equicardinality relation is in NP. As an application, we extend the combinatory array logic fragment to handle cardinality constraints. The resulting fragment is independent of the base element and index set theories.

Citation

Rodrigo Raya and Viktor Kunčak. NP satisfiability for arrays as powers. In Bernd Finkbeiner and Thomas Wies, editors, Verification, Model Checking, and Abstract Interpretation (VMCAI), pages 301--318. Springer International Publishing, 2022.

BibTex Entry

@inproceedings{RayaKuncak22NPPowers,
  author = {Raya, Rodrigo
 and Kun{\v{c}}ak, Viktor},
  editor = {Finkbeiner, Bernd
and Wies, Thomas},
  title = {{NP} Satisfiability for Arrays as Powers},
  booktitle = {Verification, Model Checking, and Abstract Interpretation (VMCAI)},
  year = {2022},
  publisher = {Springer International Publishing},
  pages = {301--318},
  abstract = {We show that the satisfiability problem for the quantifier-free theory of product structures with the equicardinality relation is in NP. As an application, we extend the combinatory array logic fragment to handle cardinality constraints. The resulting fragment is independent of the base element and index set theories.},
  isbn = {978-3-030-94583-1}
}