A Dyck shift and a Motzkin shift are mathematical models for constraints on genetic sequences. In terms of the theory of symbolic dynamics, neither of the Dyck shift nor the Motzki...
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...