University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Lecture 3: Logic for Program Development, Verification and Implementation.

Lecture 3: Logic for Program Development, Verification and Implementation.

Add to your list(s) Download to your calendar using vCal

  • UserTony Hoare, FRS FREng
  • ClockFriday 04 May 2018, 14:00-15:00
  • HouseFW26.

If you have a question about this talk, please contact Victor Gomes.

Tony Hoare, FRS FR Eng, Hon Mem Cambridge University Computing Laboratory.

We start with a sufficient resume of previous lectures, so prior attendance at the lectures on Geometry and Algebra is not a requirement. Interested researchers may consult the lecture notes on my personal page of the Departmental Website.

We then derive from the algebra a set of logical rules of reasoning about concurrent programs. The derivation can be reversed: from the Rules to the Algebra.

We then give algebraic definitions of Milner/Plotkin transitions, and of Hoare/O’Hearn Triples, and by simple translation obtain the traditional rule of Operational Semantics and Verification Logic. They are simply duals of each other.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2018 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity