Abstract
We describe an algorithm for efficient formal verification of changes in software built on top of a model-checking procedure that traverses the control flow graph explicitly while representing the data symbolically. The main idea of our algorithm is to guide the control flow graph exploration first to the paths that traverse through the changed nodes in the graph. We implemented this idea on top of the concolic model checker ExpliSAT and the experimental results on real programs show a significant improvement in performance compared to re-verification of the whole program, when the change involves a small fraction of paths on the control flow graph.
| Original language | English |
|---|---|
| Title of host publication | International Workshop on Hot Topics in Software Upgrades (HotSWUp) |
| Publisher | IEEE Computer Society |
| Pages | 31-35 |
| Number of pages | 5 |
| Publication status | Published - 3 Jun 2012 |