Sarah E. Chasins
where else to find them
no profile links on file
what they talk about
all 6 in the filters
where they keep going back
- PLDI Workshop Honoring Andreas Podelski3 editions2024–2026
- UIST3 editions2018–2025
all 4 in the filters
on a stage with
all 23 in the filters
who talks about the same things
- Justin Lubin7 talks
- Işıl Dillig21 talks
- Alvin Cheung6 talks
- Nadia Polikarpova24 talks
- Armando Solar-Lezama18 talks
- Thomas Reps20 talks
| title | conference | date |
|---|---|---|
| Navigating AND–OR Graph Modifications to Debug Failing Proof Search | PLDI 2026 | 2026-06-15 |
Provides a concrete debugging method that navigates modifications to AND–OR graphs rather than the raw graph, implemented by compiling modification constraints… | ||
| HiLT: A Library for Generating Human-in-the-Loop Data Transformation GUIs | UIST 2025 | 2025-09-28 |
HiLT is a Python library that generates web GUIs, backend code, and a database from a pipeline of Stage abstractions (each stage is a Python function that… | ||
| Usable PL: Human-Computer Interaction for PL Research | PLMW @ PLDI 2025 | 2025-06-16 |
Argues that HCI methods let PL research pick higher‑impact problems, refine designs, and check real effects by using three concrete study types: reconnaissance… | ||
| Fast Direct Manipulation Programming with Patch-Reconciliation Correspondence | PLDI 2025 | 2025-06-16 |
Introduces a patch-recon architecture that pairs syntactic program patches with a semantic recon that directly updates map output (in-place updates of marks… | ||
| Programming by Navigation | PLDI 2025 | 2025-06-16 |
Defines Strong Completeness and Strong Soundness as showing all and only valid next edit steps, reduces synthesis to a type-inhabitation oracle, compiles types… | ||
| Syntactic Code Search with Sequence-to-Tree Matching: Supporting Syntactic Search with(…) | PLDI 2024 | 2024-06-24 |
A new search architecture drops parsing and uses only tokenization plus a novel sequence-to-tree matching algorithm built on top-down tree automata to give… | ||
| Equivalence by Canonicalization for Synthesis-Backed Refactoring | PLDI 2024 | 2024-06-24 |
Presents equivalence by canonicalization: run compiler-style syntactic transforms (deforestation, partial evaluation) on both direct and combinator sketches… | ||
| How Domain Experts Use an Embedded DSL | OOPSLA 2023 | 2023-10-23 |
An embedded DSL called Mimi targets climate-economics models and the paper reports a contextual inquiry with 9 participants; designers use Julia features like… | ||
| Tea: A High-level Language and Runtime System for Automating Statistical Analysis | UIST 2019 | 2019-10-20 |
Tea is a high-level declarative language plus runtime that compiles specifications into constraint satisfaction to pick and run valid statistical tests… | ||
| Rousillon: Scraping Distributed Hierarchical Web Data | UIST 2018 | 2018-10-14 |
Rousillon is a programming-by-demonstration system (Helena is the readable high‑level language) that learns nested loops from a single iteration of each… | ||
| nothing matches | ||