Temporal Stream Logic modulo Theories

04/30/2021
by   Bernd Finkbeiner, et al.
0

Temporal Stream Logic (TSL) is a temporal logic that extends LTL with updates and predicates over arbitrary function terms. This allows for specifying data-intensive systems for which LTL is not expressive enough. In TSL, functions and predicates are uninterpreted. In this paper, we investigate the satisfiability problem of TSL both with respect to the standard underlying theory of uninterpreted functions and with respect to other theories such as Presburger arithmetic. We present an algorithm for checking the satisfiability of a TSL formula in the theory of uninterpreted functions and evaluate it on different benchmarks: It scales well and is able to validate assumptions in a real-world system design. The algorithm is not guaranteed to terminate. In fact, we show that TSL satisfiability is highly undecidable in the theories of uninterpreted functions, equality, and Presburger arithmetic, proving that no complete algorithm exists. However, we identify three fragments of TSL for which the satisfiability problem is (semi-)decidable in the theory of uninterpreted functions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/15/2017

A Decidable Fragment of Second Order Logic With Applications to Synthesis

We propose a fragment of many-sorted second order logic ESMT and show th...
research
01/26/2018

Satisfiability Modulo Transcendental Functions via Incremental Linearization

In this paper we present an abstraction-refinement approach to Satisfiab...
research
04/28/2022

Linear Temporal Logic Modulo Theories over Finite Traces (Extended Version)

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where...
research
07/31/2023

Decidable Fragments of LTLf Modulo Theories (Extended Version)

We study Linear Temporal Logic Modulo Theories over Finite Traces (LTLfM...
research
09/15/2017

Variant-Based Decidable Satisfiability in Initial Algebras with Predicates

Decision procedures can be either theory-specific, e.g., Presburger arit...
research
05/07/2014

Structured Learning Modulo Theories

Modelling problems containing a mixture of Boolean and numerical variabl...
research
09/15/2017

A Constructor-Based Reachability Logic for Rewrite Theories

Reachability logic has been applied to K rewrite-rule-based language def...

Please sign up or login with your details

Forgot password? Click here to reset