291 search results - page 26 / 59 » Implementation with a bounded action space |
ADAEUROPE
2005
Springer
14 years 1 months ago
2005
Springer
Transparent system support for software fault tolerance reduces performance in general and precludes application-specific optimizations in particular. In contrast, explicit support...
SPIRE
2010
Springer
13 years 6 months ago
2010
Springer
We consider string matching with variable length gaps. Given a string T and a pattern P consisting of strings separated by variable length gaps (arbitrary strings of length in a sp...
NFM
2011
13 years 2 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
TIT
2002
13 years 7 months ago
2002
The problem of optimal sequential decision for individual sequences, relative to a class of competing o -line reference strategies, is studied for general loss functions with memo...
ICFEM
2009
Springer
14 years 2 months ago
2009
Springer
Formal specification languages are traditionally supported by theorem provers, but recently model checkers have proven to be useful tools. In this paper we present Eboc, an explic...