Beyond Concurrent Separation Logic: Who is Afraid of Completeness Proofs?
摘要
This paper introduces a general semantic approach to the definition and formal justification (soundness and completeness) of the Owicki/Gries method for proving correctness of parallel programs. Instantiating the general semantic approach allows to obtain sound and complete proof methods for both the standard model of shared variable concurrency and the concurrency model based on dynamically allocated variables, as described by separation logic.