Sequence theories are an extension of theories of strings with an infini...
Automatic structures are infinite structures that are finitely represent...
Theories over strings are among the most heavily researched logical theo...
Rational verification is the problem of determining which temporal logic...
We study the problem of learning a finite union of integer (axis-aligned...
Probabilistic bisimulation is a fundamental notion of process equivalenc...
String analysis is the problem of reasoning about how strings are manipu...
The tree share structure proposed by Dockins et al. is an elegant model ...
Parameterized synthesis offers a solution to the problem of constructing...
In this contribution we revisit regular model checking, a powerful frame...
Minification is a widely-accepted technique which aims at reducing the s...
The design and implementation of decision procedures for checking path
f...
Word equations are a crucial element in the theoretical foundation of
co...
Recently, it was shown that any theory of strings containing the
string-...
We consider the problem of automatically verifying that a parameterized
...
We revisit the classic problem of proving safety over parameterised
conc...