84 citations · 356 across the 59 of their papers we have counts for
8 papers · 1 filter
Program Synthesis using Conflict-Driven Learning
Yu Feng, Ruben Martins, Osbert Bastani +1
We propose a new conflict-driven program synthesis technique that is capable of learning from past mistakes. Given a spurious program that violates the desired specification, our s…
Automated Migration of Hierarchical Data to Relational Tables using Programming-by-Example
Navid Yaghmazadeh, Xinyu Wang, Isil Dillig
While many applications export data in hierarchical formats like XML and JSON, it is often necessary to convert such hierarchical documents to a relational representation. This pap…
Program Synthesis using Abstraction Refinement
Xinyu Wang, Isil Dillig, Rishabh Singh
We present a new approach to example-guided program synthesis based on counterexample-guided abstraction refinement. Our method uses the abstract semantics of the underlying DSL to…
Verifying Equivalence of Database-Driven Applications
Yuepeng Wang, Isil Dillig, Shuvendu K. Lahiri +1
This paper addresses the problem of verifying equivalence between a pair of programs that operate over databases with different schemas. This problem is particularly important in t…
Synthesis of Data Completion Scripts using Finite Tree Automata
Xinyu Wang, Isil Dillig, Rishabh Singh
In application domains that store data in a tabular format, a common task is to fill the values of some cells using values stored in other cells. For instance, such data completion…
Failure-Directed Program Trimming (Extended Version)
Kostas Ferles, Valentin Wüstholz, Maria Christakis +1
This paper describes a new program simplification technique called program trimming that aims to improve the scalability and precision of safety checking tools. Given a program ${\…