01698cz 2200193n 4500 sh2005007311 DLC 20060315121728.0 060315|| anannbabn |a ana c sh2005007311 ABAU eng DLC Hoare logic Hoare's logic g Logic, Symbolic and mathematical Work cat.: Takaoka, T. A decomposition rule for Hoare logic, 1986: leaf 1 (This note presents a mechanism, called a decomposition rule, which reduces the complexity of theorem proving in program verification by the Hoare logic) Wikipedia, Nov. 1, 2005 (Hoare logic is a formal system developed by the British computer scientist C.A.R. Hoare, and published in his 1969 paper An Axiomatic Basis for Computer Programming. The purpose of the system is to provide a set of logical rules that one can use to reason about computer programs with the rigor of mathematical logic) Dictionary of computing, 1996: pp. 226-227 (Hoare logic -- A formalism for partial correctness proofs ... Many remarkable insights into program correctness have been obtained from the mathematical study of Hoare logic) Encyclopedia of computer science, 2000: p. 1465 (An axiomatic semantics abstracts program properties away from input-output behavior and into logical behavior: a standard example is Hoare logic, where program properties are formulas in propositional logic) OCLC, Nov. 1, 2005 (titles: Proving program inclusion using Hoare's logic; A brief study in automatic proofs based on a refined Hoare-logic; Process algebra with guards : combining Hoare logic with process algebra; Hoare logic for GOLOG programs)