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
|