proving programs correct

Thread View: comp.sys.transputer

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by CAMPBELL Mon, 20 May 1991 18:17

#1679

Author: CAMPBELL
Date: Mon, 20 May 1991 18:17

19 lines
1024 bytes

I sent this out a little while ago, but I didn't get any response.
I may have posted it wrong, so I am doing it differently this time.

What does it mean when it is claimed that Occam programs can be proven
to be correct? Does it only mean that they match the syntax of the
language?

I assume that it does *not* mean that the program will work for my
application.
I assume that it does *not* mean that the program is free of bugs.

Am I correct? If so what does it actually accomplish?

Also has anyone actually used this advantage of Occam?

Thanks

Russell Anderson
email: campbell@cc.usu.edu

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads