National Institute of Standards and Technology
Package illustrating a test case

Test case 155522

Description

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: Elastic Search
- Source Taint: SOCKET
- Data Type: VOID_POINTER
- Data Flow: JAVA_GENERICS
- Control Flow: INDIRECTLY_RECURSIVE

Flaws

Test Suites

Documentation

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