662 search results - page 103 / 133 » Trees, Automata and XML |
132
click to vote
LICS
2009
IEEE
16 years 18 days 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...
160
click to vote
BIRTHDAY
2003
Springer
15 years 11 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...
214
click to vote
JFPLC
2004
15 years 7 months ago
2004
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
210
click to vote
CPM
2004
Springer
15 years 11 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
163
click to vote
CONCUR
2004
Springer
15 years 11 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...