2756 search results - page 166 / 552 » Computation-Centric Memory Models |
160
click to vote
CADE
2012
Springer
13 years 7 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...
115
click to vote
IPL
2008
15 years 4 months ago
2008
It is a truism that for a machine to have a useful access to memory or workspace, it must "know" where its input ends and its working memory begins. Most machine models ...
138
click to vote
QEST
2009
IEEE
15 years 11 months ago
2009
IEEE
This paper provides an experimental study of the efficiency of simulation-based model-checking algorithms for continuous-time Markov chains by comparing: MRMC – the only tool t...
121
click to vote
KBSE
2007
IEEE
15 years 11 months ago
2007
IEEE
toolkit demonstrates that predicate abstraction enables automated verification of real world Windows device Our predicate abstraction-based tool DDVerify enables the automated ve...
126
click to vote
FORMATS
2007
Springer
15 years 10 months ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...