Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Udupa, Abhishek"'
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) is a standardized format for specifying the correctness specification w
Externí odkaz:
http://arxiv.org/abs/2312.06001
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 by the user. In this paper, we motivate and define the problem of quan
Externí odkaz:
http://arxiv.org/abs/1909.05964
Syntax-guided synthesis (SyGuS) is the computational problem of finding an implementation $f$ that meets both a semantic constraint given by a logical formula $\phi$ in a background theory $\mathbb{T}$, and a syntactic constraint given by a grammar $
Externí odkaz:
http://arxiv.org/abs/1904.07146
Autor:
Le, Vu, Perelman, Daniel, Polozov, Oleksandr, Raza, Mohammad, Udupa, Abhishek, Gulwani, Sumit
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 technology is often used in an interactive setting, efficiency and cor
Externí odkaz:
http://arxiv.org/abs/1703.03539
Autor:
Udupa, Abhishek
Over the past two decades, microprocessor manufacturers have typically relied on wider issue widths and deeper pipelines to obtain performance improvements for single threaded applications. However, in the recent years, with power dissipation and wir
Externí odkaz:
http://hdl.handle.net/2005/971
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 its correctness is specified using safety and liveness requirements. De
Externí odkaz:
http://arxiv.org/abs/1505.04409
Autor:
Raghothaman, Mukund, Udupa, Abhishek
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]. This paper describes concretely the input format of a
Externí odkaz:
http://arxiv.org/abs/1405.5590
Autor:
Alur, Rajeev, Martin, Milo, Raghothaman, Mukund, Stergiou, Christos, Tripakis, Stavros, Udupa, Abhishek
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-state protocols using scenarios: we show that it is possible to autom
Externí odkaz:
http://arxiv.org/abs/1402.7150
Publikováno v:
International Journal of Advanced Computer Science & Applications; Nov2023, Vol. 14 Issue 11, p552-559, 8p
Autor:
Alur, Rajeev, Bodik, Rastislav, Dallal, Eric, Fisman, Dana, Garg, Pranav, Juniwal, Garvit, Kress-Gazit, Hadas, Madhusudan, P, Martin, Milo MK, Raghothaman, Mukund, Saha, Shamwaditya, Seshia, Sanjit A, Singh, Rishabh, Solar-Lezama, Armando, Torlak, Emina, Udupa, Abhishek
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______325::d850e6749da4f1ea429162df8d53dda4
https://escholarship.org/uc/item/2mc6110k
https://escholarship.org/uc/item/2mc6110k