Access-Based Localization for Octagons | Zendy

Eva Beckschulze | Zendy; Stefan Kowalewski | Zendy; Jörg Bräuer | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Access-Based Localization for Octagons

Author(s) -

Eva Beckschulze,

Stefan Kowalewski,

Jörg Bräuer

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.004

Subject(s) - set (abstract data type) , constraint (computer aided design) , domain (mathematical analysis) , computer science , variety (cybernetics) , state (computer science) , process (computing) , mathematical optimization , algorithm , point (geometry) , theoretical computer science , space (punctuation) , mathematics , artificial intelligence , programming language , geometry , mathematical analysis , operating system

Access-based localization is a two-step process. First, the set of abstract memory locations that are accessed in a procedure are determined. Then, in a subsequent fixed point iteration, the input to the respective procedure is reduced to those variables that are indeed accessed, thereby saving time and memory. The topic of this paper is access-based localization for the octagon abstract domain. For the frequently occurring scenario that only one out of two variables in some octagonal constraint is contained in the access-set of a procedure, there is a variety of opportunities how localization could be implemented. This paper presents three different approaches on how to deal with such constraints. Albeit applied to a subset of the abstract state space, two of these approaches preserve precision, i.e., the abstract state space is as precise as in the case that no localization is performed

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