11017 search results - page 34 / 2204 » Closure Systems and their Structure |
CAV
2012
Springer
11 years 10 months ago
2012
Springer
Nested-word automata (NWAs) are a language formalism that helps bridge the gap between finite-state automata and pushdown automata. NWAs can express some context-free properties, ...
CAV
2004
Springer
14 years 1 months ago
2004
Springer
The logic of equality with uninterpreted functions (EUF) and its extensions have been widely applied to processor verification, by means of a large variety of progressively more s...
FOSSACS
2009
Springer
13 years 11 months ago
2009
Springer
In quantitative verification, system states/transitions have associated costs, and these are used to associate mean-payoff costs with infinite behaviors. In this paper, we propose ...
DEXAW
2002
IEEE
14 years 24 days ago
2002
IEEE
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
The cost of reachability query computation using traditional algorithms such as depth first search or transitive closure has been found to be prohibitive and unacceptable in mass...