254 search results - page 40 / 51 » Restarting Tree Automata |
BIRTHDAY
2003
Springer
14 years 2 months ago
2003
Springer
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
In this paper, we focus on XML data integration by studying rewritings of XML target schemas in terms of source schemas. Rewriting is very important in data integration systems wh...
CADE
2009
Springer
14 years 9 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
POPL
2002
ACM
14 years 9 months ago
2002
ACM
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
LICS
2005
IEEE
14 years 2 months ago
2005
IEEE
The universal Horn theory of relational Kleene algebra with tests (RKAT) is of practical interest, particularly for program semantics. We develop an (infinitary) proof system, ba...