Verification games: making verification fun

  • Authors:

  • Werner Dietl;Stephanie Dietzel;Michael D. Ernst;Nathaniel Mote;Brian Walker;Seth Cooper;Timothy Pavlik;Zoran Popović

  • Affiliations:

  • University of Washington;University of Washington;University of Washington;University of Washington;University of Washington;University of Washington;University of Washington;University of Washington

  • Venue:
  • Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Program verification is the only way to be certain that a given piece of software is free of (certain types of) errors --- errors that could otherwise disrupt operations in the field. To date, formal verification has been done by specially-trained engineers. Labor costs have heretofore made formal verification too costly to apply beyond small, critical software components. Our goal is to make verification more cost-effective by reducing the skill set required for program verification and increasing the pool of people capable of performing program verification. Our approach is to transform the verification task (a program and a goal property) into a visual puzzle task --- a game --- that gets solved by people. The solution of the puzzle is then translated back into a proof of correctness. The puzzle is engaging and intuitive enough that ordinary people can through game-play become experts. This paper presents a status report on the Verification Games project and our Pipe Jam prototype game.