Theory and Practice of Static Analysis 2026TPSA 2026

While decades of research in program logics, abstract interpretation, and separation logic provide a strong foundation for automated static analysis, new challenges have arisen in recent years, spurring accelerated innovation in both the underlying theory and practical implementation of static analysis systems.

One such example is the challenge of incorrectness reasoning. Bug-finding has long been an important part of industrial static analysis, but sound logical theories for incorrectness were only recently explored, motivated by the need for tools that efficiently identify true bugs. Subsequently, incorrectness reasoning has become an active area of research with work to combine it with separation logic, concurrency, abstract interpretation, security and hyperproperties, and type systems. Automated reasoning tools based on these theories are under active development at companies such as Meta and Bloomberg.

Another example is reasoning about computational effects, which is notoriously difficult to automate. Such effects include concurrency, randomization, exceptions, and nontermination. Recent work has been done to develop theories and tools for detecting deadlocks, race conditions, and programs with divergent behavior. In addition, automation techniques are under development for randomized programs, to reason about programs in terms of expectations.

This workshop provides a venue where researchers and practitioners can present speculative ideas about new analysis techniques. Since it is very hard to implement and validate these systems, we encourage the sharing of early stage ideas and emerging trends that are not yet ready for publication in conferences like POPL.

Accepted Talks

Call for Presentations

We invite the submission of talk proposals in topics related to both the mathematical foundations and practical implementations of static analysis. This workshop will not have formal proceedings, so talks covering in-progress or already published work are welcome. Since analysis tools and algorithms are difficult to implement, we also welcome speculative presentations about techniques that are not yet validated. The topics in scope include, but are not limited to:

• Logical foundations for analysis algorithms (e.g. program logics, abstract interpretation, separation logic, etc)
• Emerging problems and use cases for static analysis (with or without proposed solutions)
• Prototype analysis tools
• Incorrectness, under-approximation, and bug-finding
• Analysis with computational effects (e.g., probabilistic, quantum, or concurrent programming)
• Industrial experience reports

Submissions

Submissions should be in the form of extended abstracts and must not exceed three pages (excluding references) in the SIGPLAN two-column format.

The submission website is: https://tpsa26.hotcrp.com