Galois Connections for Recursive Types
Research output: Conference Article in Proceeding or Book/Report chapter › Book chapter › Research › peer-review
Building a static analyses for a real language involves modeling of large domains capturing the many available data types. To scale domain design and support efficient development of project-specific analyzers, it is desirable to be able to build, extend, and change abstractions in a systematic and modular fashion. We present a framework for modular design of abstract domains for recursive types and higher-order functions, based on the theory of solving recursive domain equations. We show how to relate computable abstract domains to our framework, and illustrate the potential of the construction by modularizing a monolithic domain for regular tree grammars. A prototype implementation in the dependently typed functional language Agda shows how the theoretical solution can be used in practice to construct static analysers.
|Title of host publication||From Lambda Calculus to Cybersecurity Through Program Analysis|
|Publication status||Published - 2020|
|Series||Lecture Notes in Computer Science|
No data available