Practical programs share large modules of code. However, many program analyses are ineffective at reusing analysis results for shared code across programs. We present POLYMER, an analysis optimizer to address this problem. POLYMER runs the analysis offline on a corpus of training programs and learns analysis facts over shared code. It prunes the learnt facts to eliminate intermediate computations and then reuses these pruned facts to accelerate the analysis of other programs that share code with the training corpus. We have implemented POLYMER to accelerate analyses specified in Datalog, and apply it to optimize two analyses for Java programs: a call-graph analysis that is flow- and context-insensitive, and a points-to analysis that is flow...
Program flow analysis is a technique which determines properties about the run-time behavior of a pr...
We present a new limited form of interprocedural analy-sis called eld analysis that can be used by a...
Points-to analysis addresses a fundamental problem in program analysis: determining statically which...
Practical programs share large modules of code. However, many program analyses are ineffective at re...
242 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003.In this thesis we address the...
. We present a technique to measure and detect changes in the behavioral patterns of applications. I...
. We present a technique to measure and detect changes in the behavioral patterns of applications. I...
Dynamic analysis can identify improvements to programs that cannot feasibly be identified by static ...
Program analyses detect errors in code, but when code changes frequently as in an IDE, repeated re-a...
Machine learning (ML) is increasingly seen as a viable approach for building compiler optimization h...
A fundamental problem in interprocedural program analyses is the need to repre-sent and manipulate c...
Developing scalable and precise points-to analyses is increasingly important for analysing and optim...
This paper presents a systematic approach to scaling stackingbased context-sensitive program analysi...
Accuracy, completeness, and performance are all major concerns in the context of dynamic program ana...
Concurrency programs are hard to test or debug due to their non-deterministic nature. Existing dynam...
Program flow analysis is a technique which determines properties about the run-time behavior of a pr...
We present a new limited form of interprocedural analy-sis called eld analysis that can be used by a...
Points-to analysis addresses a fundamental problem in program analysis: determining statically which...
Practical programs share large modules of code. However, many program analyses are ineffective at re...
242 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2003.In this thesis we address the...
. We present a technique to measure and detect changes in the behavioral patterns of applications. I...
. We present a technique to measure and detect changes in the behavioral patterns of applications. I...
Dynamic analysis can identify improvements to programs that cannot feasibly be identified by static ...
Program analyses detect errors in code, but when code changes frequently as in an IDE, repeated re-a...
Machine learning (ML) is increasingly seen as a viable approach for building compiler optimization h...
A fundamental problem in interprocedural program analyses is the need to repre-sent and manipulate c...
Developing scalable and precise points-to analyses is increasingly important for analysing and optim...
This paper presents a systematic approach to scaling stackingbased context-sensitive program analysi...
Accuracy, completeness, and performance are all major concerns in the context of dynamic program ana...
Concurrency programs are hard to test or debug due to their non-deterministic nature. Existing dynam...
Program flow analysis is a technique which determines properties about the run-time behavior of a pr...
We present a new limited form of interprocedural analy-sis called eld analysis that can be used by a...
Points-to analysis addresses a fundamental problem in program analysis: determining statically which...
Add to ORKG