Synthesizing Abstract Transformers for Reduced-Product Domains

Pankaj Kumar Kalita, Thomas W. Reps, Subhajit Roy

Abstract: Recently, we showed how to apply program-synthesis techniques to create abstract transformers in a user-provided domain-specific language (DSL) \({\mathcal {L}}\) (i.e., “\({\mathcal {L}}\)-transformers”). This algorithm does not scale when applied to reduced-product domains: synthesizing transformers for all of the component domains simultaneously blows up the search-space.