Synthesizing abstract transformers

• Published in: Proceedings of ACM on programming languages 2022-10, Vol.6 (OOPSLA2), p.1291-1319
• Main Authors: Kalita, Pankaj Kumar, Muduli, Sujit Kumar, D’Antoni, Loris, Reps, Thomas, Roy, Subhajit
• Format: Article
• Language: English
• ISSN: 2475-1421; 2475-1421
• DOI: 10.1145/3563334

This paper addresses the problem of creating abstract transformers automatically. The method we present automates the construction of static analyzers in a fashion similar to the way yacc automates the construction of parsers. Our method treats the problem as a program-synthesis problem. The user provides specifications of (i) the concrete semantics of a given operation op , (ii) the abstract domain A to be used by the analyzer, and (iii) the semantics of a domain-specific language L in which the abstract transformer is to be expressed. As output, our method creates an abstract transformer for op in abstract domain A , expressed in L (an “ L -transformer for op over A ”). Moreover, the abstract transformer obtained is a most-precise L -transformer for op over A ; that is, there is no other L -transformer for op over A that is strictly more precise. We implemented our method in a tool called AMURTH. We used AMURTH to create sets of replacement abstract transformers for those used in two existing analyzers, and obtained essentially identical performance. However, when we compared the existing transformers with the transformers obtained using AMURTH, we discovered that four of the existing transformers were unsound, which demonstrates the risk of using manually created transformers.