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

A proof rule for multi-threaded programs

Add to your list(s) 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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