3 ms·
You must prove that this loop will terminate: All loops shall have a statically determinable upper-bound on the maximum number of loop iterations. It shall be p
by vbezhenar 8y ago
You must prove that this loop will terminate: All loops shall have a statically determinable upper-bound on the maximum number of loop iterations. It shall be possible for a static compliance checking tool to affirm the existence of the bound.
- TheCoelacanth 8y agoSince the loop condition is the constant `false`, it should be trivial to prove that the upper bound is one iteration.