University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Summer of Science Talks: An Introduction to Discrete Geometry, with application to the Principles of Concurrent Programming

Summer of Science Talks: An Introduction to Discrete Geometry, with application to the Principles of Concurrent Programming

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

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

 Please note, this event may be recorded. Microsoft will own the copyright of any recording and reserves the right to distribute it as required.

A discrete geometry consists of a finite set of points, lines, and figures laid out in two dimensions. In our application, the dimensions stand for execution time and space in the memory of the computer. The points stand for actions performed in program execution, vertical lines record the behaviour of objects, horizontal lines represent transactions, and figures are sets of actions occurring in execution of a syntactic component of the program text. The diagram is similar to a Message Sequence Chart, or a litmus test in the study of relaxed memory. From the Geometry, it is possible to deduce the Principles of Concurrent Programming, as expressed in Hoare Logic or expressed in Plotkin’s structured operational semantics, or in the algebraic laws used for program optimisation.

The exposition is introductory, and requires no background other than an acquaintance with high-school geometry, algebra, and logic.

There will be time after the talk for a more in-depth discussion of the techniques presented and their applications.

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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