Publication | Closed Access
Fast and precise points-to analysis with incremental CFL-reachability summarisation: preliminary experience
23
Citations
10
References
2012
Year
Unknown Venue
EngineeringReachability ProblemCompiler TechnologyPoints-to AnalysisComputer ArchitectureEntity SummarizationSoftware EngineeringSoftware AnalysisCorpus LinguisticsNatural Language ProcessingComputational LinguisticsCfl ReachabilityPreliminary ExperienceStatic CheckingLanguage StudiesMachine TranslationDynamic CompilationProgramming Language TheoryLinguisticsAbstract InterpretationComputer EngineeringComputer ScienceOptimizing CompilerStatic Program AnalysisSoftware DesignReachability AnalysisMethod SummariesProgram AnalysisAutomated ReasoningSoftware TestingFormal MethodsParallel ProgrammingHeap AbstractionSystem SoftwareIncremental Cfl-reachability Summarisation
We describe our preliminary experience in the design and implementation of a points-to analysis for Java, called EMU, that enables developers to perform pointer-related queries in programs undergoing constant changes in IDEs. EMU achieves fast response times by adopting a modular approach to incrementally updating method summaries upon small code changes: the points-to information in a method is summarised indirectly by CFL reachability rather than directly by points-to sets. Thus, the impact of a small code change made in a method is localised, requiring only its affected part to be re-summarised just to reflect the change. EMU achieves precision by being context-sensitive (for both method invocation and heap abstraction) and field-sensitive. Our evaluation shows that EMU can be promisingly deployed in IDEs where the changes are small.
| Year | Citations | |
|---|---|---|
Page 1
Page 1