1 Assuming that the parameter is valid mutex data structure and reasonable
2 bounded, this harness proves the memory safety of QueueTakeMutexRecursive.
3 Task pool and concurrency functions are abstracted away and replaced with
4 required stubs to drive coverage.
6 This proof is a work-in-progress. Proof assumptions are described in
7 the harness. The proof also assumes the following functions are
8 memory safe and have no side effects relevant to the memory safety of
11 * pvTaskIncrementMutexHeldCount
14 * vPortGenerateSimulatedInterrupt
16 * vTaskPlaceOnEventList
17 * vTaskPriorityDisinheritAfterTimeout
19 * xTaskGetCurrentTaskHandle
20 * xTaskPriorityDisinherit
21 * xTaskPriorityInherit
22 * xTaskRemoveFromEventList