Combinator-Based Fixpoint Algorithms for Big-Step Abstract Interpreters

Explore a 28-minute conference talk from ICFP 2023 that delves into combinator-based fixpoint algorithms for big-step abstract interpreters. Learn how to systematically develop and ensure the soundness of sophisticated fixpoint algorithms using small, reusable combinators. Discover how these combinators can be composed to create customized fixpoint algorithms, describing program analysis order, recursive function unfolding, and loop unrolling. Gain insights into the formal metatheory that guarantees soundness when composing verified combinators. Examine experimental validations of this approach through analyses of Stratego, Scheme, and WebAssembly. Access supplementary materials, including artifacts evaluated as reusable, to further enhance your understanding of this innovative approach to static analysis.

[ICFP'23] Combinator-Based Fixpoint Algorithms for Big-Step Abstract Interpreters