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,20a383dc7abacbdf X-Google-NewGroupId: yes X-Google-Attributes: gida07f3367d7,domainid0,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Received: by 10.68.241.162 with SMTP id wj2mr1104706pbc.2.1340953080520; Thu, 28 Jun 2012 23:58:00 -0700 (PDT) Path: l9ni32382pbj.0!nntp.google.com!news2.google.com!news.glorb.com!feeder.erje.net!news2.arglkargh.de!nuzba.szn.dk!news.jacob-sparre.dk!munin.jacob-sparre.dk!pnx.dk!.POSTED!not-for-mail From: Jacob Sparre Andersen Newsgroups: comp.lang.ada Subject: Re: Ada evolving towards formal analysis? Date: Fri, 29 Jun 2012 08:57:56 +0200 Organization: Jacob Sparre Andersen Research & Innovation Message-ID: <87r4sy4nbf.fsf@adaheads.sparre-andersen.dk> References: <9fc18cdc-c3e4-4744-a193-a9c521948768@googlegroups.com> NNTP-Posting-Host: 109.59.217.103.mobile.3.dk Mime-Version: 1.0 X-Trace: munin.nbi.dk 1340953078 13142 109.59.217.103 (29 Jun 2012 06:57:58 GMT) X-Complaints-To: news@jacob-sparre.dk NNTP-Posting-Date: Fri, 29 Jun 2012 06:57:58 +0000 (UTC) User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/23.2 (gnu/linux) Cancel-Lock: sha1:jvgFiDcx/pN5l0q0Q/1+qqEHl80= Content-Type: text/plain; charset=us-ascii Date: 2012-06-29T08:57:56+02:00 List-Id: i3text@gmail.com writes: > Is Ada going to get a prover? I am pretty sure the intent of the ARG is that the compiler vendors can implement an automated prover for as many of the "dynamic" predicates as possible. Ada is a sufficiently permissible language that I expect that there always will be correct, but statically unprovable predicates in some real-world Ada programs. Greetings, Jacob -- "I have no prejudice except against Pakistanis, which is normal."