13306 search results - page 404 / 2662 » Theoretical Computer Science |
162
click to vote
RTA
2007
Springer
16 years 29 days ago
2007
Springer
The use of automata techniques to prove the termination of string rewrite systems and left-linear term rewrite systems is advocated by Geser et al. in a recent sequence of papers. ...
149
click to vote
SOFSEM
2007
Springer
16 years 29 days ago
2007
Springer
Indexing of factors is a widely used and useful technique in stringology and can be seen as a tool in solving diverse text algorithmic problems. A gapped-factor is a concatenation ...
178
click to vote
SOFSEM
2007
Springer
16 years 29 days 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...
180
click to vote
SPIN
2007
Springer
16 years 29 days 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...
182
click to vote
SPIN
2007
Springer
16 years 29 days 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...