1523 search results - page 29 / 305 » Partially ordered secretaries |
78
Voted
SPIN
2007
Springer
15 years 4 months ago
2007
Springer
Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semant...
WIA
2007
Springer
15 years 4 months ago
2007
Springer
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
SPIN
2005
Springer
15 years 3 months ago
2005
Springer
We describe an improvement of the partial-order reduction algorithm for breadth-first search which was introduced in Spin version 4.0. Our improvement is based on the algorithm by...
CAV
2004
Springer
15 years 3 months ago
2004
Springer
