Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Watch a conference presentation from POPL 2018 exploring a novel approach to example-guided program synthesis that leverages counterexample-guided abstraction refinement. Learn how researchers from the University of Texas at Austin and Microsoft Research developed a methodology that uses abstract semantics of domain-specific languages to significantly reduce the search space compared to concrete semantics techniques. Discover the implementation of synthesis using abstraction refinement (SYNGAR) through abstract finite tree automata (AFTA), demonstrated in the Blaze framework. See how this framework achieves impressive performance improvements in string and matrix transformation domains, showing 90x speed-ups over existing tools like Microsoft PowerShell's FlashFill and Prose synthesizer. Understand the iterative refinement process that either finds a valid program satisfying given examples or proves the impossibility within the DSL constraints.
