Sciweavers

279 search results - page 1 / 56
» Tree Pattern Rewriting Systems
Sort
View
ATVA
2008
Springer
90views Hardware» more  ATVA 2008»
13 years 7 months ago
Tree Pattern Rewriting Systems
Classical verification often uses abstraction when dealing with data. On the other hand, dynamic XML-based applications have become pervasive, for instance with the ever growing im...
Blaise Genest, Anca Muscholl, Olivier Serre, Marc ...
WISE
2007
Springer
13 years 11 months ago
On Tree Pattern Query Rewriting Using Views
We study and present our findings on two closely related problems on xpath rewriting using views when both the view and the query are tree patterns involving /,// and []. First, g...
Junhu Wang, Jeffrey Xu Yu, Chengfei Liu
MFCS
2007
Springer
13 years 11 months ago
Transition Graphs of Rewriting Systems over Unranked Trees
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
Christof Löding, Alex Spelten
BDA
2001
13 years 6 months ago
Rewriting and Evaluating Tree Queries with XPath
A Community Web portal is a set of tools for a community of people who want to share information on a certain domain via the Web. The backbone of this system is an ontology which ...
Bernd Amann, Catriel Beeri, Irini Fundulaki, Miche...
LATA
2009
Springer
13 years 11 months ago
Rigid Tree Automata
We introduce the class of Rigid Tree Automata (RTA), an extension of standard bottom-up automata on ranked trees with distinguished states called rigid. Rigid states define a rest...
Florent Jacquemard, Francis Klay, Camille Vacher