[PDF][PDF] Temporal stream logic modulo theories

B Finkbeiner, P Heim, N Passing - International Conference on …, 2022 - library.oapen.org
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 …

Realizability modulo theories

A Rodríguez, C Sánchez - Journal of Logical and Algebraic Methods in …, 2024 - Elsevier
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 …

[PDF][PDF] Reactive Synthesis Modulo Theories using Abstraction Refinement.

B Maderbacher, R Bloem - FMCAD, 2022 - library.oapen.org
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 …

Quantitative and approximate monitoring

TA Henzinger, NE Saraç - … ACM/IEEE Symposium on Logic in …, 2021 - ieeexplore.ieee.org
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 …

Decidable synthesis of programs with uninterpreted functions

P Krogmeier, U Mathur, A Murali… - … on Computer Aided …, 2020 - Springer
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 …

Synthesis of data word transducers

L Exibard, E Filiot, PA Reynier - Logical Methods in Computer …, 2021 - lmcs.episciences.org
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 …

Learning formulas in finite variable logics

P Krogmeier, P Madhusudan - … of the ACM on Programming Languages, 2022 - dl.acm.org
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 …

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 …

[PDF][PDF] Parameterized Synthesis for Fragments of First-Order Logic Over Data Words.

B Bérard, B Bollig, M Lehaut, N Sznajder - FoSSaCS, 2020 - library.oapen.org
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 …

Register-bounded synthesis

A Khalimov, O Kupferman - 30th International Conference on …, 2019 - drops.dagstuhl.de
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 …