55 citations · 65 across the 14 of their papers we have counts for
14 papers
On-the-fly LTLf Synthesis under Partial Observability
Nadav Alon, Supratik Chakraborty, Alexandre Duret-Lutz +4
LTLf synthesis under partial observability requires reasoning about unobservable environment variables, which is typically handled by constructing a belief-state DFA via subset con…
Efficient Incremental #SAT via Cross-Instance Knowledge Reuse
Uriya Bartal, Dror Fried, Jean-Marie Lagniez
Model counting () is a fundamental yet -complete problem central to probabilistic reasoning. In this work, we address \textit{incremental model counting},…
Algorithmic Aspects of Todas Theorem
Dror Fried, Etay Segal, Gad E. Yaron
Toda's Theorem is a fundamental result in computational complexity theory, whose proof is based on a reduction from a QBF problem with a constant number of quantifiers to a model c…
On Dependent Variables in Reactive Synthesis
S. Akshay, Eliyahu Basa, Supratik Chakraborty +1
Given a Linear Temporal Logic (LTL) formula over input and output variables, reactive synthesis requires us to design a deterministic Mealy machine that gives the values of outputs…
Algorithmic Foundations of Inexact Computing
John Augustine, Dror Fried, Krishna V. Palem +2
Inexact computing also referred to as approximate computing is a style of designing algorithms and computing systems wherein the accuracy of correctness of algorithms executing on…
Deep Learning Models for Automated Classification of Dog Emotional States from Facial Expressions
Tali Boneh-Shitrit, Shir Amir, Annika Bremhorst +4
Similarly to humans, facial expressions in animals are closely linked with emotional states. However, in contrast to the human domain, automated recognition of emotional states fro…
Mimicking Behaviors in Separated Domains
Giuseppe De Giacomo, Dror Fried, Fabio Patrizi +1
Devising a strategy to make a system mimicking behaviors from another system is a problem that naturally arises in many areas of Computer Science. In this work, we interpret this p…
Adapting Behaviors via Reactive Synthesis
Gal Amram, Suguman Bansal, Dror Fried +3
In the \emph{Adapter Design Pattern}, a programmer implements a \emph{Target} interface by constructing an \emph{Adapter} that accesses an existing \emph{Adaptee} code. In this wor…
Taming Discrete Integration via the Boon of Dimensionality
Jeffrey M. Dudek, Dror Fried, Kuldeep S. Meel
Discrete integration is a fundamental problem in computer science that concerns the computation of discrete sums over exponentially large sets. Despite intense interest from resear…
Sequential Relational Decomposition
Dror Fried, Axel Legay, Joël Ouaknine +1
The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software…
Functional Synthesis via Input-Output Separation
Supratik Chakraborty, Dror Fried, Lucas M. Tabajara +1
Boolean functional synthesis is the process of constructing a Boolean function from a Boolean specification that relates input and output variables. Despite significant recent deve…
An optimal approximation of discrete random variables with respect to the Kolmogorov distance
Liat Cohen, Dror Fried, Gera Weiss
We present an algorithm that takes a discrete random variable and a number and computes a random variable whose support (set of possible outcomes) is of size at most an…
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
Kuldeep S. Meel, Moshe Vardi, Supratik Chakraborty +5
Constrained sampling and counting are two fundamental problems in artificial intelligence with a diverse range of applications, spanning probabilistic reasoning and planning to con…
Complexity of Canadian Traveler Problem Variants
Dror Fried, Solomon Eyal Shimony, Amit Benbassat +1
The Canadian traveler problem (CTP) is the problem of traversing a given graph, where some of the edges may be blocked - a state which is revealed only upon reaching an incident ve…