Towards a refinement algebra

  • Authors:
  • J. von Wright

  • Affiliations:
  • Åbo Akademi University and Turku Centre for Computer Science (TUCS), Lemminkäisenkatu 14, Turku, FIN-20520 Finland

  • Venue:
  • Science of Computer Programming - Special issue on mathematics of program construction (MPC 2002)
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Kleene algebra with tests (KAT) has proved to be useful for reasoning about programs in a partial correctness framework. We describe demonic refinement algebra (DRA), a variation of KAT for total correctness and illustrate its modelling and reasoning power with a number of applications and examples.