17 citations · 25 across the 11 of their papers we have counts for
16 papers
On Weighted Orlicz-Sobolev inequalities
T V Anoop, Ujjal Das, Subhajit Roy
Let be an open subset of with We identify various classes of Young functions and , and function spaces for a weight function so that the fo…
Synthesis with Explicit Dependencies
Priyanka Golia, Subhajit Roy, Kuldeep S. Meel
Quantified Boolean Formulas (QBF) extend propositional logic with quantification . In QBF, an existentially quantified variable is allowed to depend on all univer…
Symbolic Execution for Randomized Programs
Zachary Susag, Sumit Lahiri, Justin Hsu +1
We propose a symbolic execution method for programs that can draw random samples. In contrast to existing work, our method can verify randomized programs with unknown inputs and ca…
Synthesis of Semantic Actions in Attribute Grammars
Pankaj Kumar Kalita, Miriyala Jeevan Kumar, Subhajit Roy
Attribute grammars allow the association of semantic actions to the production rules in context-free grammars, providing a simple yet effective formalism to define the semantics of…
HOLL: Program Synthesis for Higher OrderLogic Locking
Gourav Takhar, Ramesh Karri, Christian Pilato +1
Logic locking "hides" the functionality of a digital circuit to protect it from counterfeiting, piracy, and malicious design modifications. The original design is transformed into…
Engineering an Efficient Boolean Functional Synthesis Engine
Priyanka Golia, Friedrich Slivovsky, Subhajit Roy +1
Given a Boolean specification between a set of inputs and outputs, the problem of Boolean functional synthesis is to synthesise each output as a function of inputs such that the sp…