University of Cambridge > > REMS lunch > Lipton's Reduction for TSO

Lipton's Reduction for TSO

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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