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 simpler
Download Presentation
Download Note : "Automated and Modular Refinement Reasoning" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.