A modular static analysis decomposes a program's analysis into analyses of its parts, or components. An inter-component analysis instructs an intra-component analysis to analyse each component independently of the others. Additional analyses are scheduled for newly discovered components, and for dependent components that need to account for newly discovered component information. Modular static analyses are scalable, can be tuned to a high precision, and support the analysis of programs that are highly dynamic, featuring e.g., higher-order functions or dynamically allocated processes.

In this paper, we present the engineering aspects of MAF, a static analysis framework for implementing modular analyses for higher-order languages. For any such modular analysis, the framework provides a reusable inter-component analysis and it suffices to implement its intra-component analysis. The intra-component analysis can be composed from several interdependent and reusable Scala traits. This design facilitates changing the analysed language, as well as the analysis precision with minimal effort. We illustrate the use of MAF through its instantiation for several different analyses of Scheme programs.
Original languageEnglish
Title of host publicationProceedings of the 20th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM 2020)
PublisherIEEE
Pages37-42
ISBN (Print)978-1-7281-9248-2
Publication statusPublished - 27 Sep 2020
Event20th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM2020) - Adelaide, Australia
Duration: 27 Sep 202028 Sep 2020

Conference

Conference20th IEEE International Working Conference on Source Code Analysis and Manipulation (SCAM2020)
CountryAustralia
CityAdelaide
Period27/09/2028/09/20

ID: 53858429