SPIN
2007
Springer
13 years 11 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...