Incremental Benchmarks for Software Verification Tools and Techniques

  • Authors:

  • Bruce W. Weide;Murali Sitaraman;Heather K. Harton;Bruce Adcock;Paolo Bucci;Derek Bronish;Wayne D. Heym;Jason Kirschenbaum;David Frazier

  • Affiliations:

  • The Ohio State University, Columbus, USA OH 43210;Clemson University, Clemson, USA SC 29634;Clemson University, Clemson, USA SC 29634;The Ohio State University, Columbus, USA OH 43210;The Ohio State University, Columbus, USA OH 43210;The Ohio State University, Columbus, USA OH 43210;The Ohio State University, Columbus, USA OH 43210;The Ohio State University, Columbus, USA OH 43210;Clemson University, Clemson, USA SC 29634

  • Venue:
  • VSTTE '08 Proceedings of the 2nd international conference on Verified Software: Theories, Tools, Experiments
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes an initial catalog of easy-to-state, relatively simple, and incrementally more and more challenging benchmark problems for the Verified Software Initiative. These benchmarks support assessment of verification tools and techniques to prove total correctness of functionality of sequential object-based and object-oriented software. The problems are designed to help evaluate the state-of-the-art and the pace of progress toward verified software in the near term, and in this sense, they are just the beginning. They will allow researchers to illustrate and explain how proposed tools and techniques deal with known pitfalls and well-understood issues, as well as how they can be used to discover and attack new ones. Unlike currently available benchmarks based on "real-world" software systems, the proposed challenge problems are expected to be amenable to "push-button" verification that leverages current technology.