Back to the previous page
Test Case ID | ![]() |
Bad / Good / Mixed | Bad![]() |
Author | IARPA STONESOUP Test and Evaluation team |
Associations | Test suite: 102 Application: 16 |
Added by | Charles Oliveira |
Language | Java |
Type of test case | Source Code |
Input string | |
Expected Output | |
Instructions | See src/build.xml. |
Submission date | 2015-10-06 |
Description | This test takes a number as input and calculates it's factorial in 20 concurrent threads, without setting a limit on how large that number can be (as long as it's within Integer.MAX_VALUE). This can cause significant resource use when the input is large. Metadata - Base program: JTree - Source Taint: FILE_CONTENTS - Data Type: SIMPLE - Data Flow: BASIC - Control Flow: SEQUENCE |
File(s) |
|
Flaw |
There are no comments
Have any comments on this test case? Please,
.
- JTreeOptions.java
- service_mon.sh
- J-C400B-JTRE-01-ST02-DT02-DF11-CF20-01.yaml
- runFifos.py
- J-C400B-JTRE-01-ST02-DT02-DF11-CF20-01.xml
File Contains:
CWE-400: Uncontrolled Resource Consumption ('Resource Exhaustion') on line(s): 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146
CWE-400: Uncontrolled Resource Consumption ('Resource Exhaustion') on line(s): 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146