15-410 SPIN resources

Resources you may find useful

Here are some resources that you may find useful to accompany my SPIN/PROMELA lecture.

saddest.promela: The saddest mutexes -- no locking, no unlocking, just a straight through run. Watch it explode in a ball of fire!
happier.promela: Happier mutexes -- simple spinlocks. These successfully show mutual exclusion.
happier-progress.promela: Happier mutexes, with progress cycles to disprove bounded waiting. Compile the verifier with -DNP and run it with -l to see the breakage.
dekker.promela: Dekker's algorithm, with no checks for bounded waiting.
dekker-waiting.promela: Dekker's algorithm, with a check for a weakened form of bounded waiting.

LWN article on using SPIN to verify Linux RCUs (and the disaster that ensued after even a modest number of contending waiters)
SPIN home page
Contact information for me (feedback?)

[Last modified Monday November 17, 2008]