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 …

Abstract We present TVLA (Three-Valued-Logic Analyzer). TVLA is a “YACC”-like framework
for automatically constructing static-analysis algorithms from an operational semantics …

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 …

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 …

The MONA tool provides an implementation of automaton-based decision procedures for the
logics WS1S and WS2S. It has been used for numerous applications, and it is remarkably …

We present an automata-based approach for the verification of string operations in PHP
programs based on symbolic string analysis. String analysis is a static analysis technique …

We consider the verification of non-recursive C programs manipulating dynamic linked data
structures with possibly several next pointer selectors and with finite domain non-pointer …

We discuss in this paper how connections, discovered almost forty years ago, between
logics and automata can be used in practice. For such logics expressing regular sets, we …

We deal with matching and locating of patterns in forests of variable arity. A pattern consists
of a structural and a contextual condition for subtrees of a forest, both of which are given as …

Correct validation and sanitization of user input is crucial in web applications for avoiding
security vulnerabilities and erroneous application behavior. We present an automated …