
A Decidable Fragment of Second Order Logic With Applications to Synthesis
We propose a fragment of manysorted second order logic ESMT and show th...
read it

Satisfiability Modulo Transcendental Functions via Incremental Linearization
In this paper we present an abstractionrefinement approach to Satisfiab...
read it

Generalizing NonPunctuality for Timed Temporal Logic with Freeze Quantifiers
Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL...
read it

VariantBased Decidable Satisfiability in Initial Algebras with Predicates
Decision procedures can be either theoryspecific, e.g., Presburger arit...
read it

A ConstructorBased Reachability Logic for Rewrite Theories
Reachability logic has been applied to K rewriterulebased language def...
read it

Structured Learning Modulo Theories
Modelling problems containing a mixture of Boolean and numerical variabl...
read it

Program Verification via Predicate Constraint Satisfiability Modulo Theories
This paper presents a verification framework based on a new class of pre...
read it
Temporal Stream Logic modulo Theories
Temporal Stream Logic (TSL) is a temporal logic that extends LTL with updates and predicates over arbitrary function terms. This allows for specifying dataintensive 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 realworld 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
Comments
There are no comments yet.