activity
20132026
most citedProgrammatically Interpretable Reinforcement Learning

94 citations · 449 across the 53 of their papers we have counts for

collaborators
Showing cs.PLShow all

8 papers · 1 filter

cs.PL2023★ 4 cited

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,…

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.PL2019★ 84 cited

Optimization and Abstraction: A Synergistic Approach for Analyzing Neural Network Robustness

Greg Anderson, Shankara Pailoor, Isil Dillig +1

In recent years, the notion of local robustness (or robustness for short) has emerged as a desirable property of deep neural networks. Intuitively, robustness means that small pert…

cs.PL2017★ 11 cited

Data-Driven Program Completion

Yanxin Lu, Swarat Chaudhuri, Chris Jermaine +1

We introduce program splicing, a programming methodology that aims to automate the commonly used workflow of copying, pasting, and modifying code available online. Here, the progra…

cs.PL2017★ 47 cited

Neural Sketch Learning for Conditional Program Generation

Vijayaraghavan Murali, Letao Qi, Swarat Chaudhuri +1

We study the problem of generating source code in a strongly typed, Java-like programming language, given a label (for example a set of API calls or types) carrying a small amount…

cs.PL2016

Component-based Synthesis of Table Consolidation and Transformation Tasks from Examples

Yu Feng, Ruben Martins, Jacob Van Geffen +2

This paper presents an example-driven synthesis technique for automating a large class of data preparation tasks that arise in data science. Given a set of input tables and an out-…

cs.PL2015★ 1 cited

Abstract Interpretation with Infinitesimals: Towards Scalability in Nonstandard Static Analysis (Extended Version)

Kengo Kido, Swarat Chaudhuri, Ichiro Hasuo

We extend abstract interpretation for the purpose of verifying hybrid systems. Abstraction has been playing an important role in many verification methodologies for hybrid systems,…

cs.PL2013

A Semantics for Approximate Program Transformations

Edwin Westbrook, Swarat Chaudhuri

An approximate program transformation is a transformation that can change the semantics of a program within a specified empirical error bound. Such transformations have wide applic…