Parikh's Theorem is a fundamental result in automata theory with numerous applications in
computer science. These include software verification (eg infinite-state verification, string …

The theory of arrays has been widely investigated. But concatenation, an operator that
consistently appears in specifications of functional-correctness verification tools (eg, Dafny …

Recently, symbolic program analysis techniques have been extended to quantitative
analyses using model counting constraint solvers. Given a constraint and a bound, a model …

In this short survey, we present logical formalisms in which reasoning about concrete
domains is embedded in formulae at the atomic level. These include temporal logics with …

We revisit the classic problem of proving safety over parameterised concurrent systems, ie,
an infinite family of finite-state concurrent systems that are represented by some finite …

We present a new algorithm for model counting of a class of string constraints. In addition to
the classic operation of concatenation, our class includes some recursively defined …

In the past decade, satisfiability modulo theories (SMT) solvers have been extended to
support the theory of strings and regular expressions. This theory has proven to be useful in …

Existing approaches to temporal verification of higher-order functional programs have either
sacrificed compositionality in favor of achieving automation or vice-versa. In this paper we …

The increased interest in string solving in the recent years has made it very hard to identify
the right tool to address a particular user's purpose. Firstly, there is a multitude of string …

We consider the description logic ALCFP (D Σ) over the concrete domain D Σ=(Σ∗,≺,=,(= w)
w∈ Σ∗), where≺ is the strict prefix order over finite strings in Σ∗. Using an automata-based …