P. Collette. Composition of assumption-commitment specifications in a UNITY style. Science of Computer Programming, 23:107--125, December 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....e.g. 5] the only way known to preserve a progress property of a component was by explicitly specifying all intermediate properties that constitute the given progress and to require the environment to preserve each of them. This involves a lot of verification work. Modern theories such as [2, 3, 8, 9] allow us to choose our own preservation constraint as long as it is stronger than a certain lower bound . Di#erent theories may have di#erent lower bounds, and thus di#er in strength. For example, the theory in [2, 3] is considered to be one of the strongest. There are however some issues which ....

....to verify that Q satisfies B. components synchronize by mutual exclusion. One may look at our approach as providing a proof pattern , that, when applied, will make verification of the overall systems easier. Our approach is axiomatic, meaning that compared to more semantical approaches, such as [2, 3, 8, 9], the emphasis is on how di#erent properties compose rather than why they compose. Essentially, we abstract the theory from its possibly complicated semantical model, resulting in a theory which is simple and elegant. Once the theory is presented, some semantics is still needed to convince ....

[Article contains additional citation context not shown here]

P. Collette. Composition of assumption-commitment specifications in a UNITY style. Science of Computer Programming, 23:107--125, December 1994.

....on predicate transformers, for proving properties of composed programs from properties of their components. In the literature on program composition, components have been specified with properties variously called rely guarantee [Jon83, Sta85] hypothesis conclusion [CM88] assumption commitment [Col94, CK95], offers using [LS94, LS92] and assumption guarantee [AL93, AL95] The common idea is that assumptions about the environment form part of the specification of a component. In this paper, we develop this idea using predicate transformers and a different view of how to specify the environment. This ....

....not use one property for the environment and the other for the component or system, and our model does not have restrictions on sharing of state between components. An axiomatic semantics based on predicate transformers for rely guarantee properties for UNITY with local variables has been given in [Col94, CK95]. They define properties of the form F sat P w:r:t: R where F is a program, P is a UNITY property such as leads to, and R is an interference predicate constraining the next state relation of the environment. Two components cooperate with respect to their interference predicates if neither ....

Pierre Collette. Composition of assumption-commitment specifications in a UNITY style. Science of Computer Programming, 23:107-- 125, 1994.

....union of the effect relations of the fs 1 ; s mg elements of the abstract program (for details see [7, 8] The introduced semantics is an interleaving semantics of parallel programs. A true parallel semantics would destroy even the restricted compositionality of the programming model [1, 3]. A behaviour relation of abstract parallel programs: The program properties with respect of an abstract parallel program are characterized as relations over the powerset of the state space. They are defined in terms of the weakest precondition of the element statements [13] of the abstract ....

Collette, P.: Composition of assumption-commitment specifications in a UNITY style. Science of Computer Programming, Vol. 23 (1994) 107-125.

....steps) Indeed, nothing reasonable can be expected from an operation whose environment modifies the state in an arbitrary way. The use of assumption commitment specifications in the development of concurrent systems is not restricted to the formalism discussed in this report: other examples are [AL93, BK85, Col94, JT95, KR93, MC81, PJ91, Sta86, ZdBdR84]. Some of the methodological issues raised in this report hopefully spread across examples and formalisms but the case study is only representative of one specific class of shared state operations. In general, operations have both an input output behaviour and a reactive behaviour. The former ....

Pierre Collette. Composition of assumption-commitment specifications in a UNITY style. Science of Computer Programming, 23:107--125, 1994.

No context found.

P. Collette. Composition of assumption-commitment specifications in a UNITY style. Science of Computer Programming, 23:107--125, December 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC