A Static Analysis Using Tree Automata for XML Access Control

Yagi, Isao; Takata, Yoshiaki; Seki, Hiroyuki

doi:10.1007/11562948_19

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2006

Publication Types

Select...

Book1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These applications benefit from the good closure properties and positive decidability results for tree automata. Recently, there are more advanced applications including protocol verification [2,11], type inference [8,10], querying in databases [26,27] and theorem proving [18].…”

Section: Introductionmentioning

confidence: 99%

Propositional Tree Automata

Hendrix

Ohsaki

Viswanathan

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In the paper, we introduce a new tree automata framework, called propositional tree automata, capturing the class of tree languages that are closed under an equational theory and Boolean operations. This framework originates in work on developing a sufficient completeness checker for specifications with rewriting modulo an equational theory. Propositional tree automata recognize regular equational tree languages. However, unlike regular equational tree automata, the class of propositional tree automata is closed under Boolean operations. This extra expressiveness does not affect the decidability of the membership problem. This paper also analyzes in detail the emptiness problem for propositional tree automata with associative theories. Though undecidable in general, we present a semi-algorithm for checking emptiness based on machine learning that we have found useful in practice.

show abstract