Rewriting logic is a simple computational logic that can naturally express both concurrent
computation and logical deduction with great generality. This paper provides a gentle …

We perform static analysis of Java programs to answer a simple question: which values may
occur as results of string expressions? The answers are summarized for each expression by …

Probabilistic finite-state string transducers (FSTs) are extremely popular in natural language
processing, due to powerful generic methods for applying, composing, and learning them …

On the basis of regular tree grammars, we present a formal framework for XML schema
languages. This framework helps to describe, compare, and implement such schema …

Despite the fact that JSON is currently one of the most popular formats for exchanging data
on the Web, there are very few studies on this topic and there is no agreement upon a …

Many programming problems call for turning geometrical thoughts into code: tables,
hierarchical structures, nests of objects, trees, forests, graphs, and so on. Linear text does …

Security protocols employing cryptographic primitives with algebraic properties are
conveniently modeled using Horn clauses modulo equational theories. We consider clauses …

On a case study, we present a new approach for verifying cryptographic protocols, based on
rewriting and on tree automata techniques. Protocols are operationally described using …

Separation Logic (SL) with inductive definitions is a natural formalism for specifying complex
recursive data structures, used in compositional verification of programs manipulating such …

Although different satisfiability decision procedures can be combined by algorithms such as
those of Nelson–Oppen or Shostak, current tools typically can only support a finite number of …