Opportunity: Software Execution Time Determinism

[Walter Bright via Digitalmars-d]

The compiler could be fairly easily compute cyclomatic complexity, but how that 
would be used to determine max time escapes me.

For example, how many times would a particular loop be executed? Isn't this the 
halting problem, i.e. not computable?

Andrei has done some great work on determining big O complexity, but that's only 
a small part of this problem.

I don't know about any work in this area, but I can see it would be valuable.