18 citations · 24 across the 5 of their papers we have counts for
7 papers
The SyGuS Language Standard Version 2.1
Saswat Padhi, Elizabeth Polgreen, Mukund Raghothaman +2
The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Syntax-guided synthesis (SyGuS) i…
Quantitative Programming by Examples
Sumit Gulwani, Kunal Pathak, Arjun Radhakrishna +2
Programming-by-Example (PBE) systems synthesize an intended program in some (relatively constrained) domain-specific language from a small number of input-output examples provided…
SyGuS-Comp 2018: Results and Analysis
Rajeev Alur, Dana Fisman, Saswat Padhi +2
Syntax-guided synthesis (SyGuS) is the computational problem of finding an implementation that meets both a semantic constraint given by a logical formula in a background t…
Interactive Program Synthesis
Vu Le, Daniel Perelman, Oleksandr Polozov +3
Program synthesis from incomplete specifications (e.g. input-output examples) has gained popularity and found real-world applications, primarily due to its ease-of-use. Since this…
Automatic Completion of Distributed Protocols with Symmetry
Rajeev Alur, Mukund Raghothaman, Christos Stergiou +2
A distributed protocol is typically modeled as a set of communicating processes, where each process is described as an extended state machine along with fairness assumptions, and i…
Language to Specify Syntax-Guided Synthesis Problems
Mukund Raghothaman, Abhishek Udupa
We present a language to specify syntax guided synthesis (SyGuS) problems. Syntax guidance is a prominent theme in contemporary program synthesis approaches, and SyGuS was first de…
Synthesizing Finite-state Protocols from Scenarios and Requirements
Rajeev Alur, Milo Martin, Mukund Raghothaman +3
Scenarios, or Message Sequence Charts, offer an intuitive way of describing the desired behaviors of a distributed protocol. In this paper we propose a new way of specifying finite…