Algebra unifies Calculi of programming

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

• Tony Hoare (Microsoft Research)
• Friday 02 December 2011, 14:00-15:00
• Room FW11, Computer Laboratory, William Gates Building.

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

Boolean algebra has made an indispensable contribution to the design of computer hardware. I suggest an algebra of programs, supported by mechanised tools, may be important in the engineering of software. The algebraic laws that govern program constructions are extremely familiar (e.g. associativity, commutativity), but with a couple of novel extensions to treat concurrency, and they apply to program specifications and designs as well. The laws justify algebraic proofs of a collection of useful programming calculi, including both deductive rules (e.g. Hoare Logic) and operational semantics (e.g. Milner transitions). Surprisingly, the algebra is simpler than each of these calculi individually, and as strong as all of them in combination.

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

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computing and Mathematics
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• Logic and Semantics Seminar (Computer Laboratory)
• Room FW11, Computer Laboratory, William Gates Building
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• tcw57’s list
• yk373's list

Note that ex-directory lists are not shown.