16616 search results - page 299 / 3324 » Extending Extended Vacuity |
169
click to vote
ATVA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
159
click to vote
FSTTCS
2008
Springer
15 years 7 months ago
2008
Springer
We consider the construction of finite automata from their corresponding regular expressions by a series of digraph-transformations along the expression’s structure. Each interm...
136
click to vote
AML
2010
15 years 6 months ago
2010
Let M be a premouse with a top extender, F. Suppose that (a) M is linearly coarsely iterable via hitting F and its images, and (b) if M is a linear iterate of M as in (a), then M ...
184
click to vote
EJC
2006
15 years 6 months ago
2006
Abstract. We show that the tree-width of a graph can be defined without reference to graph vertices, and hence the notion of tree-width can be naturally extended to matroids. (This...
173
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Automated theorem provers are used in extended static checking, where they are the performance bottleneck. Extended static checkers are run typically after incremental ch...