Displaying test cases 18351 - 18375 of 45437 in total
-
The test case shows how it is easy to get a buffer overflow if a string function is misused when argv contains tainted data.
-
The test case avoids a buffer overflow by using an appropriate function with scope complexity.
-
The test case shows how it is easy to get a buffer overflow if a string function is misused with scope complexity.
-
The test case avoids a buffer overflow by using an appropriate function with a string which is in a structure.
-
The test case shows how it is easy to get a buffer overflow if a string function is misused with a string which is in a structure.
-
The test case avoids a buffer overflow by using an appropriate function with an address alias level code complexity.
-
The test case shows how it is easy to get a buffer overflow if a string function is misused with an address alias level code complexity.
-
The test case avoids a buffer overflow by using an appropriate function.
-
The test case shows how it is easy to get a buffer overflow if a string function is misused.
-
The test case avoids a leftover debug weakness.
-
The test case exposes a leftover debug weakness. Basically developer can debug his code and get the root promotion for debugging.
-
This test case avoids an improper null termination which occurs when argv contains tainted data.
-
This test case exposes an improper null termination which occurs when argv contains tainted data.
-
The test case avoids an improper null termination in a string which is in a structure.
-
The test case exposes an improper null termination in a string which is in a structure.
-
The test case avoids an improper null termination with an address alias level as code complexity.
-
The test case shows an improper null termination with an address alias level as code complexity.
-
The test cases avoids an improper null termination.
-
This test case shows an improper null termination; fread does not add the null character at the end of the string.
-
This test case avoids Heap Overflow with an array index complexity.
-
This test case exposes Heap Overflow with an array index complexity.
-
The test case avoids Heap Overflow with an array complexity.
-
The test case shows Heap Overflow with an array complexity.
-
This test case uses PAM to avoid hard coded password in a for loop structure.
-
This test case shows a hard coded password in a for loop structure.