Formalising general correctness
We consider the abstract command language of Dunne, and his account of general correctness. We provide an operational interpretation of his abstract commands, and use the automated theorem proving system Isabelle to prove that this operational interpretation leads to Dunne's semantics. We consider the difficulties in precisely formalising some formulae found in the literature.
|Collections||ANU Research Publications|
|Source:||Electronic Notes in Theoretical Computer Science|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.