3 ms·
You can certainly approach it. The problem is, you can't tell for sure when you're there, unless a program has so few execution paths that you can check them b
by pg 18y ago
You can certainly approach it. The problem is, you can't tell for sure when you're there, unless a program has so few execution paths that you can check them by enumeration the way you'd check a proof.
- ivankirigin 18y agoAre you familiar with techniques used in avionics software? The methods just ooze with pain for the developer. Examples include no dynamic memory allocation and always running network operations at full tilt so there is no notion of average & peak network usage. For the latter, let's say you want to make a messaging system where module 1 periodically sends a message to module 2. Rather than just sending a message when it is needed, you determine the maximum frequency you want to send a message, and send the latest message again and again. More deterministic, more verifiable correct, but 100% pain.