7 citations · 17 across the 10 of their papers we have counts for
5 papers · 1 filter
Dynamic Programming for Symbolic Boolean Realizability and Synthesis
Yi Lin, Lucas M. Tabajara, Moshe Y. Vardi
Inspired by recent progress in dynamic programming approaches for weighted model counting, we investigate a dynamic-programming approach in the context of boolean realizability and…
Model Checking Strategies from Synthesis Over Finite Traces
Suguman Bansal, Yong Li, Lucas Martinelli Tabajara +2
The innovations in reactive synthesis from {\em Linear Temporal Logics over finite traces} (LTLf) will be amplified by the ability to verify the correctness of the strategies gener…
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…
On the Power of Automata Minimization in Reactive Synthesis
Shufang Zhu, Lucas M. Tabajara, Geguang Pu +1
Temporal logic is often used to describe temporal properties in AI applications. The most popular language for doing so is Linear Temporal Logic (LTL). Recently, LTL on finite trac…
Witnessing Secure Compilation
Kedar S. Namjoshi, Lucas M. Tabajara
Compiler optimizations are designed to improve run-time performance while preserving input-output behavior. Correctness in this sense does not necessarily preserve security: it is…