We describe a uniform and efficient framework for checking the satisfiability of a large class
of string constraints. The framework is based on the observation that both satisfiability and …

A fundamental problem in refinement verification is to check that the language of behaviors
of an implementation is included in the language of the specification. We consider the …

We describe and evaluate the first spectrum-based fault localization method aimed at finding
faulty rules in a context-free grammar. It takes as input a test suite and a modified parser for …

Several real-world libraries (eg, reentrant locks, GUI frameworks, serialization libraries)
require their clients to use the provided API in a manner that conforms to a context-free …

Layout-sensitive grammars have been adopted in many modern programming languages. In
a serious language design phase, the specified syntax—typically a grammar—must be …

We describe the first approach to automatically repair bugs in context-free grammars: given
a grammar that fails some tests in a given test suite, we iteratively and gradually transform …

Parsers are omnipresent in almost all software systems. However, an operational
implementation of parsers cannot answer many “how”,“why” and “what if” questions, why …

In this work, we propose the notion of a Parse Condition—a logical condition that is
satisfiable if and only if a given string w can be successfully parsed using a grammar G …

Ad hoc parsers are everywhere: they appear any time a string is split, looped over,
interpreted, transformed, or otherwise processed. Every ad hoc parser gives rise to a …

We propose a scalable framework for deciding, proving, and explaining (in) equivalence of
context-free grammars. We present an implementation of the framework and evaluate it on …