Spin: Reducing State Space

Thu, 18 Jan 2024 00:00:00 +0000

Verification is a paramount and formidable challenge in software engineering. Moreover, it serves as a pivotal process that distinguishes software engineering from mere software development. Spin is a popular open-source software verification tool that has seen continuous research and development since its inception at Bell Labs in 1980.¹ Under the hood, Spin is an explicit-state model checker, meaning it exhaustively searches the entire state space of a model.

To check an algorithm or system using Spin, you must first re-code it in Promela, a C-like language used for defining a model for use with Spin. Once a model is implemented in Promela, Spin can be used to find counter-traces to correctness constraints, if any exist, and otherwise formally verify the model. Challenges arise when attempting to verify sufficiently complex systems or algorithms, particularly where the state space exceeds your system’s memory capacity or when the search will take eons to complete.

Verification on Luke Marzen

Spin: Reducing State Space