| Document Date: 2010-02-25 20:19:41
Open Document File Size: 228,93 KBShare Result on Facebook
City San Diego / / Company CVS / AMD / Chris Lattner Andrew Lenharth Vikram Adve Apple Inc. / / Country United States / / Currency USD / / / Facility University of Illinois / C library / / IndustryTerm points-to analysis algorithm / Context-sensitive alias analysis algorithms / context-insensitive algorithm / flow-insensitive algorithms / particular call site / call-site / linear-time algorithm / context-sensitive algorithms / field-sensitive algorithm / non-context-sensitive algorithms / na¨ıve algorithm / static analysis tools / flow-insensitive algorithm / field-insensitive algorithm / pointer analysis algorithms / call site / unification algorithm / context-insensitive subset-based algorithm / low-level compiler systems / recent algorithms / allocation site / / OperatingSystem Linux / / Organization National Science Foundation / Tarjan’s Union / University of Illinois / / Person Liang / mark D / Harrold / / / Position MP / General / Major / representative / / ProgrammingLanguage FP / C / Fortran / C++ / / ProvinceOrState Illinois / California / / Technology following algorithm / analysis algorithm / pointer analysis algorithms / unification algorithm / na¨ıve algorithm / two recent algorithms / Linux / overall Bottom-Up analysis algorithm / Union-Find algorithm / Cloning / perl / flow-insensitive algorithm / Athlon MP 2100+ processor / alias analysis algorithms / context-insensitive / field-insensitive algorithm / flow-insensitive algorithms / points-to analysis algorithm / DSA algorithm / Andersens algorithm / unification-based algorithms / Bottom-Up algorithm / linear-time algorithm / context-insensitive algorithm / context-insensitive subset-based algorithm / Construction Algorithm / MoPPA algorithm / local algorithm / using Tarjan’s union-find algorithm / /
SocialTag |
Making Context-sensitive Points-to Analysis with Heap Cloning Practical For The Real World ∗ Chris Lattner Andrew Lenharth