Rance Cleaveland and James Riely. Testing-based abstractions for value-passing systems. In International Conference on Concurrency Theory, pages 417--432, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

.... to model checking data independent CSP processes and Wehrheim s work [13,14] to data abstracting CSPoz [8] a combination of CSP and Object Z) although we concentrate on CSPz [7,8] an integration of CSP and Z) The reason to use Wehrheim s approach instead of, for example, the ones proposed in [24,9], is that her approach already uses a CSP algebraic style which is very convenient for using FDR [12] Wehrheim s work can be seen as a CSP view of other approaches [24,9] Lazi s work is used on the CSP part to fix a flaw in the work of Wehrheim. This is the reason why we consider the CSP part of ....

.... CSPz [7,8] an integration of CSP and Z) The reason to use Wehrheim s approach instead of, for example, the ones proposed in [24,9] is that her approach already uses a CSP algebraic style which is very convenient for using FDR [12] Wehrheim s work can be seen as a CSP view of other approaches [24,9]. Lazi s work is used on the CSP part to fix a flaw in the work of Wehrheim. This is the reason why we consider the CSP part of a CSPz process data independent, while the Z part takes into account the data dependencies. We show that a data dependent infinite state CSPz process can be transformed ....

[Article contains additional citation context not shown here]

R.Cleaveland and J.Riely. Testing-based abstractions for value-passing systems. In J. Parrow B. Jonsson, editor, CONCUR'93, volume 836, pages 417-432. SpringerVerlag Berlin, 1994.

....to our own, is that of abstract interpretation. The technique of abstract interpretation has been used successfully for many years now for the analysis of sequential programs [55, 1] More recently, this approach has been applied to reactive systems and, in particular, labelled transition systems [9, 23, 28, 26]. The idea being that enough structure of some transition systems can sometimes be preserved after abstracting, or collecting together, certain labels. By enough structure we mean a level of structural information which still allows the property which one is interested in to be verified. The clear ....

....we mean a level of structural information which still allows the property which one is interested in to be verified. The clear benefits of this approach are that the transition models become smaller and verification becomes more feasible. This approach was followed by Cleaveland and Riely, [26], in order to verify testing equivalences in value passing languages. Abstract interpretation of value domains induce abstract transition models for processes. In some cases, if a coarse enough abstraction is used, then the transition systems can be reduced from infinite concrete systems down to ....

R. Cleaveland and J. Riely. Testing-based abstractions for value-passing systems. In B. Jonsson and J. Parrow, editors, Proceedings CONCUR 94, Uppsala, volume 836 of Lecture

....computational courses of a program. One of its main preoccupations is precisely to ensure that reasoning on a finite abstraction of a program safely approximates its infinitely many computational courses. Furthermore, abstract interpretation has been adapted to to cope with concurrent systems [10, 13] which do not necessarily terminate and has become increasingly popular as an approach to model checking [12, 35] both for large finite and for infinite state systems. Some other approaches are, e.g. behaviour abstraction [31] partial order methods [36] data independence [34] symbolic model ....

R. Cleaveland and J. Riely. Testing-based abstractions for value-passing systems. In Proceedings of CONCUR'94, LNCS 836, pages 417--432. Springer-Verlag, 1994.

....of states of the transition system by means of a suitable abstraction. Since we are particularly interested in properties of concurrent systems, like deadlock freeness or fairness, which are independent from data, the abstraction we consider is not derived as a side effect of data abstraction [6, 7, 11]. Many works can be found in the literature aiming at state reduction for systems in which the most important part is their concurrent structure: they can be roughly divided into three categories. The works in the first category (see, for example, 1, 27] that we can denote as following a ....

R. Cleaveland, J. Riely. Testing-Based Abstractions for Value-Passing Systems. In Proceedings of the Fifth International Conference on Concurrency Theory (CONCUR '94), Lecture Notes in Computer Science 836, 1994. 417-432.

....of states of the transition system by means of a suitable abstraction. Since we are particularly interested in properties of concurrent systems, like deadlock freeness or fairness, which are independent from data, the abstraction we consider is not derived as a side effect of data abstraction [6, 7, 10]. Our work is devoted to define an abstraction of the transition system corresponding to a concurrent system, preserving deadlock freeness. Given a CCS term [15] we define a reduced transition system, which has a fewer number of states than that generated by the SOS standard semantics of CCS ....

R. Cleaveland, J. Riely. Testing-Based Abstractions for Value-Passing Systems. Lecture Notes in Computer Science 836 (CONCUR'94), Springer-Verlag, 1994, pp. 417-432.

....rely on choosing some abstract data domain and abstractly interpreting the operators in the program on this domain. Another application of abstract interpretation in verification is the construction of models from real software written in a programming language [3] The work most closest to us is [2] which gives abstract interpretations for value passing CCS where the correctness checks are based on the notion of testing. However, their abstraction results are formulated within the framework of Galois connections on transition systems, the semantic models of CCS. For a designer having written ....

R. Cleaveland and J. Riely. Testing-based abstractions for value-passing systems. In B. Jonsson and J. Parrow, editors, CONCUR'94, volume 836 of Lecture Notes in Computer Science, pages 417--432, 1994.

....because 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 ....

....not explode directly, but they may explode during verification. All mentioned techniques can be accompanied by abstraction. Parallel systems may be dramatically reduced by suppressing constraints that are irrelevant for the verification of the particular property under consideration [CC77, CGL92, CR94, DGG93, LGS 92] 3 Structure of the Paper The remainder of the paper is structured as follows. Section 2 presents the basic notions, and Section 3 the reduction operators our method, the RM method, is based upon. Subsequently, Section 4 develops the RM Method for the compositional ....

R. Cleaveland and J. Riely. Testing-based abstractions for value passing systems. In Proceedings of CONCUR'94, Stockholm (Sweden), volume 836. LNCS, 1994.

....but we end with some brief pointers to some other approaches to handling data dependent processes. Standard techniques from the theory of algebraic specifications are used in [GP90] to develop a modularised algebraic approach to the process language ACP augmented with message passing while in [CR94] the theory of abstract interpretation is brought to bear on a language very similar to which we have considered. A much more practical approach, based on similar ideas, is taken in [YY91] to verifying ADA programs. Finally [CGL92] contains an instance of the use of abstraction in model checking. ....

R. Cleaveland and J. Riely. Testing-based abstractions for value-passing systems. In CONCUR'94, number 836 in Lecture Notes in Computer Science, pages 417 -- 432. Springer--Verlag, 1994. 30

....because 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 ....

....not explode directly, but they may explode during verification. All mentioned techniques can be accompanied by abstraction. Parallel systems may be dramatically reduced by suppressing constraints that are irrelevant for the verification of the particular property under consideration [CC77, CGL92, CR94, DGG93, LGS 95] 1.2. Structure of the Paper The remainder of the paper is structured as follows. Section 2 presents the basic notions, and Section 3 the reduction operators on which our method, the RM Method, is based. Subsequently, Section 4 develops the RM Method for the compositional ....

R. Cleaveland and J. Riely. Testing-based abstractions for value passing systems. In Proceedings of CONCUR'94, Stockholm (Sweden), volume 836 of LNCS, 1994.

....models of ADBMSs will have an infinite state space and, as such, are not analyzable with conventional formal verification tools. However, we will identify abstractions on the state space and its state transitions, drawing from the rich literature on model checking and abstraction (see e.g. [6, 10, 9]) and its conceptual origin in abstract interpretation [11] This will allow safe approximations of vital system behavior: the termination of rule triggering, the determinacy of precedence orders between triggered rules, or the responsiveness between rule activations (e.g. Owicki s and Lamport s ....

R. Cleaveland and J. Riely. Testing-Based Abstractions for Value-Passing Systems. In B. Jonsson and P. Parrow, editors, Proceedings of Concur'94, volume 836 of Lecture Notes in Computer Science, pages 417--432. Springer Verlag, August 1994. Uppsala, Sweden.

.... work for an interesting class of practically relevant systems [Brya86, BCMD90, EnFT91] All these techniques can be accompanied by abstraction: depending on the particular property under investigation, systems may be dramatically reduced by suppressing details that are irrelevant for verification [CoCo77, ClGL92, ClRi93, DaGG93, GrLo93]. This list of references and approaches is by far not exhaustive and still increasing. Thus we are faced with an almost unmanageable variety of approaches and algorithms asking for meta tools managing this diversity. The DaCapo environment applied to the organization of UNIX commands in [SFCM94] ....

R. Cleaveland, J. Riely: "Testing-Based Abstractions for Value Passing Systems," Proc. of CONCUR '94, Stockholm (Sweden), August 1994, LNCS N. 836, Springer Verlag.

....codings do not explode directly, but they may explode during verification. All mentioned techniques can be accompanied by abstraction. Parallel systems may be dramatically reduced by suppressing constraints that are irrelevant for the verification of the particular property under consideration [CoC77, CGL92, ClR94, DGG93, LGS95]. 1.2. Structure of the Paper The remainder of the paper is structured as follows. Section 2 presents the basic notions, and Section 3 the reduction operators on which our method, the RM Method, is based. Subsequently, Section 4 develops the RM Method for the compositional minimisation of finite ....

Cleaveland, R. and Riely, J.: Testing-based abstractions for value passing systems. In Proceedings of CONCUR'94, Stockholm (Sweden), volume 836 of LNCS, 1994.

....language will require us to extend the range of the Factory s analysis techniques from basic process algebra expressions to those with data. To this end, we are exploring how to integrate the well known technique of abstract interpretation into our equivalence and model checking algorithms [CR94] Textual Interfaces. Early feedback on the Factory indicates that some users for some applications would be happier with a textual rather than graphical user interface. To address this need, we have designed a simple language, called VPL, for concurrent processes that communicate values from a ....

R. Cleaveland and J. Riely. Testing-based abstractions for value-passing systems. In Proceedings of CONCUR '94 --- Fifth International Conference on Concurrency Theory, August 1994.

No context found.

Rance Cleaveland and James Riely. Testing-based abstractions for value-passing systems. In International Conference on Concurrency Theory, pages 417--432, 1994.

No context found.

Cleaveland, R., Riely, J.: Testing-based abstractions for value-passing systems. In: International Conference on Concurrency Theory. (1994) 417--432

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