This test takes a string, gets the first character, and uses a recursive method to look for the index of the second occurrence of that character. If the character does not appear a second time, it will recurse indefinitely. Metadata - Base program: JTree - Source Taint: SOCKET - Data Type: SIM...

This test takes a number from the user, and attempts to allocate, initialize, and print out an array of that size. If the number is too large, memory allocation will fail and the program will subsequently crash. Metadata - Base program: Coffee MUD - Source Taint: ENVIRONMENT_VARIABLE - Data Ty...

This test takes in integer n. The program attempts to open n files. If n is large enough the number of file handles will be exhausted, these files handlers are never closed, and stored in a global arraylist, causing the entire program to fail to open any files from that point on. Metadata - Base...

This test takes in integer n. The program attempts to open n files. If n is large enough the number of file handles will be exhausted. Metadata - Base program: Elastic Search - Source Taint: ENVIRONMENT_VARIABLE - Data Type: SIMPLE - Data Flow: ADDRESS_AS_FUNCTION_RETURN_VALUE - Control Flow...

This test takes in an integer n. It creates n temporary files, and fills them with data. It then attempts to clean up, deleting the last 50 of the temporary files, leaving any files created before those in the temp directory. Metadata - Base program: Apache JMeter - Source Taint: SOCKET - Data...

This test takes in an integer n. It creates n temporary files, and fills them with data. It then attempts to clean up, deleting the last 50 of the temporary files, leaving any files created before those in the temp directory. Metadata - Base program: Elastic Search - Source Taint: FILE_CONTENTS...

This test takes a number from the user, and attempts to allocate, initialize, and print out an array of that size. If the number is too large, memory allocation will fail and the program will subsequently crash. Metadata - Base program: Apache Lenya - Source Taint: SOCKET - Data Type: SIMPLE ...

This test takes a string, and reads through the string, printing out each character with ASCII value greater than 48. If it encounters a character with ASCII value less than 48, it will fail to increment the loop counter, and loop forever. Metadata - Base program: Coffee MUD - Source Taint: FIL...

This test takes in integer n. The program attempts to open n files. If n is large enough the number of file handles will be exhausted, these files handlers are never closed, and stored in a global arraylist, causing the entire program to fail to open any files from that point on. Metadata - Base...

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: Apache Lucene -...

This test takes a number and attempts to determine whether it is prime by dividing it by each number less than it. For large enough prime integers, this calculation takes an excessive amount of time. Metadata - Base program: Apache JMeter - Source Taint: FILE_CONTENTS - Data Type: SIMPLE - Da...

This test takes a string, and reads through the string, printing out each character with ASCII value greater than 48. If it encounters a character with ASCII value less than 48, it will fail to increment the loop counter, and loop forever. Metadata - Base program: Apache Jena - Source Taint: EN...

This test takes a string, gets the first character, and uses a recursive method to look for the index of the second occurrence of that character. If the character does not appear a second time, it will recurse indefinitely. Metadata - Base program: Apache Lenya - Source Taint: ENVIRONMENT_VARIA...

This test takes in integer n. The program attempts to open n files. If n is large enough the number of file handles will be exhausted, these files handlers are never closed, and stored in a global arraylist, causing the entire program to fail to open any files from that point on. Metadata - Base...

This test takes in an integer n. The integer represents the number of buffers to allocate. For a large n an OutOfMemoryError will be generated. This error is caught and the program will continually try to request memory Metadata - Base program: Apache Lenya - Source Taint: ENVIRONMENT_VARIABLE ...

This test takes a string, gets the first character, and uses a recursive method to look for the index of the second occurrence of that character. If the character does not appear a second time, it will recurse indefinitely. Metadata - Base program: Apache Lucene - Source Taint: SOCKET - Data T...

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: Apache Lenya - ...

This test takes in integer n. The program attempts to open n files. If n is large enough the number of file handles will be exhausted. Metadata - Base program: Apache Lucene - Source Taint: SOCKET - Data Type: ARRAY - Data Flow: JAVA_GENERICS - Control Flow: INTERCLASS_1

This test takes in integer n. The program attempts to open n files. If n is large enough the number of file handles will be exhausted. Metadata - Base program: Coffee MUD - Source Taint: ENVIRONMENT_VARIABLE - Data Type: ARRAY - Data Flow: ADDRESS_AS_CONSTANT - Control Flow: INTERCLASS_1

This test takes a string, gets the first character, and uses a recursive method to look for the index of the second occurrence of that character. If the character does not appear a second time, it will recurse indefinitely. Metadata - Base program: Apache Lenya - Source Taint: ENVIRONMENT_VARIA...

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: Apache POI - So...

This test takes a number and attempts to determine whether it is prime by dividing it by each number less than it. For large enough prime integers, this calculation takes an excessive amount of time. Metadata - Base program: Coffee MUD - Source Taint: FILE_CONTENTS - Data Type: SIMPLE - Data ...

This test takes a number and attempts to determine whether it is prime by dividing it by each number less than it. For large enough prime integers, this calculation takes an excessive amount of time. Metadata - Base program: Apache Jena - Source Taint: SOCKET - Data Type: ARRAY - Data Flow: B...

This test takes in integer n. The program attempts to open n files. If n is large enough the number of file handles will be exhausted, these files handlers are never closed, and stored in a global arraylist, causing the entire program to fail to open any files from that point on. Metadata - Base...

This test takes in integer n. The program attempts to open n files. If n is large enough the number of file handles will be exhausted, these files handlers are never closed, and stored in a global arraylist, causing the entire program to fail to open any files from that point on. Metadata - Base...