Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs

Explore a groundbreaking 17-minute conference talk from OOPSLA1 2023 that introduces innovative algebro-geometric algorithms for template-based synthesis of polynomial programs. Delve into the world of sketching, a localized approach to program synthesis where programmers provide both specifications and high-level program sketches. Learn how the presented algorithm, based on theorems in polyhedral and real algebraic geometry, overcomes quantifier elimination challenges and reduces the synthesis problem to Quadratic Programming. Discover the first scalable method for sketching-based synthesis of polynomial programs that maintains completeness. Examine experimental results demonstrating the algorithm's effectiveness across various examples from literature. Gain insights into this significant advancement in program synthesis, presented by researchers from Hong Kong University of Science and Technology and KU Leuven.