University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > A proof rule for multi-threaded programs

  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

A proof rule for multi-threaded programs

Download to your calendar using vCal

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins .

A modular proof rule for the verification of temporal safety and liveness properties of multi-threaded programs, and how this rule can be transformed into an automatic method.

Joint work with Ashutosh Gupta and Corneliu Popeea.

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

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cardiovascular Epidemiology Unit Special Seminars The Gallery, CMRI (Cranfield Management Research Institute), Building 38, Cranfield School of Management, Cranfield, Bedford, MK43 0AL Main Lecture Theatre Department of Zoology Entry is via the Department of Zoology, Monkey Parade Entrance (by the Museum of Zoology), through the archway from Downing Street. (accessible without a swipe card)

Other talks

Tea and Coffee Break Not-so-noble gases, key tracers of Earth’s habitability: what their behaviour in planetary interiors can tell us? Group Work Online Causal Inference Seminar Title to be confirmed Organiser Welcome
 

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