Tag
This paper studies adversarial robustness in programming-by-example systems, where an adversary corrupts input-output examples to mislead the synthesizer. It introduces version-space partition aggregation (VPA) as a defense and evaluates it across multiple benchmarks, finding that low-margin tasks are vulnerable and VPA helps only when partition vote margins are preserved.