Re: {Pre,Post}conditions and side effects

[Jacob Sparre Andersen <sparre@nbi.dk>]

Stefan.Lucks@uni-weimar.de writes:
> On Mon, 18 May 2015, Jacob Sparre Andersen wrote:

> Well, as a very simmple example, consider this:
>
> 	(for all I in 2 .. N-1 => (N mod I) /= 0)
>
> You don't need a profiler to figure out that this is prohibitively
> slow for largish N, do you?

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.

>> I am aware that we currently don't have as fine-grained control of
>> assertions as that would require to work well, but I assume that this
>> is something that can be discussed with the ARG and the compiler
>> vendors.
>
> This is precisely my point!

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).

Greetings,

Jacob
-- 
There really was only one way to make a person unlearn something ...