DMCA
Donut domains: Efficient non-convex domains for abstract interpretation (2012)
| Venue: | VMCAI 2012 |
| Citations: | 4 - 0 self |
BibTeX
@MISC{Ghorbal12donutdomains:,
author = {Khalil Ghorbal and Gogul Balakrishnan and Naoto Maeda and Aarti Gupta and et al.},
title = { Donut domains: Efficient non-convex domains for abstract interpretation },
year = {2012}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Program analysis using abstract interpretation has been successfully applied in practice to find runtime bugs or prove software correct. Most abstract domains that are used widely rely on convexity for their scalability. However, the ability to express non-convex properties is sometimes required in order to achieve a precise analysis of some numerical properties. This work combines already known abstract domains in a novel way in order to design new abstract domains that tackle some non-convex invariants. The abstract objects of interest are encoded as a pair of two convex abstract objects: the first abstract object defines an over-approximation of the possible reached values, as is done customarily. The second abstract object under-approximates the set of impossible values within the state-space of the first abstract object. Therefore, the geometrical concretization of our objects is defined by a convex set minus another convex set (or hole). We thus call these domains donut domains.
Keyphrases
abstract interpretation efficient non-convex domain donut domain abstract domain first abstract object runtime bug program analysis possible reached value abstract object impossible value non-convex property numerical property convex abstract object non-convex invariant novel way software correct geometrical concretization precise analysis work combine new abstract second abstract object under-approximates
