From: Jeffrey Carter <spam@spam.com>
Subject: Re: loop variant in SPARK ADA
Date: Wed, 21 Sep 2005 10:31:58 -0700
Date: 2005-09-21T10:31:58-07:00 [thread overview]
Message-ID: <iOgYe.6$k65.2@dfw-service2.ext.ray.com> (raw)
In-Reply-To: <1127270950.314911.66510@f14g2000cwb.googlegroups.com>
Constantin Porphyrogenete wrote:
>
> "Nevertheless, it is all too easy to
> forget to think about the problem of termination and
> to conclude that a subprogram is correct just because
> all the verification conditions are true."
I suspect this refers to the general concept of correctness proofs. The
correctness proofs in SPARK are technically incomplete proofs because
they don't prove termination in general; in other words, they haven't
solved the halting problem.
--
Jeffrey Carter
"Now go away or I shall taunt you a second time."
Monty Python and the Holy Grail
E-mail: jeffrey_r_carter-nr [commercial-at]
raytheon [period | full stop] com
prev parent reply other threads:[~2005-09-21 17:31 UTC|newest]
Thread overview: 9+ messages / expand[flat|nested] mbox.gz Atom feed top
2005-09-19 9:25 loop variant in SPARK ADA Constantin Porphyrogenete
2005-09-19 13:23 ` Jacob Sparre Andersen
2005-09-19 15:40 ` Jeffrey Carter
2005-09-19 16:03 ` Georg Bauhaus
2005-09-19 22:22 ` Jeffrey Carter
2005-09-20 8:17 ` Georg Bauhaus
2005-09-20 17:15 ` Rod Chapman
2005-09-21 2:49 ` Constantin Porphyrogenete
2005-09-21 17:31 ` Jeffrey Carter [this message]
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox