G <scp>enesys</scp> : A Novel Evolutionary Program Synthesis Tool with Continuous Optimization

Automatic software generation based on some specification is known as program synthesis . Most existing approaches formulate program synthesis as a search problem with discrete parameters. In this article, we present a novel formulation of program synthesis as a continuous optimization problem using an evolutionary approach, known as Covariance Matrix Adaptation Evolution Strategy. We then propose several mapping schemes to convert the continuous formulation into actual programs and propose different restart policies for the evolutionary approach. This is the first work that demonstrates the feasibility of continuous approach in synthesizing complex programs, not just simple toy programs. We compare our system, Genesys , to several recent program synthesis techniques (in both discrete and continuous domains). We find that Genesys synthesizes more programs within a fixed time budget than those existing schemes. For example, for programs of length 10, Genesys synthesizes 28% more programs than those existing schemes within the same time budget.

Authors

Institutions

Publication Details

Journal
ACM transactions on probabilistic machine learning.
Published
2025-11-13
DOI
https://doi.org/10.1145/3776736
Primary Topic
Advanced Multi-Objective Optimization Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

G enesys : A Novel Evolutionary Program Synthesis Tool with Continuous Optimization

Justin Gottschlich, Javier S. Turek, Shantanu Mandal, Abdullah Muzahid et al.
ACM transactions on probabilistic machine learning.
Advanced Multi-Objective Optimization Algorithms
article

G enesys : A Novel Evolutionary Program Synthesis Tool with Continuous Optimization

Justin Gottschlich, Javier S. Turek, Shantanu Mandal, Abdullah Muzahid, Todd A. Anderson
article en

Abstract

Automatic software generation based on some specification is known as program synthesis . Most existing approaches formulate program synthesis as a search problem with discrete parameters. In this article, we present a novel formulation of program synthesis as a continuous optimization problem using an evolutionary approach, known as Covariance Matrix Adaptation Evolution Strategy. We then propose several mapping schemes to convert the continuous formulation into actual programs and propose different restart policies for the evolutionary approach. This is the first work that demonstrates the feasibility of continuous approach in synthesizing complex programs, not just simple toy programs. We compare our system, Genesys , to several recent program synthesis techniques (in both discrete and continuous domains). We find that Genesys synthesizes more programs within a fixed time budget than those existing schemes. For example, for programs of length 10, Genesys synthesizes 28% more programs than those existing schemes within the same time budget.

ACM transactions on probabilistic machine learning.Vol. 2(1)
Intel (United States) (US), Santa Clara University (US), Bodø Science Park (Norway) (NO), Oregon Physics (United States) (US), Texas A&M University (US), Stanford University (US)
Openalex Percentile: Top 65%
Advanced Multi-Objective Optimization Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.