Static analyses have problems modelling dynamic language features soundly while
retaining acceptable precision. The problem is well-understood in theory, but there is little …

Static program analysis is widely used to detect bugs and vulnerabilities early in the life
cycle of software. It models possible program executions without executing a program, and …

In this paper we present the design and implementation of a distributed, whole-program
static analysis framework that is designed to scale with the size of the input. Our approach is …

Although call graphs are crucial for inter-procedural analyses, it is challenging to statically
compute them for programs with dynamic features. Prior work focused on supporting certain …

Recent advances of Large Language Models (LLMs), eg, ChatGPT, exhibited strong
capabilities of comprehending and responding to questions across a variety of domains …

ABSTRACT A dynamic call graph is the invocation relation that represents a specific set of
runtime executions of a program. Dynamic call graph extraction is a typical application of …

Static program analyses and transformations for Java face many problems when analyzing
programs that use reflection or custom class loaders: How can a static analysis know which …

Implementations of static analyses are usually tailored toward a single goal to be efficient,
hampering reusability and adaptability of the components of an analysis. To solve these …

Traditional whole-program static analysis (eg, a points-to analysis that models the heap)
encounters scalability problems for realistic applications. We propose a``featherweight'' …

Dynamic analysis is an increasingly important means of supporting software validation and
maintenance. To date, developers of dynamic analyses have used low-level instrumentation …