PPT-Automated and Modular Refinement Reasoning

for Concurrent Programs Shaz Qadeer The refinement approach P is safe P P 0 refines P 1 P k1 refines P k is safe Abstraction Refinement Layered proof could be

amp tid linear call tid amp call linear int idx assert rootabs var yield root lock atomic obj tidowns rootaddr refinement mark

Presentation Embed Code

<iframe width="560" height="315" src="https://www.docslides.com/embed/383867" frameborder="0" allowfullscreen></iframe>

Download Presentation

Download Presentation The PPT/PDF document "Automated and Modular Refinement Reasoni..." is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.