Testing
Library Components: Red-Black Trees
presented by
Lee White
| |
Testing
Library Components: Red-Black Trees
presented by
Lee White
|
| formalWARE
project
formalWARE
formalWARE
|
Presented by Lee White at
formalWARE's Open House
on October 8, 1997 at Cecil
Green House, UBC
. We are presently applying component testing techniques to library components; this could be applied to the Ada Library, but we have focussed on STL for C++. The objective of this testing is to be as thorough as possible in detecting defects in the library components, but very efficient in terms of the tester's time; use automated testing to the greatest extent possible. We use both specification-based and implementation-based testing. In addressing the latter for STL containers, red-black trees were selected as the most complex container in STL. The research results described a systematic method for generating red-black trees to test where only inputs of key insert, delete and find could be used, producing problems of observability and controllability. The results showed how we dealt with these constraints and yet could generate the desired red-black trees to test with additional insertions and deletions. Presentation
Slides (HTML)
. |
