HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Intraprocedural Pointer Analysis for Container-Centric Applications

Albert Cohen 1 Peng Wu David Padua
1 A3 - Advanced analysis to code optimization
UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France
Abstract : As programmers look forward to designing high performance applications with object-oriented models, compilers must support higher-level analyses and optimizations. Pointer analysis for container-centric applications is one of these: it exploits abstract semantics of container structures (e.g., lists, trees, associative maps) provided by standard libraries and toolkits. Extending shape analysis work by Sagiv, Reps and Wilhelm, we capture aliasing properties through dedicated points-to graphs. Formalizati- on in abstract interpretation allowed us to prove the abstraction's and transfer functions' safety. We ran the analysis on small examples. It achieved precise memory disambiguations useful to parallelization and optimization.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 8:20:19 PM
Last modification on : Saturday, January 22, 2022 - 3:30:23 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:02:47 PM


  • HAL Id : inria-00072298, version 1


Albert Cohen, Peng Wu, David Padua. Intraprocedural Pointer Analysis for Container-Centric Applications. RR-4289, INRIA. 2001. ⟨inria-00072298⟩



Record views


Files downloads