Incrementalizing Production CodeQL Analyses
Not on the map. Why?
Abstract (arXiv)
Instead of repeatedly re-analyzing from scratch, an incremental static analysis only analyzes a codebase once completely, and then it updates the previous results based on the code changes. While this sounds promising to achieve speed-ups, the reality is that sophisticated static analyses typically employ features that can ruin incremental performance, such as inter-procedurality or context-sensitivity. In this study, we set out to explore whether incrementalization can help to achieve speed-ups for production CodeQL analyses that provide automated feedback on pull requests on GitHub. We first empirically validate the idea by measuring the potential for reuse on real-world codebases, and then we create a prototype incremental solver for CodeQL that exploits incrementality. We report on experimental results showing that we can indeed achieve update times proportional to the size of the code change, and we also discuss the limitations of our prototype.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 18 Aug 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 2.
2 papers.
- 2025RefleXGen:The unexamined code is not worth using27 Oct 2025
- 2025From Benchmark Data To Applicable Program Repair: An Experience Report22 Aug 2025