1714 search results - page 111 / 343 » Abstract Models of Memory Management |
154
click to vote
ENTCS
2006
15 years 3 months ago
2006
Bounded Model Checking (BMC) searches for counterexamples to a property with a bounded length k. If no such counterexample is found, k is increased. This process terminates when ...
108
click to vote
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper presents algorithms and data structures that exploit a compositional and hierarchical specification to enable more efficient symbolic modelchecking. We encod...
110
click to vote
UM
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This paper addresses the problem of capturing rich, longterm personal activity logs of users’ interactions with their workstations, for the purpose of deriving predicti...
113
click to vote
TACAS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B¨uchi automaton for the negation of the formula ...
147
click to vote
CADE
2012
Springer
13 years 5 months ago
2012
Springer
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...