We use ownership types to facilitate program verification. Namely, an assertion that has been established for a part of the heap which is unaffected by some execution will still hold after this execution. We use ownership and effects, and extend them to assertions to be able to make the judgement as to which executions do not affect which assertions. We describe the ideas in terms of an example...

Process Algebras, PAs, are formalisms able to capture the behaviour of a computing system by, for example, giving the labelled transition system, LTS, where states are nodes and where all possible evolutions of the system are arcs; The drawing of the complete LTS is a NP-complete task, so that, the reaching of a particular ‘desired’ state is a problem which deserves some heuristic for improving...