Compositional proof methods for concurrency: A semantic approach
it highlights the very concept of compositional state-based reasoning about concurrency without any syntactic overhead, and
it serves as a basis for the encoding of the program semantics and corresponding proof rules inside tools such as PVS which support program verification.
KeywordsParallel System History Variable Parallel Composition Semantic Approach Proof Rule
Unable to display preview. Download preview PDF.
- 3.R.P. Kurshan and L. Lamport. Verification of a multiplier: 64 bits and beyond. Proceedings of the 5th International Conference on Computer-Aided Verification(CAV94).Google Scholar
- 4.W.-P. de Roever, F.S. de Boer, U. Hannemann, J. Hooman, Y. Lakhnech, M. Poel,and J. Zwiers. Concurrency Verification: From Noncompositional to Compositional Proof Methods Submitted for publication in 1998.Google Scholar