National Institute of Standards and Technology
Package illustrating a test case

Test case 150408


This test case implements two threads that lock a counting semaphore multiple times, causing a deadlock if the lock is locked more times that it is unlocked. The test case takes a string as input and if the input string contains spaces spawns two threads, the first of which locks a semaphore twice which causes this thread, and more than likely the second thread to deadlock on their calls to lock the semaphore. If the input string does not contain spaces only the second thread is spawned and the test case completes without error.
- Base program: Subversion
- Source Taint: SOCKET
- Data Type: STRUCT
- Control Flow: INFINITE_LOOP


Test Suites


Have any comments on this test case? Please, send us an email.