Lipton's Reduction for TSO

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

• Ali Sezgin
• Wednesday 05 November 2014, 13:00-14:00
• FW11.

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

This talk is about adopting Lipton’s reduction theory, a well-known SC analysis technique almost 40 years old, to TSO program analysis. I will argue that the explicit inclusion of store buffer flushes in mover analysis results in a natural framework for TSO program analysis. As an illustrating example, I will talk about how one can obtain SC-summaries of TSO programs (possibly with triangular races) within the TSO -Reduction framework.

This talk is part of the REMS lunch series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Department of Computer Science and Technology talks and seminars
• FW11
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.