76 citations · 344 across the 30 of their papers we have counts for
6 papers · 1 filter
Modular System Synthesis
Kanghee Park, Keith J. C. Johnson, Loris D'Antoni +1
This paper describes a way to improve the scalability of program synthesis by exploiting modularity: larger programs are synthesized from smaller programs. The key issue is to make…
Newtonian Program Analysis of Probabilistic Programs
Di Wang, Thomas Reps
Due to their quantitative nature, probabilistic programs pose non-trivial challenges for designing compositional and efficient program analyses. Many analyses for probabilistic pro…
Coarse-Tuning Models of Code with Reinforcement Learning Feedback
Abhinav Jain, Chima Adiole, Swarat Chaudhuri +2
Large Language Models (LLMs) pre-trained on code have recently emerged as the dominant approach to program synthesis. However, these models are trained using next-token prediction,…
Weighted Context-Free-Language Ordered Binary Decision Diagrams
Meghana Sistla, Swarat Chaudhuri, Thomas Reps
This paper presents a new data structure, called \emph{Weighted Context-Free-Language Ordered BDDs} (WCFLOBDDs), which are a hierarchically structured decision diagram, akin to Wei…
Symbolic Quantum Simulation with Quasimodo
Meghana Sistla, Swarat Chaudhuri, Thomas Reps
The simulation of quantum circuits on classical computers is an important problem in quantum computing. Such simulation requires representations of distributions over very large se…
Synthesizing Specifications
Kanghee Park, Loris D'Antoni, Thomas Reps
Every program should be accompanied by a specification that describes important aspects of the code's behavior, but writing good specifications is often harder than writing the cod…