A proof rule for multi-threaded programs

Channel:
Microsoft Research
Subscribers:
351,000
Published on ● Video Link: https://www.youtube.com/watch?v=axU0CZ5tJBU


Duration: 1:30:00
61 views
0

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.



Other Videos By Microsoft Research


2016-08-17Spectrum Usage Understanding and Dynamic Spectrum Sharing
2016-08-17Getting an Edge at High Speeds: Randomized Algorithms and Networking Hardware
2016-08-17Simple Procurement Mechanisms
2016-08-17Scale-invariant random spatial networks
2016-08-17Optimal Auctions
2016-08-17Breaking the Multicommodity Flow Barrier for ?log(n)-Approximations to Sparsest Cut
2016-08-17Pseudorandom Generators for Regular Branching Programs
2016-08-17Skill Matters: How Web Savvy and Other Factors Influence Online Behavior
2016-08-17Advancing our ability to predict the dynamics of complex natural systems
2016-08-17Cover times, blanket times, and the Gaussian free field
2016-08-17A proof rule for multi-threaded programs
2016-08-17We have it easy, but do we have it right?
2016-08-17Increasing the accessibility of pen-based interaction for older adults
2016-08-17Programs & Projects at the University of Washington Center for Information Assurance & Cybersecurity
2016-08-17The Brave New World of Full Service Computing
2016-08-17Incentive Design in Distributed-Work Systems: Image Labeling Games and Question and Answer Forums
2016-08-17Temporal Causality for Visual Event Analysis
2016-08-17Quasirandom Load Balancing
2016-08-17Images as Sets of Locally Weighted Features
2016-08-17Mining Knowledge from Databases: An Information Network Analysis Approach
2016-08-17The continuity of permanental processes with applications to local times of Markov processes


Tags:
microsoft research