On Tue, 19 May 2015, Jacob Sparre Andersen wrote:

> Stefan.Lucks@uni-weimar.de writes:
>>
>> 	(for all I in 2 .. N-1 => (N mod I) /= 0)
>>
> I don't need a profiler to estimate that it takes long time to execute,
> but I need a profiler to see where the compiler can't eliminate it from
> a critical path through static analysis.

Sorry, i forgot about this thread ... so my response is somewhat late.

If N is large enough, the compiler would have to eliminate that expression 
from all paths, not just from its critical path. (Think of N \approx 
2**60. Which comes first: your program passing or failing all test cases, 
or your retirement?)

> Good.  I noticed an interesting proposal for an extension to the
> assertion policy control in one of the posts in this thread.  I suppose
> we should push to have the ARG accept this (or something similar).

Agreed!

------  I  love  the  taste  of  Cryptanalysis  in  the morning!  ------
uni-weimar.de/de/medien/professuren/mediensicherheit/people/stefan-lucks
--Stefan.Lucks (at) uni-weimar.de, Bauhaus-Universität Weimar, Germany--