We unify the parallel composition rule of assumption-commitment specifications for respectively state-based and message-based concurrent processes. Without providing language-dependent definitions, we first assume that the model of a process can be given as a set of 'sequences' (e.g., traces, state sequences). Then we assume the existence of a merging operator that captures the compositionality of that model. On this basis, we formulate a semantic parallel composition rule for assumption-commitment specifications wherein the merging operator behaves as a parameter. Then, by providing suitable language-specific definitions for the model of a process and the merging operator, we transform the semantic rule into syntactic ones, both for the st...
The problem of designing a component that combined with a known part of a system, conforms to a give...
This paper has the purpose of reviewing some of the established relationships between logic and conc...
In this paper we introduce an abstract algebra for reasoning about concurrent programs, that include...
Assumption-Commitment paradigms for specification and verification of concurrent programs have been ...
The problem of composing assumption-commitment specifications arises in the hierarchical development...
AbstractThe problem of composing assumption-commitment specifications arises in the hierarchical dev...
AbstractIn previous work we have developed a transition trace semantic framework, suitable for share...
We present a model for distributed logic programming based on ANDparallelism and on explicit message...
CSP# (communicating sequential programs) is a modelling language designed for specifying concurrent ...
AbstractWe provide a new denotational semantic model, based on “footstep traces”, for parallel progr...
Compositional verification provides a way for deducing properties of a complete program from propert...
In the context of communicating parallel process systems various paradigma for communication resp. s...
In this paper we present a theory for the refinement of shared-memory concurrent algorithms from spe...
We address the problem of specifying concurrent processes that can make local nondeterministic decis...
AbstractThis paper has the purpose of reviewing some of the established relationships between logic ...
The problem of designing a component that combined with a known part of a system, conforms to a give...
This paper has the purpose of reviewing some of the established relationships between logic and conc...
In this paper we introduce an abstract algebra for reasoning about concurrent programs, that include...
Assumption-Commitment paradigms for specification and verification of concurrent programs have been ...
The problem of composing assumption-commitment specifications arises in the hierarchical development...
AbstractThe problem of composing assumption-commitment specifications arises in the hierarchical dev...
AbstractIn previous work we have developed a transition trace semantic framework, suitable for share...
We present a model for distributed logic programming based on ANDparallelism and on explicit message...
CSP# (communicating sequential programs) is a modelling language designed for specifying concurrent ...
AbstractWe provide a new denotational semantic model, based on “footstep traces”, for parallel progr...
Compositional verification provides a way for deducing properties of a complete program from propert...
In the context of communicating parallel process systems various paradigma for communication resp. s...
In this paper we present a theory for the refinement of shared-memory concurrent algorithms from spe...
We address the problem of specifying concurrent processes that can make local nondeterministic decis...
AbstractThis paper has the purpose of reviewing some of the established relationships between logic ...
The problem of designing a component that combined with a known part of a system, conforms to a give...
This paper has the purpose of reviewing some of the established relationships between logic and conc...
In this paper we introduce an abstract algebra for reasoning about concurrent programs, that include...