From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on ip-172-31-74-118.ec2.internal X-Spam-Level: X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!feeder.eternal-september.org!aioe.org!.POSTED.IIfIc3CB/+nKo+wKq8+a0g.user.gioia.aioe.org!not-for-mail From: Simon Wright Newsgroups: comp.lang.ada Subject: Re: My new post on dev.to about SPARK Date: Thu, 09 Jul 2020 21:00:18 +0100 Organization: Aioe.org NNTP Server Message-ID: References: <8e5d14a5-0311-4005-9655-951e8a274929o@googlegroups.com> NNTP-Posting-Host: IIfIc3CB/+nKo+wKq8+a0g.user.gioia.aioe.org Mime-Version: 1.0 Content-Type: text/plain X-Complaints-To: abuse@aioe.org User-Agent: Gnus/5.13 (Gnus v5.13) Emacs/26.3 (darwin) X-Notice: Filtered by postfilter v. 0.9.2 Cancel-Lock: sha1:u7FdKXKbYCQeTIwj02Q41KpAmLQ= Xref: reader01.eternal-september.org comp.lang.ada:59418 List-Id: mockturtle writes: > Recently I wrote a small binary search procedure for a software of > mine. Since I always wanted to start using SPARK, I thought that this > could be a nice small problem to start playing around with SPARK. The > post on dev.to is about my experience. > > If you are curious > > https://dev.to/pinotattari/proving-the-correctness-of-a-binary-search-procedure-with-spark-ada-34id Interesting! I thought to have a bit of a play with it, and I found that neither CE 2019 nor CE 2020 will prove as is, including "assertion might fail, cannot prove Bottom < Top"; but it proves just fine with type Element_Type is new Integer; or subtype Element_Type is Integer;