Partial Correctness Assertions Research Articles

A Second-Order Dynamic Logic with Array Assignments

A second-order axiomatization of dynamic logic with array assignments is presented. This axiomatization is shown to be arithmetically complete in the sense of Harel. As an example, a partial correctness assertion concerning a sorting algorithm is proved.