13 search results - page 3 / 3 » The Complexity of Model Checking (Collapsible) Higher-Order ... |
LICS
2009
IEEE
14 years 1 months ago
2009
IEEE
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
FOSSACS
2008
Springer
13 years 8 months ago
2008
Springer
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter au...
SIGMOD
1993
ACM
13 years 10 months ago
1993
ACM
The traditional focus of relational query optimization schemes has been on the choice of join methods and join orders. Restrictions have typically been handled in query optimizers ...