R. J. Cleaveland and B. Steen. When is `partial' adequate? a logic-based proof technique using partial speci cations. In Proceedings of 5th Annual IEEE Symposium on Logic in Computer Science, Philadelphia, PA, June 1990.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....he does not discuss the applicability of these ideas to verification, nor does he suggest how they can be implemented. Walker [27] demonstrates how to use a preorder plus knowledge of how a system should operate to simplify the verification of bisimulation equivalence. Cleaveland and Steffen [7] use a similar idea. Winskel [28] proposes a method for decomposing specifications into properties which the components of a system must satisfy for the specification to hold. The approach is very appealing, but unfortunately, dealing with parallel composition is difficult. It is not apparent ....

R. Cleaveland and B. Steffen. When is "partial" adequate? a logic-based proof technique using partial specifications. In LICS90 [21].

.... space of some agents (sometimes making them finite rather than infinite) The inclusion of these different verification techniques permits different styles of correctness checking to be carried out, and it facilitates the development of methodologies that employ more than one of these techniques [11, 30, 44]. As a consequence, the system is oriented more towards flexibility and feasibility studies than towards efficiency. The Workbench has been applied to the verification of communication protocols and distributed algorithms [22, 41, 45] 3 3 TAV The Tav system [29] has been developed at Alborg ....

R. Cleaveland and B. Steffen. When is `partial' adequate? a logic-based proof technique using partial specifications. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, pages 287--302. Computer Society Press, 1990.

....characterization of the divergence preorder in addition to the intuitionistic interpretation of Plotkin. Further work on divergence preorders and logics to characterize them can be found in [Sti87, Wal90] Verification techniques based on the divergence preorder are described in [Wal90, CS90] In all this work logical formulas are interpreted normally in the 2 valued sense. To our knowledge none of the work on 3 valued modal logics (e.g. Seg67, Mor89, Fit92] shows how these logics can be used to characterize relations like our completeness preorder. The model checking framework ....

Rance Cleaveland and Bernhard Steffen. When is "partial" adequate? A logic-based proof technique using partial specifications. In Proceedings of the 5th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, 1990.

....and composition is the problem of defining property preserving equivalence relations or preorders which are congruences, respectively precongruences for parallel composition and abstraction. This problem has been studied, for equivalences e.g. in [HM85,BK85,GS86,GW89,GS90b] and for preorders in [LT88a,Wal88,CS90,SG90,GL91]. The results presented here are based on those given in [BBLS92] where a general framework for property preserving abstractions is given. Program models are transition relations and abstractions are given by simulations, which are parameterized by a relation between the domains of both ....

R. Cleaveland and B. Steffen. When is "partial" adequate? a logic-based proof technique using partial specifications. In LICS, 1990.

....and Paige [BP95] present a global routine that runs in time O(m 1 n 2 m 2 n 1 ) where m i and n i represent the number of states and transitions in the two systems being checked. Essentially the same algorithm was discovered independently in [HHK95] and similar ideas may be found in [CC95,CS90] Celikkan [Cel95] de nes an on the y algorithm of comparable complexity. This paper develops a new technique for computing the simulation ordering that combines the xpoint calculation techniques of [BP95] with the fast bisimulation minimization algorithm due to Paige and Tarjan [PT87,Fer90] ....

....the system state spaces [BFH 92] Related work. Bloom [Blo89] proposed an algorithm for ready simulation that runs in ( jE 1 j jE 2 j) jS 1 j jS 2 j) 6 ) time. Bloom and Paige improved this result to O(jS 1 j jT 2 j jS 2 j jT 1 j) in [BP95] similar ideas may also be found in [CS90] where preorder checking is reduced to model checking, and in [CC95,HHK95] ....

R. J. Cleaveland and B. Steen. When is `partial' adequate? a logic-based proof technique using partial speci cations. In Proceedings of 5th Annual IEEE Symposium on Logic in Computer Science, Philadelphia, PA, June 1990.

....with a higher real complexity than the apparent complexity of the overall system. This is mainly due to the fact that parts need to be considered that can never be reached in the global context. Partial or loose specifications allow to cut off these unreachable parts (see section 4. 3) As in [ClSte90,Kr89,LaTh88,ShGr90,Wa88]) we will exploit this feature to take advantage of context information. Furthermore, we will refer to the size of the maximal transition system that is encountered by our method as the algorithmic complexity. Our method is tailored for establishing P j= OE, i.e. whether P satisfies the property ....

....a different intend. We do not want to cover divergence, i.e. the potential of an infinite internal computation, but (guarded) undefinedness. This establishes as a specification implementation relation: a partial specification p is met by an implementation q if and only if p q; in contrast to [ClSte90,Wa88] we do not require an implementation of an a undefined process to possess any a transition. This modification enhances the practicality of preorders as specification implementation relations. In fact, similar definitions of preorders already appeared in [Ste89,SI,Sti87] but have not been ....

[Article contains additional citation context not shown here]

R. Cleaveland and B. Steffen. When is "Partial" Complete? A Logic-Based Proof Technique using Partial Specifications, LICS, 1990 19

....of the state explosion problem: the state space of a distributed system potentially increases exponentially in the number of its parallel components. To overcome this problem techniques have been developed in order to avoid the construction of the complete state graph (cf. BFH90, CLM89, CR94, CS90b, DGG93, Fer88, GL93, GP93, Jos87, KM89, Kru89, LSW94, LT88, LX90, Pnu90, SG89, SG90, Val93, Wal88, Win90, WL89] In this paper we present a method for the compositional minimization of finite state distributed systems, which is practically motivated by the following observation: For the ....

....to subsystems with a higher real complexity than the apparent complexity of the overall system. This is mainly due to the fact that parts need to be considered that can never be reached in the global context. Partial or loose specifications allow us to cut off these unreachable parts. As in [CS90b, Kru89, LT88, SG90, Wal88] we will exploit this feature to take advantage of context information. Furthermore, we will refer to the size of the maximal transition system that is encountered by our method as the algorithmic complexity . Our method, called RM Method, 1 is tailored for ....

[Article contains additional citation context not shown here]

R. Cleaveland and B. Steffen. When is "partial" adequate? A logic-based proof technique using partial specifications. Proc. IEEE Symp. Logic in Computer Science, 1990.

....of the state explosion problem: the state space of a distributed system potentially increases exponentially in the number of its parallel components. To overcome this problem techniques have been developed in order to avoid the construction of the complete state graph (cf. BFH90, CLM89, CR94, CS90b, DGG93, Fer88, GL93, Jos87, KM89, Kru89, LSW94, LT88, LX90, Pel93, Pnu90, SG89, SG90, Vaa90, Val93, Wal88, Win90, WL89] In this paper we present Correspondence and offprint requests to: Gerald Luttgen. 2 S. Graf, B. Steffen, and G. Luttgen a method for the compositional minimisation of ....

....to subsystems with a higher reduced complexity than the apparent complexity of the overall system. This is mainly due to the fact that parts need to be considered that can never be reached in the global context. Partial or loose specifications allow us to cut off these unreachable parts. As in [CS90b, Kru89, LT88, SG90, Wal88] we exploit this feature to take advantage of context information. Furthermore, we refer to the size of the maximal transition system that is encountered by our method as the algorithmic complexity . Our method, called RM Method, 1 is tailored for establishing P j= ....

[Article contains additional citation context not shown here]

R. Cleaveland and B. Steffen. When is "partial" adequate? A logic-based proof technique using partial specifications. Proc. IEEE Symp. Logic in Computer Science, 1990.

No context found.

Cleaveland, R. and Steffen, B.: When is "partial" adequate? A logic-based proof technique using partial specifications. Proc. IEEE Symp. Logic in Computer Science, 1990.

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