Award for Paper on Compositional Analysis
In static program analysis, whole-program analysis (WPA) describes the process of analyzing a complete program including all of its dependencies and system libraries. The goal here is to derive properties of the program (e.g. security guarantees or counterexamples) with high precision including (almost) everything included in the subsequent execution of the program. However, this process can be very costly as the amount of library and system code required to analyze usually exceeds the amount of application code.
Interestingly, this rather large part of the application stack rarely changes between analysis runs. In our recent ECOOP Paper, we leverage that fact and provide a lossless modular summarization technique that blends into analyses with PhASAR.
For this paper, we have just been awarded the Distinguished Paper Award at ECOOP'21. Only two papers of the conference were presented with this award this year. We are very happy and grateful to be selected.
Paper Preprint: Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis
Lossless, Persisted Summarization of Static Callgraph, Points-To and Data-Flow Analysis
Philipp Schubert, Ben Hermann, and Eric Bodden
In 35th European Conference on Object-Oriented Programming (ECOOP 2021)
DOI: https://doi.org/10.4230/LIPIcs.ECOOP.2021.2
- Preprint PDF (878 KB)
- BibTeX BIB (893 B)
- Talk Video YOUTUBE (11 B)