| Virual Oral Presentation Slide by Slide |
IEEE/ICACT20210212 Slide.14
[Big Slide]
| Oral Presentation |
|
|
This figure is the static analysis result for binary search code implemented according to case 3. In the circle graph, a Proven 100% means that there is no weakness. Since the code implemented according to Case 3 protects the system from deliberate or accidental intrusion, the first and last variables can only have numbers from 1 to 100. Therefore, there is no weakness in terms of reliability and security. | |
| [Go to Next Slide] |