Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. NP Satisfiability for Arrays as Powers
 
Loading...
Thumbnail Image
conference paper

NP Satisfiability for Arrays as Powers

Raya, Rodrigo  
•
Kuncak, Viktor  
January 14, 2022
Verification, Model Checking, and Abstract Interpretation
23rd International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2022)

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.

  • Files
  • Details
  • Metrics
Type
conference paper
DOI
10.1007/978-3-030-94583-1_15
Author(s)
Raya, Rodrigo  
•
Kuncak, Viktor  
Date Issued

2022-01-14

Publisher

Springer, Cham

Journal
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

Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LARA  
Event nameEvent placeEvent date
23rd International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2022)

Philadelphia, PA, USA

January 16-18, 2022

Available on Infoscience
March 4, 2022
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/186037
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés