1458 search results - page 35 / 292 » Monads for incremental computing |
113
click to vote
RTA
1998
Springer
15 years 6 months ago
1998
Springer
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...
136
Voted
LICS
2010
IEEE
15 years 29 days ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
130
Voted
FSTTCS
2005
Springer
15 years 8 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
116
click to vote
CONCUR
2004
Springer
15 years 8 months ago
2004
Springer
We propose a framework where behavioural properties of finite-state systems modelled as graph transformation systems can be expressed and verified. The technique is based on the ...
71
Voted
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
