[PDF][PDF] Temporal stream logic modulo theories
Temporal stream logic (TSL) extends LTL with updates and predicates over arbitrary
function terms. This allows for specifying dataintensive systems for which LTL is not …
function terms. This allows for specifying dataintensive systems for which LTL is not …
Realizability modulo theories
In this paper we study the problem of realizability of reactive specifications written in LTL T,
which is the extension of LTL where atomic propositions can be literals from a first-order …
which is the extension of LTL where atomic propositions can be literals from a first-order …
[PDF][PDF] Reactive Synthesis Modulo Theories using Abstraction Refinement.
Reactive synthesis builds a system from a specification given as a temporal logic formula.
Traditionally, reactive synthesis is defined for systems with Boolean input and output …
Traditionally, reactive synthesis is defined for systems with Boolean input and output …
Quantitative and approximate monitoring
In runtime verification, a monitor watches a trace of a system and, if possible, decides after
observing each finite prefix whether or not the unknown infinite trace satisfies a given …
observing each finite prefix whether or not the unknown infinite trace satisfies a given …
Decidable synthesis of programs with uninterpreted functions
We identify a decidable synthesis problem for a class of programs of unbounded size with
conditionals and iteration that work over infinite data domains. The programs in our class …
conditionals and iteration that work over infinite data domains. The programs in our class …
Synthesis of data word transducers
In reactive synthesis, the goal is to automatically generate an implementation from a
specification of the reactive and non-terminating input/output behaviours of a system …
specification of the reactive and non-terminating input/output behaviours of a system …
Learning formulas in finite variable logics
We consider grammar-restricted exact learning of formulas and terms in finite variable
logics. We propose a novel and versatile automata-theoretic technique for solving such …
logics. We propose a novel and versatile automata-theoretic technique for solving such …
On synthesis of specifications with arithmetic
R Faran, O Kupferman - SOFSEM 2020: Theory and Practice of Computer …, 2020 - Springer
Variable automata with arithmetic enable the specification of reactive systems with variables
over an infinite domain of numeric values and whose operation involves arithmetic …
over an infinite domain of numeric values and whose operation involves arithmetic …
[PDF][PDF] Parameterized Synthesis for Fragments of First-Order Logic Over Data Words.
We study the synthesis problem for systems with a parameterized number of processes. As
in the classical case due to Church, the system selects actions depending on the program …
in the classical case due to Church, the system selects actions depending on the program …
Register-bounded synthesis
Traditional synthesis algorithms return, given a specification over finite sets of input and
output Boolean variables, a finite-state transducer all whose computations satisfy the …
output Boolean variables, a finite-state transducer all whose computations satisfy the …