From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=unavailable autolearn_force=no version=3.4.4 Path: buffer1.nntp.dca1.giganews.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!goblin3!goblin.stu.neva.ru!news-2.dfn.de!news.dfn.de!news.uni-weimar.de!medsec1.medien.uni-weimar.de!lucks From: Stefan.Lucks@uni-weimar.de Newsgroups: comp.lang.ada Subject: Re: {Pre,Post}conditions and side effects Date: Tue, 9 Jun 2015 09:55:09 +0200 Organization: Bauhaus-Universitaet Weimar Message-ID: References: <2430252d-52a1-4609-acef-684864e6ca0c@googlegroups.com> <0a718b39-ebd3-4ab5-912e-f1229679dacc@googlegroups.com> <9ee5e186-5aaa-4d07-9490-0f9fdbb5ca18@googlegroups.com> <87tww5296f.fsf@adaheads.sparre-andersen.dk> <871tj9dp5b.fsf@theworld.com> <87oali5i6n.fsf@adaheads.sparre-andersen.dk> <87617povr4.fsf@adaheads.sparre-andersen.dk> NNTP-Posting-Host: medsec1.medien.uni-weimar.de Mime-Version: 1.0 Content-Type: multipart/mixed; BOUNDARY="8323329-963017828-1433836510=:20878" X-Trace: pinkpiglet.scc.uni-weimar.de 1433836960 1848 141.54.178.228 (9 Jun 2015 08:02:40 GMT) X-Complaints-To: news@pinkpiglet.scc.uni-weimar.de NNTP-Posting-Date: Tue, 9 Jun 2015 08:02:40 +0000 (UTC) X-X-Sender: lucks@debian In-Reply-To: <87617povr4.fsf@adaheads.sparre-andersen.dk> User-Agent: Alpine 2.20 (DEB 67 2015-01-07) Xref: number.nntp.giganews.com comp.lang.ada:193538 Date: 2015-06-09T09:55:09+02:00 List-Id: --8323329-963017828-1433836510=:20878 Content-Type: text/plain; charset=ISO-8859-15; format=flowed Content-Transfer-Encoding: QUOTED-PRINTABLE On Tue, 19 May 2015, Jacob Sparre Andersen wrote: > Stefan.Lucks@uni-weimar.de writes: >> >> =09(for all I in 2 .. N-1 =3D> (N mod I) /=3D 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= =20 from all paths, not just from its critical path. (Think of N \approx=20 2**60. Which comes first: your program passing or failing all test cases,= =20 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=E4t Weimar, Germany-- --8323329-963017828-1433836510=:20878--