Logic of Hoare

The logical of Hoare , sometimes called logic of Floyd-Hoare, is a formal Méthode defined by the researcher in British data processing Tony Hoare in an article of 1969 entitled An axiomatic basis for computer programming . The method of Hoare sets up a logical formalism making it possible to reason on the correction of the computer programs. Hoare took as a starting point the work on the formal methods in the flow chart S of Robert Floyd, which had not been informed to him of work of Alan Turing on the subject.

The logic of Hoare describes the possible evolutions of the state of a computer program. The evolutions are modelled by rules and the state of a program is symbolized by a triplet

$\backslash \; \{P\; \backslash \}\; \backslash ;\; C\; \backslash ;\; \backslash \; \{Q\; \backslash \},$

where P and Q are predicates and C is an order (an action on the program). The condition P is called the precondition and Q the postcondition.

The logic of Hoare has Axiome S and rules of inference for all the basic instructions of a imperative computer programming language. Hoare adds in its original paper of the rules for the procedures, the jump S, the pointer S and the competition.

See too

• Semantic axiomatic

References

Random links:

List general advisers of Coast-in Or | TELECOM Lille 1 | Alexandre Schaumasse | Department of Boaco | Pandémonium (plane) | &_de_Brewster_Jennings_;_Associés

© 2007-2008 speedlook.com; article text available under the terms of GFDL, from fr.wikipedia.org