. . "Hoare logic"@en . _:bnode7authoritiessubjectssh2005007311 . _:bnode7authoritiessubjectssh2005007311 _:bnode8authoritiessubjectssh2005007311 . _:bnode7authoritiessubjectssh2005007311 . _:bnode8authoritiessubjectssh2005007311 . _:bnode8authoritiessubjectssh2005007311 "Hoare logic"@en . . . . . _:bnode15authoritiessubjectssh2005007311 . _:bnode15authoritiessubjectssh2005007311 . _:bnode15authoritiessubjectssh2005007311 . _:bnode15authoritiessubjectssh2005007311 "Hoare's logic"@en . _:bnode15authoritiessubjectssh2005007311 _:bnode20authoritiessubjectssh2005007311 . _:bnode20authoritiessubjectssh2005007311 _:bnode21authoritiessubjectssh2005007311 . _:bnode20authoritiessubjectssh2005007311 . _:bnode21authoritiessubjectssh2005007311 . _:bnode21authoritiessubjectssh2005007311 "Hoare's logic"@en . . . _:bnode26authoritiessubjectssh2005007311 . _:bnode26authoritiessubjectssh2005007311 . _:bnode26authoritiessubjectssh2005007311 "Work cat.: Takaoka, T. A decomposition rule for Hoare logic, 1986:" . _:bnode26authoritiessubjectssh2005007311 "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)"@en . _:bnode26authoritiessubjectssh2005007311 "found" . _:bnode34authoritiessubjectssh2005007311 . _:bnode34authoritiessubjectssh2005007311 . _:bnode34authoritiessubjectssh2005007311 "Wikipedia, Nov. 1, 2005" . _:bnode34authoritiessubjectssh2005007311 "(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)"@en . _:bnode34authoritiessubjectssh2005007311 "found" . _:bnode42authoritiessubjectssh2005007311 . _:bnode42authoritiessubjectssh2005007311 . _:bnode42authoritiessubjectssh2005007311 "Dictionary of computing, 1996:" . _:bnode42authoritiessubjectssh2005007311 "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)"@en . _:bnode42authoritiessubjectssh2005007311 "found" . _:bnode50authoritiessubjectssh2005007311 . _:bnode50authoritiessubjectssh2005007311 . _:bnode50authoritiessubjectssh2005007311 "Encyclopedia of computer science, 2000:" . _:bnode50authoritiessubjectssh2005007311 "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)"@en . _:bnode50authoritiessubjectssh2005007311 "found" . _:bnode58authoritiessubjectssh2005007311 . _:bnode58authoritiessubjectssh2005007311 . _:bnode58authoritiessubjectssh2005007311 "OCLC, Nov. 1, 2005" . _:bnode58authoritiessubjectssh2005007311 "(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)"@en . _:bnode58authoritiessubjectssh2005007311 "found" . _:bnode66authoritiessubjectssh2005007311 . _:bnode66authoritiessubjectssh2005007311 . _:bnode66authoritiessubjectssh2005007311 "2006-03-15T00:00:00"^^ . _:bnode66authoritiessubjectssh2005007311 "new"^^ . _:bnode66authoritiessubjectssh2005007311 . _:bnode66authoritiessubjectssh2005007311 . _:bnode74authoritiessubjectssh2005007311 . _:bnode74authoritiessubjectssh2005007311 . _:bnode74authoritiessubjectssh2005007311 "2006-03-15T12:17:28"^^ . _:bnode74authoritiessubjectssh2005007311 "revised"^^ . _:bnode74authoritiessubjectssh2005007311 . _:bnode74authoritiessubjectssh2005007311 .