219 search results - page 6 / 44 » Dynamic partial-order reduction for model checking software |
147
Voted
KBSE
2000
IEEE
15 years 7 months ago
2000
IEEE
The majority of work carried out in the formal methods community throughout the last three decades has (for good reasons) been devoted to special languages designed to make it eas...
119
click to vote
SPIN
2009
Springer
15 years 9 months ago
2009
Springer
This paper introduces a new model checking algorithm that searches for non-progress cycles, used mainly to check for livelocks. The algorithm performs an incremental depth-first s...
116
click to vote
KBSE
2007
IEEE
15 years 9 months ago
2007
IEEE
Concurrent programs are difficult to debug and verify because of the nondeterministic nature of concurrent executions. A particular concurrency-related bug may only show up under ...
119
Voted
SEFM
2009
IEEE
15 years 9 months ago
2009
IEEE
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
120
Voted
SPIN
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Software model checking problems generally contain two different types of non-determinism: 1) non-deterministically chosen values; 2) the choice of interleaving among th...