Compositional proof methods for concurrency: A semantic approach

  • F. S. de Boer
  • W. -P. de Roever
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1536)


This paper focusses on the mathematical theory of state-based reasoning about program constructs solely through specifications of their parts, without any reliance on their implementation mechanism. That is, the semantic foundations of compositional state-based reasoning about concurrency. The main advantages of a purely semantic approach are that:
  • 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.


Parallel System History Variable Parallel Composition Semantic Approach Proof Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. Abramsky. Domain Theory in Logical Form. Proceedings, Annual Symposium on Logic in Computer Science, pp. 47–53, IEEE CS, 1987. Extended version in Annals of Pure and Applied Logic, 51: 1–77, 1991.MathSciNetzbMATHGoogle Scholar
  2. 2.
    R.W. Floyd. Assigning meanings to programs. In Proceedings AMS Symp. Applied Mathematics, volume 19, pages 19–31, Providence, R.I., 1967. American Mathematical Society.MathSciNetGoogle Scholar
  3. 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. 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
  5. 5.
    J. Zwiers. Compositionality and Partial Correctness LNCS 321. Springer-Verlag, 1989.zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • F. S. de Boer
    • 1
  • W. -P. de Roever
    • 2
  1. 1.Utrecht UniversityThe Netherlands
  2. 2.University of KielGermany

Personalised recommendations