Summary: Implementing Regular Tree Expressions
Alexander Aiken
IBM Almaden Research Center
650 Harry Rd.
San Jose, CA 95120
aiken@ibm.com
Brian R. Murphy
Computer Science Department
Stanford University
Stanford, CA 94305
brm@cs.stanford.edu
Abstract
Regular tree expressions are a natural formalism for describing the
sets of tree­structured values that commonly arise in programs; thus,
they are well­suited to applications in program analysis. We describe
an implementation of regular tree expressions and our experience with
that implementation in the context of the FL type system. A combi­
nation of algorithms, optimizations, and fast heuristics for computa­
tionally difficult problems yields an implementation efficient enough
for practical use.

Source: Aiken, Alex - Department of Computer Science, Stanford University

Collections: Computer Technologies and Information Sciences