234 search results - page 34 / 47 » On Quasi-Products of Tree Automata |
LICS
2009
IEEE
15 years 8 months ago
2009
IEEE
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
BIRTHDAY
2003
Springer
15 years 6 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...
101
click to vote
CIKM
2008
Springer
15 years 3 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...
122
click to vote
CADE
2009
Springer
16 years 1 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...
194
click to vote
POPL
2002
ACM
16 years 1 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...