Proving safety with trace automata and bounded model checking
Loop under-approximation enriches C programs with additional branches that represent the effect of a (limited) range of loop iterations. While this technique can speed up bug detection significantly, it introduces redundant execution traces which may complicate the verification of the program. This...
| Main Authors: | , , |
|---|---|
| 其他作者: | |
| 格式: | Conference item |
| 出版: |
Springer
2015
|