| ICRA
'26 |
Learning Affordances at Inference-Time for Vision-Language-Action
Models |
| Thesis
'25 |
Scalable and Usable Domain-Specific Automated Reasoning |
| AAAI
'25 |
Online Prompt Selection for Program Synthesis |
| NeurIPS
'24 |
Synthetic Programming Elicitation for Text-to-Code in Very
Low-Resource Programming and Formal Languages |
| AAAI '24 |
An Eager Satisfiability Modulo Theories Solver for Algebraic
Datatypes |
| TCS '23 |
Towards more efficient methods for solving regular-expression heavy
string constraints |
| SYNT '23 |
Genetic Algorithms for Searching a Matrix of Metagrammars for
Synthesis |
| OOPSLA '23 |
Message Chains for Distributed System Verification |
| CAV
'22 |
UCLID5: Multi-Modal Formal Modeling, Verification, and
Synthesis |
| WORDS
'21 |
String Theories involving Regular Membership Predicates: From
Practice to Theory and Back |
| SAT
'21 |
MedleySolver: Online SMT Algorithm Selection |
| FM
'21 |
Z3str4: A Multi-armed String Solver |
| FM
'21 |
BanditFuzz: Fuzzing SMT Solvers with Multi-Agent Reinforcement
Learning |
| CAV
'21 |
An SMT Solver for Regular Expressions and Linear Arithmetic over
String Length |
| ATVA
'21 |
Verification by Gambling on Program Slices |
| VSTTE
'20 |
BanditFuzz: A Reinforcement-Learning Based Performance Fuzzer for
SMT Solvers |
| SYNT '20 |
Synthesis in UCLID5 |
| ASE '20 |
Scaling Client-Specific Equivalence Checking via Impact Boundary
Search |
| CAV
'18 |
StringFuzz: A Fuzzer for String Solvers |
| ASE '18 |
Client-Specific Equivalence Checking |
