Abstract/Summary

We present a work-in-progress case study on using program verification tools, specifically model-checkers for C programs, to solve simple interactive fiction games from the early 1980s. Off-the-shelf model-checking tools are unable to handle the games in their original form. In order to work around this, we apply a series of program transformations that do not change the behaviour of the program. An interesting aspect of these games is that they use a simple, interpreted language to script in-game events. This turns out to be the most difficult part of the program for verification tools to handle. Our case study thus provides some insights that may be applicable more generally to verification and analysis of programs that interpret scripting languages.