Armando Solar-Lezama
where else to find them
linkedin:armando-solar-lezama-69ab54239
what they talk about
all 8 in the filters
where they keep going back
all 7 in the filters
on a stage with
all 29 in the filters
who talks about the same things
- Nadia Polikarpova24 talks
- Işıl Dillig21 talks
- Arjun Radhakrishna10 talks
- Loris D'Antoni17 talks
- Joshua B. Tenenbaum11 talks
- Sumit Gulwani14 talks
| title | conference | date |
|---|---|---|
| E-Stitch: Top-Down Library Learning for E-Graphs | EGRAPHS 2026 | 2026-06-15 |
Extends Stitch’s top‑down search to operate over e‑graphs, so rewrites like commutativity are matched rather than missed, and introduces a better lower bound… | ||
| Open Challenges for Programming Agents | ODSC AI East 2026 | 2026-04-28 |
Claims that current coding agents hit an analysis bottleneck — they produce lots of code but miss systematic reasoning — and shows concrete tooling that uses… | ||
| Sequential Monte Carlo Program Synthesis with Refinement Proposals | LAFI 2026 | 2026-01-11 |
Extends program synthesis search to include probabilistic programs and evaluates exact marginal likelihood using the PL change named pluck via lazy knowledge… | ||
| Stochastic Lazy Knowledge Compilation for Inference in Discrete Probabilistic Programs | PLDI 2025 | 2025-06-16 |
Implements lazy knowledge compilation in a Julia tool called Pluck and combines it with sequential Monte Carlo that uses locally‑optimal proposals computed… | ||
| Lazy Knowledge Compilation for Discrete PPLs | LAFI 2025 | 2025-01-19 |
A new variant of knowledge compilation for discrete PPLs uses lazy knowledge compilation to delay compiling subexpressions until forced, and it compiles only… | ||
| Toward Probabilistic Coarse-to-Fine Program Synthesis | LAFI 2024 | 2024-01-14 |
Synthesizes programs by starting with coarse probabilistic programs that use randomness as placeholders, then iteratively refines high-entropy expressions into… | ||
| Inductive Program Synthesis Guided by Observational Program Similarity | OOPSLA 2023 | 2023-10-23 |
Introduces SyMetric, a tool that replaces observational equivalence with a domain-specific observational similarity metric to cluster programs into… | ||
| Combining Functional and Automata Synthesis to Discover Causal Reactive Programs | POPL 2023 | 2023-01-15 |
Algorithm converts sequences of video frames plus actions into Autumn programs by iterating functional synthesis (fit per-object update functions from an… | ||
| Top-Down Synthesis for Library Learning | POPL 2023 | 2023-01-15 |
Paper introduces corpus-guided top-down synthesis that builds abstractions by expanding holes and using branch-and-bound pruning with quick upper bounds… | ||
| Searching Entangled Program Spaces | ICFP 2022 | 2022-09-11 |
Introduces equality-constrained tree automata to compactly represent program spaces where subterm choices are entangled, and implements extraction and lazy… | ||
| Automatically Deriving Control-Flow Graph Generators from Operational Semantics | ICFP 2022 | 2022-09-11 |
An algorithm converts small-step operational semantics into an abstract machine, then uses abstract rewriting to synthesize both interpreted-mode and… | ||
| Better Learning through Programming Languages | POPL 2022 | 2022-01-16 |
Argues that combining program synthesis with ML lets search scale and tolerate noise by directing search with a network rather than exhaustive enumeration… | ||
| Deductive Optimization of Relational Data Storage | OOPSLA 2020 | 2020-11-15 |
A system called Castor synthesizes specialized on-disk layouts and native executables from known query templates, serializing the static database ahead of time… | ||
| Liquid Information Flow Control | ICFP 2020 | 2020-08-23 |
Claims a new DSL called Lifty domain-specific language that encodes information-flow policies as liquid refinements and enforces them with a TIO-style security… | ||
| nothing matches | ||