000161289 001__ 161289
000161289 005__ 20190812205458.0
000161289 0247_ $$2doi$$a10.1007/978-3-642-11319-2_27
000161289 037__ $$aCONF
000161289 245__ $$aCollections, Cardinalities, and Relations
000161289 269__ $$a2010
000161289 260__ $$c2010
000161289 336__ $$aConference Papers
000161289 490__ $$aLNCS$$v5944
000161289 520__ $$aLogics 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.
000161289 6531_ $$adecision procedure
000161289 6531_ $$averification
000161289 6531_ $$aBAPA
000161289 6531_ $$adescription logic
000161289 700__ $$aYessenov, Kuat
000161289 700__ $$0242186$$g179111$$aPiskac, Ruzica
000161289 700__ $$0240031$$g177241$$aKuncak, Viktor
000161289 720_1 $$aBarthe, Gilles$$eed.
000161289 720_1 $$aHermenegildo, Manuel V.$$eed.
000161289 773__ $$tProceedings of the 11th International Conference on Verification, Model Checking, and Abstract Interpretation$$q380-395
000161289 8564_ $$zn/a$$yPreprint$$uhttps://infoscience.epfl.ch/record/161289/files/YessenovETAL10CollectionsRelations.pdf$$s226381
000161289 909C0 $$xU11739$$pLARA$$0252019
000161289 909CO $$ooai:infoscience.tind.io:161289$$qGLOBAL_SET$$pconf$$pIC
000161289 917Z8 $$x177241
000161289 937__ $$aEPFL-CONF-161289
000161289 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000161289 980__ $$aCONF