The First-Order Theory of Sets with Cardinality Constraints is Decidable
| dc.creator | Kuncak, Viktor | |
| dc.creator | Rinard, Martin | |
| dc.date | 2004-07-17 | |
| dc.date | 2004-10-03 | |
| dc.date.accessioned | 2026-07-07T03:21:35Z | |
| dc.date.available | 2026-07-07T03:21:35Z | |
| dc.description | We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is undecidable. Our language allows relating the cardinalities of sets to the values of integer variables, and can distinguish finite and infinite sets. We use quantifier elimination to show the decidability and obtain an elementary upper bound on the complexity. Precise program analyses can use our decidability result to verify representation invariants of data structures that use an integer field to represent the number of stored elements. | |
| dc.description | 18 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0407045 | |
| dc.identifier | http://arxiv.org/abs/cs/0407045 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32254 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Programming Languages | |
| dc.title | The First-Order Theory of Sets with Cardinality Constraints is Decidable | |
| dc.type | text |