7 search results - page 2 / 2 » Alternation in Equational Tree Automata Modulo XOR |
JSC
2010
14 years 10 months ago
2010
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
105
click to vote
LICS
2010
IEEE
14 years 9 months ago
2010
IEEE
We develop the theory of regular cost functions over finite trees: a quantitative extension to the notion of regular languages of trees: Cost functions map each input (tree) to a v...