Mehdi Bouaziz
TreeKs: A Functor to Make Numerical Abstract Domains Scalable
in 4th International Workshop on Numerical and Symbolic Abstract Domains (NSAD 2012), Elsevier, September 17, 2012
- PDF, 12 pages, 575 KB
- Abstract: Relational numerical abstract domains do not scale up. To ensure a linear cost of abstract domains, abstract interpretation-based tools analyzing large programs generally split the set of variables into independent smaller sets, sometimes sharing some non-relational information. We present a way to gain precision by keeping fully expressive relations between the subsets of variables, whilst retaining a linear complexity ensuring scalability.
- @inproceedings{Bouaziz-NSAD12,
author = {Bouaziz, Mehdi},
title = {\textsf{TreeKs}: A Functor to Make Numerical Abstract Domains Scalable},
year = {2012},
month = {September},
booktitle = {4th International Workshop on Numerical and Symbolic Abstract Domains (NSAD 2012)},
volume = {287},
pages = {41--52},
publisher = {Elsevier},
url = {http://www.bouaziz.me/p/Bouaziz-NSAD12.pdf},
doi = {10.1016/j.entcs.2012.09.005},
issn = {1571-0661}
}
Last update: January 24, 2014