Test input generation for red-black trees using abstraction

  • Authors:
  • Willem Visser;Corina S. Păsăreanu;Radek Pelánek

  • Affiliations:
  • RIACS/NASA ARC, Moffett Field, CA;QSS/NASA ARC, Moffett Field, CA;Masaryk University, Brno, Czech Republic

  • Venue:
  • Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of test input generation for code that manipulates complex data structures. Test inputs are sequences of method calls from the data structure interface. We describe test input generation techniques that rely on state matching to avoid generation of redundant tests. Exhaustive techniques use explicit state model checking to explore all the possible test sequences up to predefined input sizes. Lossy techniques rely on abstraction mappings to compute and store abstract versions of the concrete states; they explore under-approximations of all the possible test sequences. We have implemented the techniques on top of the Java PathFinder model checker and we evaluate them using a Java implementation of red-black trees.