Donut Domains: Efficient Non-convex Domains for Abstract Interpretation - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Donut Domains: Efficient Non-convex Domains for Abstract Interpretation

Résumé

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.
Fichier principal
Vignette du fichier
vmcai2012.pdf (369.62 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01660908 , version 1 (12-12-2017)

Identifiants

Citer

Khalil Ghorbal, Franjo Ivancic, Gogul Balakrishnan, Naoto Maeda, Aarti Gupta. Donut Domains: Efficient Non-convex Domains for Abstract Interpretation. VMCAI 2012 - Verification, Model Checking, and Abstract Interpretation - 13th International Conference, Jan 2012, Philadelphia, United States. pp.235--250, ⟨10.1007/978-3-642-27940-9_16⟩. ⟨hal-01660908⟩
95 Consultations
237 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More