Algebro-geometric algorithms for template-based synthesis of polynomial programs

AK Goharshady, S Hitarth, F Mohammadi… - Proceedings of the …, 2023 - dl.acm.org
Template-based synthesis, also known as sketching, is a localized approach to program
synthesis in which the programmer provides not only a specification, but also a high-level" …

Recursion synthesis with unrealizability witnesses

A Farzan, D Lette, V Nicolet - Proceedings of the 43rd ACM SIGPLAN …, 2022 - dl.acm.org
We propose SE2GIS, a novel inductive recursion synthesis approach with the ability to both
synthesize code and declare a problem unsolvable. SE2GIS combines a symbolic variant of …

Cyclic program synthesis

S Itzhaky, H Peleg, N Polikarpova, RNS Rowe… - Proceedings of the …, 2021 - dl.acm.org
We describe the first approach to automatically synthesizing heap-manipulating programs
with auxiliary recursive procedures. Such procedures occur routinely in data structure …

Type-directed synthesis of visualizations from natural language queries

Q Chen, S Pailoor, C Barnaby, A Criswell… - Proceedings of the …, 2022 - dl.acm.org
We propose a new technique based on program synthesis for automatically generating
visualizations from natural language queries. Our method parses the natural language …

A case for synthesis of recursive quantum unitary programs

H Deng, R Tao, Y Peng, X Wu - … of the ACM on Programming Languages, 2024 - dl.acm.org
Quantum programs are notoriously difficult to code and verify due to unintuitive quantum
knowledge associated with quantum programming. Automated tools relieving the tedium …

Deductive synthesis of programs with pointers: techniques, challenges, opportunities

S Itzhaky, H Peleg, N Polikarpova, RNS Rowe… - … Aided Verification: 33rd …, 2021 - Springer
Deductive Synthesis of Programs with Pointers: Techniques, Challenges, Opportunities |
SpringerLink Skip to main content Advertisement SpringerLink Account Menu Find a journal …

A unifying type-theory for higher-order (amortized) cost analysis

V Rajani, M Gaboardi, D Garg, J Hoffmann - Proceedings of the ACM on …, 2021 - dl.acm.org
This paper presents λ-amor, a new type-theoretic framework for amortized cost analysis of
higher-order functional programs and shows that existing type systems for cost analysis can …

Raising expectations: automating expected cost analysis with types

D Wang, DM Kahn, J Hoffmann - Proceedings of the ACM on …, 2020 - dl.acm.org
This article presents a type-based analysis for deriving upper bounds on the expected
execution cost of probabilistic programs. The analysis is naturally compositional, parametric …

Synthesizing Efficient Memoization Algorithms

Y Sun, X Peng, Y **ong - Proceedings of the ACM on Programming …, 2023 - dl.acm.org
In this paper, we propose an automated approach to finding correct and efficient
memoization algorithms from a given declarative specification. This problem has two major …

Code synthesis for sparse tensor format conversion and optimization

T Popoola, T Zhao, A St. George, K Bhetwal… - Proceedings of the 21st …, 2023 - dl.acm.org
Many scientific applications compute using sparse data and store that data in a variety of
sparse formats because each format has unique space and performance benefits …