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...
| 主要な著者: | , , |
|---|---|
| その他の著者: | |
| フォーマット: | Conference item |
| 出版事項: |
Springer
2015
|