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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Lipton's Reduction for TSO

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Computer Laboratory, William Gates Building, Room FW26 Average on weekdays: 8977.07777778 kWh G-R 03, English Faculty

Other talks

TBC External Seminar - Jenn Brophy TBC Director's Briefing Title to be confirmed Group Work Morning Break
 

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