Software-based fault isolation (SFI), as used in Google's Native Client (NaCl), relies upon a
conceptually simple machine-code analysis to enforce a security policy. But for complicated …

Regular expressions (regexes) are a denial of service vector in most mainstream
programming languages. Recent empirical work has demonstrated that up to 10% of …

In this paper, we recall the definition of the context-free expressions (or µ-regular
expressions), an algebraic presentation of the context-free languages. Then, we define a …

Current algorithms for context-free parsing inflict a trade-off between ease of understanding,
ease of implementation, theoretical complexity, and practical performance. No algorithm …

We adapt the POSIX policy to the setting of regular expression parsing. POSIX favors
longest left-most parse trees. Compared to other policies such as greedy left-most, the …

In this paper, we present an efficient, functional, and formally verified parsing algorithm for
LL (1) context-free expressions based on the concept of derivatives of formal languages …

This paper presents a new functional programming model for graph structures called
structured graphs. Structured graphs extend conventional algebraic datatypes with explicit …

This paper presents a text-based syntax completion method that uses an LR parser. We
propose formal definitions of candidate text to be completed based on the sentential forms …

When implementing a programming language, we often write a parser and a pretty-printer.
However, manually writing both programs is not only tedious but also error-prone; it may …

Parsers are security-critical components of many software systems, and verified parsing
therefore has a key role to play in secure software design. However, existing verified parsers …