Collections, Cardinalities, and Relations

Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make such logics more useful in verification this paper extends them with the ability to compute direct and inverse relation and function images. We establish decidability and complexity bounds for the extended logics.


Editor(s):
Barthe, Gilles
Hermenegildo, Manuel V.
Published in:
Proceedings of the 11th International Conference on Verification, Model Checking, and Abstract Interpretation, 380-395
Year:
2010
Keywords:
Laboratories:




 Record created 2010-12-01, last modified 2018-09-25

Preprint:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)