The Cypher property graph query language is an evolving language, originally designed
and implemented as part of the Neo4j graph database, and it is currently used by several …

Runtime monitoring is a general approach to verifying system properties at runtime by
comparing system events against a specification formalizing which event sequences are …

We present a new framework for verifying partial specifications of programs in order to catch
type and memory errors and check data structure invariants. Our technique can verify a large …

In this survey, we review practical algorithms for graph-theoretic problems that are
expressible in monadic second-order logic. Monadic second-order (MSO) logic allows …

Symbolic Automata extend classical automata by using symbolic alphabets instead of finite
ones. Most of the classical automata algorithms rely on the alphabet being finite, and …

The manipulation of raw string data is ubiquitous in security-critical software, and verification
of such software relies on efficiently solving string and regular expression constraints via …

It has been known since 1960 that the class of regular languages1 is linked to decidability
questions in formal logics. In particular, WS1S (Weak monadic Second-order theory of 1 …

String analysis is the problem of reasoning about how strings are manipulated by a program.
It has numerous applications including automatic detection of cross-site scripting, and …

We study the fundamental issue of decidability of satisfiability over string logics with
concatenations and finite-state transducers as atomic operations. Although restricting to one …

Verifying string manipulating programs is a crucial problem in computer security. String
operations are used extensively within web applications to manipulate user input, and their …