500 search results - page 26 / 100 » Streaming tree automata |
RTA
2010
Springer
13 years 11 months ago
2010
Springer
Data words and data trees appear in verification and XML processing. The term “data” means that positions of the word, or tree, are decorated with elements of an infinite set...
CADE
2008
Springer
14 years 8 months ago
2008
Springer
We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are int...
DASFAA
2009
IEEE
14 years 2 months ago
2009
IEEE
Current streaming applications have stringent requirements on query response time and memory consumption because of the large (possibly unbounded) size of data they handle. Further...
RTA
2005
Springer
14 years 1 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
PODS
2004
ACM
14 years 7 months ago
2004
ACM
