News for hackers. Stuff that matters.

helmut_brandl

Re:Verified Software with Albatross on Tuesday May 30, 2017 @03:38PM (#14447901)
The language is currently being developed. It is fully supported.
For non-terminating programs I use processes as described by Tony Hoare in "Communicating Sequential Processes". Procedures must always terminate in Albatross.

If I have more documentation on aliasing, I can give you hint. Could you provide me some email address?

Predicate logic is the base. Hoare logic rests on top of it to reason about the effect of commands in imperative code.

Total correctness is used for Hoare logic. I.e. {Q} S {R} means that the program fragment S started in a state that satisfies Q will end up in finite steps in a state satisfying R.

For aliases I use something similar to separation logic. But I claim that it is much easier to use because it doesn't require to reason about the state of the heap. Some basic ideas can be found at https://softwareverificaton.wordpress.com/2012/06/03/abstrac.... My current concept is much more refined and not yet published.

The used logic: Classical predicate logic + Hoare Logic.

Aliasing is an issue in verifying any programming language with imperative elements and mutable data types. However this issue is addressed properly in Albatross.