# Mukund Raghothaman

Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Syntax-guided synthesis

- R. Alur, Rastislav Bodík, +7 authors A. Udupa
- Computer Science, Engineering
- Formal Methods in Computer-Aided Design
- 1 October 2013

The classical formulation of the program-synthesis problem is to find a program that meets a correctness specification given as a logical formula. Recent work on program synthesis and program… Expand

Regular Functions and Cost Register Automata

- R. Alur, L. D'Antoni, J. Deshmukh, Mukund Raghothaman, Yifei Yuan
- Computer Science
- 28th Annual ACM/IEEE Symposium on Logic in…
- 25 June 2013

We propose a deterministic model for associating costs with strings that is parameterized by operations of interest (such as addition, scaling, and minimum), a notion of regularity that provides a… Expand

SWIM: Synthesizing What I Mean - Code Search and Idiomatic Snippet Synthesis

- Mukund Raghothaman, Y. Wei, Y. Hamadi
- Computer Science
- IEEE/ACM 38th International Conference on…
- 26 November 2015

Modern programming frameworks come with large libraries, with diverse applications such as for matching regular expressions, parsing XML files and sending email. Programmers often use search engines… Expand

Regular Programming for Quantitative Properties of Data Streams

- R. Alur, Dana Fisman, Mukund Raghothaman
- Computer Science
- ESOP
- 2 April 2016

We propose quantitative regular expressions QREs as a high-level programming abstraction for specifying complex numerical queries over data streams in a modular way. Our language allows the arbitrary… Expand

Regular combinators for string transformations

- R. Alur, Adam Freilich, Mukund Raghothaman
- Computer Science, Mathematics
- CSL-LICS '14
- 12 February 2014

We focus on (partial) functions that map input strings to a monoid such as the set of integers with addition and the set of output strings with concatenation. The notion of regularity for such… Expand

Learning Loop Invariants for Program Verification

- Xujie Si, Hanjun Dai, Mukund Raghothaman, M. Naik, L. Song
- Computer Science
- NeurIPS
- 3 December 2018

A fundamental problem in program verification concerns inferring loop invariants. The problem is undecidable and even practical instances are challenging. Inspired by how human experts construct loop… Expand

Language to Specify Syntax-Guided Synthesis Problems

- Mukund Raghothaman, Abhishek Udupa
- Computer Science
- ArXiv
- 21 May 2014

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 described in [1].… Expand

Automatic Completion of Distributed Protocols with Symmetry

- R. Alur, Mukund Raghothaman, C. Stergiou, S. Tripakis, A. Udupa
- Mathematics, Computer Science
- CAV
- 17 May 2015

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. Correctness is specified… Expand

Decision Problems for Additive Regular Functions

- R. Alur, Mukund Raghothaman
- Computer Science, Mathematics
- ICALP
- 25 April 2013

Additive Cost Register Automata (ACRA) map strings to integers using a finite set of registers that are updated using assignments of the form "x:=y+c" at every step. The corresponding class of… Expand