conference paper
NP Satisfiability for Arrays as Powers
January 14, 2022
Verification, Model Checking, and Abstract Interpretation
We show that the satisfiability problem for the quantifier-free theory of product structures with the equicardinality relation is inNP. As an application, we extend the combinatory array logic fragmentto handle cardinality constraints. The resulting fragment is independentof the base element and index set theories.
Type
conference paper
Author(s)
Date Issued
2022-01-14
Publisher
Published in
Verification, Model Checking, and Abstract Interpretation
ISBN of the book
978-3-030-94582-4
Total of pages
19
Series title/Series vol.
Lecture Notes in Computer Science; 13182
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
| Event name | Event place | Event date |
Philadelphia, PA, USA | January 16-18, 2022 | |
Available on Infoscience
March 4, 2022
Use this identifier to reference this record