Lifting general correctness into partial correctness is ok

  • Authors:

  • Steve Dunne;Andy Galloway

  • Affiliations:

  • School of Computing, University of Teesside, Middlesbrough, UK;High Integrity Systems Engineering, Department of Computer Science, University of York, UK

  • Venue:
  • IFM'07 Proceedings of the 6th international conference on Integrated formal methods
  • Year:
  • 2007

  • General Correctness Algebra

    RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science

  • Partial, total and general correctness

    MPC'10 Proceedings of the 10th international conference on Mathematics of program construction

Quantified Score

Hi-index 0.00

Visualization

Abstract

Commands interpreted in general correctness are usually characterised by their wp and wlp predicate transformer effects. We describe a way to ascribe to such commands a single predicate transformer semantics which embodies both their wp and wlp characteristics. The new single predicate transformer describes an everywhere-terminating "lifted" computation in an ok-enriched variable space, where ok is inspired by Hoare and He's UTP but has the novelty here that it enjoys the same status as the other state variables, so that it can be manipulated directly in the lifted computation itself. The relational model of this lifted computation is not, however, simply the canonical UTP relation of the original underlying computation, since this turns out to yield too cumbersome a lifted computation to permit reasoning about efficiently with the mechanised tools available. Instead we adopt a slightly less constrained model, which we are able to show is nevertheless still effective for our purpose, and yet admits a much more efficient form of mechanised reasoning with the tools available.