S. S. Lam and A. U. Shankar. A theory of interfaces and modules I--composition theorem. IEEE Transactions on Software Engineering, January 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and reentrant connectors. 3. 5 Specification correctness The definition of correctness criteria, i.e. a set of theoretical tools that assert whether an interface specification or a composite implementation is correct or not, is a central issue in architectural description languages ( 7] 4] [14]) because it permits taking full advantage of the explicit architectural specifications and to compensate the specification overhead. The following paragraphs detail the main criteria proposed here. Interfaces In order to describe passive or reentrant components, an interface specification I ....

....of communication. Thus no architectural analysis is proposed, and the benefits of the architectural description seem restricted to easing the distribution. It would be interesting to relate our work to some results in the software engineering field, such as the I composition of Lam and Shankar [14], and to compare our correctness criteria, based on bisimulation, to their theorem for characterizing the Interface Implementation correctness by using set oriented operations. However, the calculus developed in this paper seems more adapted to define operational semantics of interconnected ....

Simon S. Lam, A.Udaya Shankar, "A Theory of Interfaces and Modules I-Composition Theorem " IEEE Transactions on Software Engineering, Vol. 20, No. 1, January 1994.

....and reentrant connectors. 4. 4 Specification correctness The definition of correctness criteria, i.e. a set of theoretical tools that assert whether an interface specification or a composite implementation is correct or not, is a central issue in architectural description languages ( 7] 4] [17]) because it permits taking full advantage of the explicit architectural specifications and to compensate the specification overhead. The following paragraphs detail the main criteria proposed here. Interfaces In order to describe passive or reentrant components, an interface specification I ....

....of communication. Thus no architectural analysis is proposed, and the benefits of the architectural description seem restricted to easing the distribution. It would be interesting to relate our work to some results in the software engineering field, such as the I composition of Lam and Shankar [17], and to compare our correctness criteria, based on bisimulation, to their theorem for characterizing the Interface Implementation correctness by using set oriented operations. However, the calculus developed in this paper seems more adapted to define operational semantics of interconnected ....

Simon S. Lam, A.Udaya Shankar, "A Theory of Interfaces and Modules I-Composition Theorem " IEEE Transactions on Software Engineering, Vol. 20, No. 1, January 1994.

....such questions, both from the theoretical point of view and by applying the theory of composition to a collection of examples. In particular, we are working on developing a theory based on the traditional rely guarantee approach [8, 13] and relating it to other theories of composition [10, 1]. The vision that drives us is that of modularity at the level used by manufacturers of personal computers, cars and airplanes. Such systems are complex with large numbers of parts. We should be able to compose certain kinds of software modules in the same way. Just as there have been many ....

S. S. Lam and A. U. Shankar. A theory of interfaces and modules 1: Composition theorem. IEEE Transactions on Software Engineering, 20(1):55--71, January 1994.

.... service specification, and are therefore restricted to only those protocols that can be synthesized (the proposed algorithms typically place restrictions on the service specification that can be translated into protocol specification) Another approach is the refinement methodology proposed in [11, 7]. In this approach, one starts with a high level specification A that is refined in a stepwise manner to a more detailed specification refined(A) such that refined(A) satisfies A. This approach can be used to refine ss(P ) to ss(R) In [11] specifications are given as I=O automata and a ....

S. Lam and A. Udaya Shankar. A theory of interfaces and modules i--composition theorem. IEEE Transactions on Software Engineering, 20(1):55--71, 1994.

....and document the rationale for its development [7] Architectural styles can be used to tailor proof techniques or provide a framework for modular proofs. Layered architectures can be reasoned about using modular proofs for each layer and then relying on the composition theorem of Lam and Shankar [49] to show that the system as a whole has the desired properties. The equivalence of two architectures may be proven [59] modulo the equivalence of their components, thus providing assurance about a system re structuring or about a refinement from an abstract architecture to a concrete ....

Simon S. Lam and A. Udaya Shankar, A theory of interfaces and modules I --- Composition theorem, IEEE Trans. Software Eng. 20, 1 ( january 1994) 55--71.

....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 leads to a simple theory of ....

....[CS95] This approach coupled with the results on predicate transformers led to our idea of a predicate transformer for dealing with parallel program composition. Variants of rely guarantee specifications have been proposed in numerous papers including [Jon83, AL93, MS96] for layered systems in [LS94, LS92], in temporal logic frameworks in [Pnu84, Sta85] and for TLA in particular in [AL95] The temporal logic approaches are more expressive than ours in the sense that the specifications are statements about individual computations. For example, in [AL95] E Gamma M means that for each ....

S. S. Lam and A. U Shankar. A theory of interfaces and modules 1: Composition theorem. IEEE Transactions on Software Engineering, 20(1):55--71, January 1994.

No context found.

S. S. Lam and A. U. Shankar. A theory of interfaces and modules I--composition theorem. IEEE Transactions on Software Engineering, January 1994.

No context found.

S. S. Lam and A. U. Shankar. A theory of interfaces and modules I--composition theorem. IEEE Transactions on Software Engineering, January 1994.

....in addressing several implementation issues. We have also generalized the end to end delay guarantee from VC servers to a class of guaranteed deadline servers. A brief overview follows. 15 For an in depth treatment of assumptions and guarantees between service providers and consumers, see [6]. The scheduler of a VC server (in fact, any priority server) must repeatedly search for the smallest element in a set of priority values (deadlines) For high speed networks of the future, it is likely that a channel will be shared by hundreds, and perhaps, thousands of flows. Thus the search ....

Simon S. Lam and A. Udaya Shankar. A theory of interfaces and modules I: Composition theorem. IEEE Transactions on Software Engineering, 20(1):55--71, January 1994.

....too early with prompt service is counterproductive. The delay guarantee is useful because it is conditional. As such, it does not require the service facility (actually the designer and implementor of the facility) to be concerned with the behavior of sources, of which the facility has no control [6]. There is no requirement that sources be flow controlled or well behaved. Even though the reserved rate of flow f is r(f) its source can misbehave, i.e. its traffic generation rate can be arbitrary. However, we do assume that each flow is allocated its own buffers, so that if a source generates ....

....deliver the flow s packets reliably (i.e. in order delivery with no loss) 11 A virtual clock delay guarantee, in general, is a deadline measured from the virtual clock value of an arrival. 12 For an in depth treatment of assumptions and guarantees between service providers and consumers, see [6]. SW1 SW2 SW3 SW4 VS6 VS4 VS3 VS2 VS1 VS5 VD1 VD3 VD4 VD5 VD6 VD2 CS3 CS1 CS2 CD2 CD1 10Mbps (0.3ms) 10Mbps (0.5ms) 15Mbps (0.3ms) 15Mbps (0.4ms) L1 20Mbps (3ms) L2 20Mbps (4ms) L3 20Mbps (4ms) 0.4) 0.6) 0.4) 0.2) 0.5) 10Mbps (0.2ms) 5Mbps (1ms) 0.4) 0.5) 0.7) 0.4) 3.0) Figure 2: ....

Simon S. Lam and A. Udaya Shankar. A theory of interfaces and modules I: Composition theorem. IEEE Transactions on Software Engineering, 20(1):55--71, January 1994.

No context found.

S. Lam and A. Shankar. A theory of interfaces and modules 1: Composition theorem. IEEE Transactions on Software Engineering, 20(1):55-71, Jan. 1994.

No context found.

LAM,S.S.AND SHANKAR, A. U. 1994. A theory of interfaces and modules i---Composition theorem. IEEE Trans. Softw. Eng. 20, 1 (Jan.).

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