Synthesizing Abstract Transformers for Reduced-Product Domains
Pankaj Kumar Kalita, Thomas Reps, Subhajit Roy

TL;DR
This paper introduces an algorithm for synthesizing reduced-product domain transformers in abstract interpretation, enabling more precise program analysis by automating the creation of cooperative, domain-specific transformers.
Contribution
It presents a novel algorithm for synthesizing reduced L-transformers across multiple DSLs, improving precision in reduced-product domains for program analysis.
Findings
Synthesizes more precise transformers than manual ones in SAFEstr.
Successfully applied to JavaScript analysis domains.
Enhances abstract interpretation precision through automated transformer synthesis.
Abstract
Recently, we showed how to apply program-synthesis techniques to create abstract transformers in a user-provided domain-specific language (DSL) L (i.e., ''L-transformers"). However, we found that the algorithm of Kalita et al. does not succeed when applied to reduced-product domains: the need to synthesize transformers for all of the domains simultaneously blows up the search space. Because reduced-product domains are an important device for improving the precision of abstract interpretation, in this paper, we propose an algorithm to synthesize reduced L-transformers for a product domain , using multiple DSLs: . Synthesis of reduced-product transformers is quite challenging: first, the synthesis…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsChemical Synthesis and Analysis
