Issue No. 05 - May (1997 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.588523
<p><b>Abstract</b>—Dynamic verification is a new approach to formal verification, applicable to generic algorithms such as those found in the Standard Template Library (STL, part of the Draft ANSI/ISO C++ Standard Library). Using behavioral abstraction and symbolic execution techniques, verifications are carried out at an abstract level such that the results can be used in a variety of instances of the generic algorithms without repeating the proofs. This is achieved by substituting for type parameters of generic algorithms special data types that model generic concepts by accepting symbolic inputs and deducing outputs using inference methods. By itself, this symbolic execution technique supports testing of programs with symbolic values at an abstract level. For formal verification we also need to generate multiple program execution paths and use assertions (to handle while loops, for example), but we show how this can be achieved via directives to a conventional debugger program and an analysis database. The assertions must still be supplied, but they can be packaged separately and evaluated as needed by appropriate transfers of control orchestrated via the debugger. Unlike all previous verification methods, the dynamic verification method thus works without having to transform source code or process it with special interpreters. We include an example of the formal verification of an STL generic algorithm.</p>
Specification, verification, generic algorithms, software libraries, C++, templates, Standard Template Library.
Changqing Wang, David R. Musser, "Dynamic Verification of C++ Generic Algorithms", IEEE Transactions on Software Engineering, vol. 23, no. , pp. 314-323, May 1997, doi:10.1109/32.588523