activity
20172026
most citedProgram Synthesis Through Reinforcement Learning Guided Tree Search

3 citations · 5 across the 6 of their papers we have counts for

collaborators

9 papers

cs.PL2026

Geo: A Query Rewrite Framework for Graph Pattern Mining

Nazanin Yousefian, Kasra Jamshidi, Keval Vora +1

Graph pattern mining is important for analyzing graph data. Graph mining systems typically require answering pattern matching queries, which involve solving the NP-complete subgrap…

cs.PL2023

Saggitarius: A DSL for Specifying Grammatical Domains

Anders Miltner, Devon Loehr, Arnold Mong +2

Common data types like dates, addresses, phone numbers and tables can have multiple textual representations, and many heavily-used languages, such as SQL, come in several dialects.…

cs.CR2023★ 2 cited

Certifying Zero-Knowledge Circuits with Refinement Types

Junrui Liu, Ian Kretz, Hanzhi Liu +7

Zero-knowledge (ZK) proof systems have emerged as a promising solution for building security-sensitive applications. However, bugs in ZK applications are extremely difficult to det…

cs.PL2022

Technical Report: Match-reference regular expressions and lenses

Jeanne-Marie Musca, Anders Miltner, Kathleen Fisher +1

A lens is a single program that specifies two data transformations at once: one transformation converts data from source format to target format and a second transformation inverts…

cs.PL2021

Bottom-up Synthesis of Recursive Functional Programs using Angelic Execution

Anders Miltner, Adrian Trejo Nuñez, Ana Brendel +2

We present a novel bottom-up method for the synthesis of functional recursive programs. While bottom-up synthesis techniques can work better than top-down methods in certain settin…

cs.PL2020

Data-Driven Inference of Representation Invariants

Anders Miltner, Saswat Padhi, Todd Millstein +1

A representation invariant is a property that holds of all values of abstract type produced by a module. Representation invariants play important roles in software engineering and…