AbstractThe problem of composing assumption-commitment specifications arises in the hierarchical development of reactive or concurrent systems. Abadi and Lamport's composition principle has been proposed as a logic-independent solution to that problem. In this paper, we apply it to derive a parallel rule for UNITY-like assumption-commitment specifications. For that purpose, we first interpret UNITY formulas in Abadi and Lamport's compositional model. Then, the premises of the parallel rule are reduced to proof obligations that can be carried with rules inherited from the UNITY logic. The approach is illustrated by an example
Compositional analysis techniques such as assume-guarantee reasoning are frequently used in computer...
AbstractWe present a simple formulation of Assumption-Commitment reasoning using CSP. In our formula...
AbstractThe UNITY approach to specification, design, and verification of parallel programs expounded...
The problem of composing assumption-commitment specifications arises in the hierarchical development...
Assumption-Commitment paradigms for specification and verification of concurrent programs have been ...
This paper presents composition rules for assumption-commitment specifications that handle liveness ...
Abstract. The paper reports on experiences of mechanizing various proposals for compositional reason...
Abstract. We present a logic of specifications of reactive systems. The logic is independent of part...
AbstractThis paper introduces open systems with non-trivial environment actions and proposes a coope...
The assumption/commitment (also called rely/guarantee) style has been advocated for the specificatio...
Large distributed applications are composed of basic blocks, by using composition operators. In an ...
The paper reports on experiences of mechanizing various proposals for compositional reasoning in co...
We unify the parallel composition rule of assumption-commitment specifications for respectively stat...
Compositional verification provides a way for deducing properties of a complete program from propert...
We present a simple formulation of Assumption-Commitment reasoning using CSP (Communicating Sequenti...
Compositional analysis techniques such as assume-guarantee reasoning are frequently used in computer...
AbstractWe present a simple formulation of Assumption-Commitment reasoning using CSP. In our formula...
AbstractThe UNITY approach to specification, design, and verification of parallel programs expounded...
The problem of composing assumption-commitment specifications arises in the hierarchical development...
Assumption-Commitment paradigms for specification and verification of concurrent programs have been ...
This paper presents composition rules for assumption-commitment specifications that handle liveness ...
Abstract. The paper reports on experiences of mechanizing various proposals for compositional reason...
Abstract. We present a logic of specifications of reactive systems. The logic is independent of part...
AbstractThis paper introduces open systems with non-trivial environment actions and proposes a coope...
The assumption/commitment (also called rely/guarantee) style has been advocated for the specificatio...
Large distributed applications are composed of basic blocks, by using composition operators. In an ...
The paper reports on experiences of mechanizing various proposals for compositional reasoning in co...
We unify the parallel composition rule of assumption-commitment specifications for respectively stat...
Compositional verification provides a way for deducing properties of a complete program from propert...
We present a simple formulation of Assumption-Commitment reasoning using CSP (Communicating Sequenti...
Compositional analysis techniques such as assume-guarantee reasoning are frequently used in computer...
AbstractWe present a simple formulation of Assumption-Commitment reasoning using CSP. In our formula...
AbstractThe UNITY approach to specification, design, and verification of parallel programs expounded...