The goal of programmatic Learning from Demonstration (LfD) is to learn a policy in a
programming language that can be used to control a robot's behavior from a set of user …

In recent years, program synthesis research has made significant progress in creating user-
friendly tools for Programming by example (PBE) and Programming by demonstration (PBD) …

Our main result is a polynomial time algorithm for deciding realizability for the GXU sublogic
of linear temporal logic. This logic is particularly suitable for the specification of embedded …

Different classes of automata on infinite words have different expressive power. Deciding
whether a given language L⊆ Σ ω can be expressed by an automaton of a desired class …

In many applications for which reactive synthesis is attractive, computed implementations
need to have understandable behavior. While some existing synthesis approaches compute …

We present a set of metrics intended to supplement designer intuitions when designing
swarm-robotic systems, increase accuracy in extrapolating swarm behavior from algorithmic …

The automation of decision procedures makes certification essential. We suggest to use
determinacy of turn-based two-player games with regular winning conditions in order to …