Hoare logic

I Moder computing arose from a collision between mathematical logic

and mechanical calculators during WW2.

I _{Every programming language is a mathematical formal system – that}

is, a logic.

I Every computer program is a sketch of a formal proof.

I _{The task of computer science is to exploit the links between formal}

logic and practical programming.

I The best attempt so far is Hoare logic:{pre}command{post}. I _Example:{_y+₁=_z}_x=_y+₁{_x=_z}_.

I This derives from a rule:{RE_x}x=E{R}. I There are rules for every program structure.

I Moder computing arose from a collision between mathematical logic

and mechanical calculators during WW2.

I _{Every programming language is a mathematical formal system – that}

is, a logic.

I Every computer program is a sketch of a formal proof.

I _{The task of computer science is to exploit the links between formal}

logic and practical programming.

I The best attempt so far is Hoare logic:{pre}command{post}. I _Example:{_y+₁=_z}_x=_y+₁{_x=_z}_.

I This derives from a rule:{RE_x}x=E{R}. I There are rules for every program structure.

Hoare logic

I Moder computing arose from a collision between mathematical logic

and mechanical calculators during WW2.

I _{Every programming language is a mathematical formal system – that}

is, a logic.

I Every computer program is a sketch of a formal proof.

I _{The task of computer science is to exploit the links between formal}

logic and practical programming.

I The best attempt so far is Hoare logic:{pre}command{post}. I _Example:{_y+₁=_z}_x=_y+₁{_x=_z}_.

I This derives from a rule:{RE_x}x=E{R}. I There are rules for every program structure.

Hoare logic

I Moder computing arose from a collision between mathematical logic

and mechanical calculators during WW2.

I _{Every programming language is a mathematical formal system – that}

is, a logic.

I Every computer program is a sketch of a formal proof.

I _{The task of computer science is to exploit the links between formal}

logic and practical programming.

I The best attempt so far is Hoare logic:{pre}command{post}. I _Example:{_y+₁=_z}_x=_y+₁{_x=_z}_.

I This derives from a rule:{RE_x}x=E{R}. I There are rules for every program structure.

Hoare logic

I Moder computing arose from a collision between mathematical logic

and mechanical calculators during WW2.

I _{Every programming language is a mathematical formal system – that}

is, a logic.

I Every computer program is a sketch of a formal proof.

I _{The task of computer science is to exploit the links between formal}

logic and practical programming.

I The best attempt so far is Hoare logic:{pre}command{post}. I _Example:{_y+₁=_z}_x=_y+₁{_x=_z}_.

I This derives from a rule:{RE_x}x=E{R}. I There are rules for every program structure.

Hoare logic

I Moder computing arose from a collision between mathematical logic

and mechanical calculators during WW2.

I _{Every programming language is a mathematical formal system – that}

is, a logic.

I Every computer program is a sketch of a formal proof.

I _{The task of computer science is to exploit the links between formal}

logic and practical programming.

I The best attempt so far is Hoare logic:{pre}command{post}.

I _Example:{_y+₁=_z}_x=_y+₁{_x=_z}_. I This derives from a rule:{RE_x}x=E{R}. I There are rules for every program structure.

Hoare logic

I Moder computing arose from a collision between mathematical logic

and mechanical calculators during WW2.

I _{Every programming language is a mathematical formal system – that}

is, a logic.

I Every computer program is a sketch of a formal proof.

I _{The task of computer science is to exploit the links between formal}

logic and practical programming.

I The best attempt so far is Hoare logic:{pre}command{post}. I _Example:{_y+₁=_z}_x=_y+₁{_x=_z}_.

I This derives from a rule:{RE_x}x=E{R}. I There are rules for every program structure.

Hoare logic

I Moder computing arose from a collision between mathematical logic

and mechanical calculators during WW2.

I _{Every programming language is a mathematical formal system – that}

is, a logic.

I Every computer program is a sketch of a formal proof.

I _{The task of computer science is to exploit the links between formal}

logic and practical programming.

I The best attempt so far is Hoare logic:{pre}command{post}. I _Example:{_y+₁=_z}_x=_y+₁{_x=_z}_.

I This derives from a rule:{RE_x}x=E{R}.

Hoare logic

I Moder computing arose from a collision between mathematical logic

and mechanical calculators during WW2.

I _{Every programming language is a mathematical formal system – that}

is, a logic.

I Every computer program is a sketch of a formal proof.

I _{The task of computer science is to exploit the links between formal}

logic and practical programming.

I The best attempt so far is Hoare logic:{pre}command{post}. I _Example:{_y+₁=_z}_x=_y+₁{_x=_z}_.

In document concurrentprogramming 2 pdf (Page 75-84)