Non-backtracking top-down algorithm for checking tree automata containment

  • Authors:

  • Tadahiro Suda;Haruo Hosoya

  • Affiliations:

  • Graduate School of Information Science and Technology, University of Tokyo, Japan;Graduate School of Information Science and Technology, University of Tokyo, Japan

  • Venue:
  • CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Checking tree automata containment is a fundamental operation in static verification of XML processing programs. However, tree automata containment problem is known to be EXPTIME-complete and a standard algorithm with determinization of automata easily blows up even in practical cases. Hosoya, Vouillon, and Pierce have proposed a top-down algorithm that efficiently works for a large class of typical instances. However, there still remains a considerable inefficiency because of repeated calculation incurred by backtracking. In this paper, we propose a non-backtracking top-down algorithm which improves this inefficiency. In the algorithm, we introduce “dependencies” among performed computations and, by exploiting these, we can recover certain kinds of information lost by backtracking. One difficulty in constructing such algorithm is, however, that, since some dependency information can be useless, we may be misled to needless computation by using such information. To alleviate this problem, we carefully check the usefulness of each dependency whenever we use it. Since these checks introduce a subtlety to our algorithm, we rigorously formalize it with a correctness proof. Our preliminary experiments show that our algorithm works more efficiently compared to the previous algorithm.