helmut_brandl
Limits of Computability in Lambda Calculus
Calculus of Constructions
Limits of Computability
Red Black Trees
Programming in Lambda Calculus
Programming in Lambda Calculus
Lambda Calculus – Step by Step
Verified Software with Albatross
Inductively defined sets and relations
A Quick Tour Through the Albatross Programming Language
Description of the Albatross Programming Language
If I have more documentation on aliasing, I can give you hint. Could you provide me some email address?
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.
Aliasing is an issue in verifying any programming language with imperative elements and mutable data types. However this issue is addressed properly in Albatross.