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=ham
	autolearn_force=no version=3.4.4
X-Google-Thread: 103376,9b7d3a51d0d8b6ee
X-Google-Attributes: gid103376,domainid0,public,usenet
X-Google-Language: ENGLISH,ASCII-7-bit
Path: 
 g2news1.google.com!news4.google.com!feeder.news-service.com!newsfeed.freenet.de!news.teledata-fn.de!newsfeed.arcor.de!newsspool2.arcor-online.net!news.arcor.de.POSTED!not-for-mail
Date: Thu, 27 Nov 2008 11:24:20 +0100
From: Georg Bauhaus <rm.dash-bauhaus@futureapps.de>
User-Agent: Thunderbird 2.0.0.18 (Macintosh/20081105)
MIME-Version: 1.0
Newsgroups: comp.lang.ada
Subject: Re: Compiler quality
References: <20081115101632.5f98c596@cube.tz.axivion.com>
 <20081122011825.5354d1c1@cube.tz.axivion.com>
  <9cb27caa-8e9f-4123-ad36-4980c3032722@20g2000yqt.googlegroups.com>
 <Y1lXk.44171$_Y1.18421@bgtnsc05-news.ops.worldnet.att.net>
In-Reply-To: <Y1lXk.44171$_Y1.18421@bgtnsc05-news.ops.worldnet.att.net>
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 7bit
Message-ID: <492e7554$0$30237$9b4e6d93@newsspool1.arcor-online.net>
Organization: Arcor
NNTP-Posting-Date: 27 Nov 2008 11:24:21 CET
NNTP-Posting-Host: 270c40d6.newsspool1.arcor-online.net
X-Trace: 
 DXC=j2WMG1H?>\M74okIm;?DS@ic==]BZ:afN4Fo<]lROoRA^YC2XCjHcbIF]T2oY6WY[B;9OJDO8_SKFNSZ1n^B98iJ@U9aQ3lgP_C
X-Complaints-To: usenet-abuse@arcor.de
Xref: g2news1.google.com comp.lang.ada:2821
Date: 2008-11-27T11:24:21+01:00
List-Id: <comp.lang.ada>

anon schrieb:
> Your not understanding the concept finite for programs. And this explanation 
> does not the finite concept of hardware.

(Just for clarity, a program text is finite by definition.)

Please, could you give the cardinality of the set of 4kB-Ada programs
that a given compiler, such as GNAT 3.15p, can process, and decide,
on a PC of 1GB RAM, 200GB file space, within 1h?  I'd like to be
realistic, so I'll be glad to learn the factor F and an exponent
N in F*10**N.

How does this number compare to the cardinality of the set of Ada
programs of 6_000 .. 10_000 SLOC?  (That's roughly the size
of a book.)

How long does it take to demonstrate that a single Ada program
should map to one sequence of CPU instructions? (Else we have
not a single, complete, test case, because a compiled program may
just happen to produce expected results in some cases.)



> An example is like using the following statement
> 
>                    X := Sin ( A ) + Cos ( W ) ;
> 
> do use need to also create the statement
> 
>                    X := Cos ( W ) + Sin ( A ) ;
> 
> to prove that a simple mathematical statement is BUG free.  The answer is no! 
> So a vendor may use one not both to perform the test, to say the statement 
> checking is BUG free.  

Good example, because the order of FPT operations may affect
the result of the statements. So the answer is yes, you may
have to test both statements, with all kinds of inputs for W and A...
(Note that I'm not saying you need all *possible* inputs, just
those that one needs within the given FPT framework. They have been
named in extensive literature.)


> And using every statement that can be created is just overkill, but it can be 
> done. There are places in a compiler that are tested to the point of being 
> BUG free and that number of testing is finite. 

By your previous argument about bug free compilers,
a compiler is therefore the same as a place in a compiler,
as far as testing goes...