332 search results - page 13 / 67 » A Direct Algorithm for Multi-valued Bounded Model Checking |
146
click to vote
IFIP
2010
Springer
14 years 6 months ago
2010
Springer
Concurrent software is difficult to verify. Because the thread schedule is not controlled by the application, testing may miss defects that occur under specific thread schedules. T...
LOGCOM
2002
14 years 11 months ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
132
click to vote
NFM
2011
14 years 6 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...
105
click to vote
ATAL
2010
Springer
15 years 24 days ago
2010
Springer
We present a method of distributed model checking of multiagent systems specified by a branching-time temporal-epistemic logic. We introduce a serial algorithm, central to the dis...
101
click to vote
FORTE
2010
15 years 1 months ago
2010
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...