| T. Kleymann, `Hoare logic and auxiliary variables'. Formal Asp. Comput. 11 (1999), 541-- 566. |
.... in the postcondition notation of the Eiffel programming language [10] where # # is called old # ) and in the OCL specification language [14] where # # is called # pre ) Its usefulness lies in the fact that it simplifies specifications by doing away with the need for most specification variables [8] without having to drag in the full apparatus of the relational calculus. The extent to which this simple expedient cleans up formulae becomes clear if we observe that the classical criterion for repetition termination [3, 9, 28) ### ## ## # # # # # ## # ## # #### # AB74 3 can now be shortened ....
T. Kleymann, `Hoare logic and auxiliary variables'. Formal Asp. Comput. 11 (1999), 541-- 566.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC