Widening with Thresholds for Programs with Complex Control Graphs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Widening with Thresholds for Programs with Complex Control Graphs

Résumé

The precision of an analysis based on abstract interpretation does not only depend on the abstract domain, but also on the solving method. The traditional solution is to solve iteratively abstract fixpoint equations, using extrapolation with a widening operator to make the iterations converge. Unfortunately, this extrapolation often loses crucial information for the analysis goal. A classical technique for improving the precision is ''widening with thresholds'', which bounds the extrapolation. Its benefit strongly depends on the choice of relevant thresholds. In this paper we propose a semantic-based technique for automatically inferring such thresholds, which applies to any control graph, be it intraprocedural, interprocedural or concurrent, without specific assumptions on the abstract domain. Despite its technical simplicity, our technique is able to infer the relevant thresholds in many practical cases.
Fichier principal
Vignette du fichier
fulltext_39_.pdf (264.35 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

inria-00635243 , version 1 (24-10-2011)

Identifiants

Citer

Lies Lakhdar-Chaouch, Bertrand Jeannet, Alain Girault. Widening with Thresholds for Programs with Complex Control Graphs. Automated Technology for Verification and Analysis, ATVA'11, Oct 2011, Taipei, Taiwan. pp.492-502, ⟨10.1007/978-3-642-24372-1_38⟩. ⟨inria-00635243⟩
212 Consultations
462 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More