On Decision Procedures for Collections, Cardinalities, and Relations
Kuat Yessenov, Ružica Piskač, Viktor Kunčak · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · 2009
Abstract. 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. 1