10271 search results - page 645 / 2055 » Computer Science |
187
click to vote
SOFSEM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
191
click to vote
SPIN
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. We present Beem — BEnchmarks for Explicit Model checkers. This benchmark set includes more than 50 parametrized models (300 concrete instances) together with their corr...
191
click to vote
SPIN
2007
Springer
16 years 1 months ago
2007
Springer
This paper describes a set of verification components that open the way to perform on-the-fly software model checking with the Cadp toolbox, originally designed for verifying the...
212
Voted
STACS
2007
Springer
16 years 1 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
180
click to vote
STACS
2007
Springer
16 years 1 months ago
2007
Springer
We consider Sturmian trees as a natural generalization of Sturmian words. A Sturmian tree is a tree having n+1 distinct subtrees of height n for each n. As for the case of words, S...