What is it about?
Program synthesis is the technique of automatically generating programs for a certain domain that meet the given requirements. This work presents a practical algorithm that uses classical results from algebraic geometry for the synthesis of programs that manipulate data using polynomials. The program domain contains the so-called polynomial programs which are imperative programs where all the assertions, assignments, and loop guards are polynomial over the program variables.
Featured Image
Photo by Clément Hélardot on Unsplash
Why is it important?
Polynomial programs are found as subroutines in many complex programs. Our algorithm can be used to verify and synthesize such subroutines.
Perspectives
It would be interesting to find more practical domains where polynomial program synthesis can be used.
S. Hitarth
Hong Kong University of Science and Technology
It would be interesting to see how other classical results from algebraic geometry and pure mathematics can be used further to improve program synthesis and verification algorithms' efficiency.
Harshit Jitendra Motwani
Ghent University
Read the Original
This page is a summary of: Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs, Proceedings of the ACM on Programming Languages, April 2023, ACM (Association for Computing Machinery),
DOI: 10.1145/3586052.
You can read the full text:
Contributors
The following have contributed to this page
