Generic Abstraction of Dictionaries and Arrays | Zendy

Jędrzej Fulara | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Generic Abstraction of Dictionaries and Arrays

Author(s) -

Jędrzej Fulara

Publication year - 2012

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2012.09.006

Subject(s) - computer science , abstraction , container (type theory) , scalar (mathematics) , string (physics) , key (lock) , theoretical computer science , domain (mathematical analysis) , abstract interpretation , algorithm , mathematics , mechanical engineering , mathematical analysis , philosophy , geometry , computer security , epistemology , engineering , mathematical physics

We present a generic abstract domain for analysis of dictionary and array content. Our technique is parametrised by the abstractions of scalars, dictionary keys and dictionary values. It can be instantiated with various existing domains, including non-numerical ones (such as domains for analysis of properties of string variables). It is powerful enough to express relations between container content and scalars.The analysis is fully automatic. The container is partitioned according to properties of the keys, captured by the underlying key abstraction. The precision and cost of the analysis are customisable and depend on the choice of the abstractions of keys, dictionary elements and scalar variables.We show examples in which the technique is used to reason about arrays as well as string-keyed dictionaries. The approach was also experimentally evaluated

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research