An efficient translation from a modal μ-calculus over finite trees with converse to tree automata - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2016

An efficient translation from a modal μ-calculus over finite trees with converse to tree automata

Louis Jachiet
Pierre Genevès
Nabil Layaïda

Abstract

We present a direct translation from a sub-logic of µ-calculus to non-deterministic binary automata of finite trees. The logic is an alternation-free modal µ-calculus, restricted to finite trees and where formulae are cycle-free. This logic is expressive enough to encode significant fragments of query languages (such as Regular XPath). The size of the generated automaton (the number of transitions) is bounded by 2^n where n is the size of a Fischer-Ladner closure of the formula. This is an improvement over previous translations in 2^{n^2} . We have implemented our translation. In practice, our prototype effectively decides static analysis problems that were beyond reach, such as the XPath containment problem with DTDs of significant size.

Domains

Web
Fichier principal
Vignette du fichier
aaai17 (1).pdf (266.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01117830 , version 1 (18-02-2015)
hal-01117830 , version 2 (09-12-2016)

Identifiers

  • HAL Id : hal-01117830 , version 2

Cite

Louis Jachiet, Pierre Genevès, Nabil Layaïda. An efficient translation from a modal μ-calculus over finite trees with converse to tree automata. 2016. ⟨hal-01117830v2⟩
337 View
205 Download

Share

Gmail Facebook X LinkedIn More