Formal Justification of the Rely-Guarantee Paradigm for Shared-Variable Concurrency: A Semantic Approach

Authors:
Frank S. de Boer;Ulrich Hannemann;Willem P. de Roever
Affiliations:
-;-;-
Venue:
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
Year:
1999

Citing 7
Cited 0

Tentative steps toward a development method for interfering programs

ACM Transactions on Programming Languages and Systems (TOPLAS)
A logical view of composition

Selected papers of the 3rd workshop on Concurrency and compositionality
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Compositional Verification of Real-Time Applications

COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
The Failure of Failures in a Paradigm for Asynchronous Communication

CONCUR '91 Proceedings of the 2nd International Conference on Concurrency Theory
A Proof Technique for Rely/Guarantee Properties

Proceedings of the Fifth Conference on Foundations of Software Technology and Theoretical Computer Science
Proofs of Networks of Processes

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a semantic analysis of th Rely-Guarantee (R-G) approach to the compositional verification of shared-variable concurrency. The main Contridution is a new completeness proof.