J. Tretmans. A formal approach to conformance testing. PhD thesis, University of Twente, Enschede, The Netherlands, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....useful in testing implementations of communication protocols. In tele and data communication field the products of different vendors must be able to cooperate, and this can achieved by conforming to a common specification. Formal conformance testing formalizes the concepts of conformance testing [16]. Essential notions include the implementation, the specification and conformance relation between these two. In this work we use ioco conformance relation [17] Previously there has been work implementing on the fly testers [4] for ioco conformance relation. These basically test whether the ....

J. Tretmans. A Formal Approach to Conformance Testing. PhD thesis, University of Twente, Enschede, The Netherlands, 1992.

....set of tests. The system to be tested obviously is a non formal object. Hence often when developing a formal testing framework some assumption that allows for regarding the system a formal object is taken. This step is traditionally referred to as the testing hypothesis. 3 3 See for instance [12, 2]. Jens Chr. Godskesen In the sequel we shall adopt the convention that the system can be considered an FSM. Taking advantage of this testing hypothesis we may formally de ne the concept of applying tests to a system. The application of a test and a test suite T respectively to M 0 with ....

J. Tretmans. A Formal Approach to Conformance Testing. PhD thesis, University of Twente, 1992.

.... of a test and a test suite respectively to M 0 with respect to some reference M is de ned by apply M (M 0 ; pass if 8 0 : M( 0 ) M 0 ( 0 ) fail otherwise apply M (M 0 ; T ) pass if 8 2 T : apply M (M 0 ; pass fail otherwise 5 See for instance [16, 4]. Jens Chr. Godskesen We say that a test suite T is sound for a fault model M M if for any 2 T there exists some M 0 2 M M such that apply M (M 0 ; fail . A test suite T is exhaustive for M M if for all M 0 2 M M , apply M (M 0 ; T ) fail . Finally, we say that a test ....

J. Tretmans. A Formal Approach to Conformance Testing. PhD thesis, University of Twente, 1992.

....inputs and outputs. In [31] Halbwachs et al. describe another synchronous testing tool, Lurette, 9 which was built to take into account numerical data, but which has no elaborated strategies for boolean data generation. Whereas our approach shares some analogies with conformance protocol testing [32], it differs in several respects. Mainly, the latter can be considered as a verification technique, equivalent to exhaustive testing under certain hypotheses: it checks equivalence of two complete specifications (the formal specification of the protocol and a model of its implementation) On the ....

J. Tretmans. A formal approach to conformance testing. PhD thesis, University of Twente, Enschede, The Netherlands, 1992. 11

....to produce a behavioral nite state machine from a computational VDM speci cation as has been explained in Section 2.4. A class of test generation approaches starts directly from such behavioral speci cations, like nite state machines [Cho78, FvBKG91, LY94] or nite labeled transition systems [dNH84, Hen88, Bri89, PF90, Tre92, Pel96, PS96] . Another class of approaches combines computational and behavioral speci cations. As we do, MacColl and Carrington are planing to develop a testing framework for interactive systems. They use a combination of Z and behavioral speci cations (the process algebras CSP and CCS) for specifying such ....

J. Tretmans. A Formal Approach to Conformance Testing. PhD thesis, Universiteit Twente, the Netherlands, December 1992.

....Lately, Jagadeesan et al. [15] have described a technique and a toolset for testing reactive software for violation of safety properties. In many ways, this approach is similar to a previous version of Lutess [20] Whereas our approach shares some analogies with conformance protocol testing [22], it differs in several respects. Mainly, the latter can be considered as a verification technique, equivalent to exhaustive testing under certain hypotheses: it checks equivalence of two complete specifications (the formal specification of the protocol and a model of its implementation) On the ....

J. Tretmans. A formal approach to conformance testing. PhD thesis, University of Twente, Enschede, The Netherlands, 1992.

.... expressed as a global property of the system composed of the implementation in parallel with the tester, but no attempt is made to describe how to obtain this verdict in an operational way (i.e. by means of an algorithm) The same model of testing as a parallel execution is refined in [Tre 91] Tre 92] to take into account individual test cases. In the classical test methods based on finite state automata [Cho 78] Nai 81] Sab 88] Vuo 89] and [Fuj 91a] no explicit modeling of the test activity is done. Conformance is assumed to be trace equivalence between automata, and the testing ....

....there can be no notion of conformance if this is not provided. The choice of an implementation relation is arbitrary. It is a convention that holds between the specifier and the tester. Examples have been given to illustrate the wide choice of potentially interesting implementation relations [Tre 92] However, we must insist on the fact that none of the three standardized FDTs provides a standard implementation relation. In this sense, and to be a bit provocative, we can say that a formal specification alone specifies nothing precise. Let us take a concrete example based on the INRES ....

J. Tretmans, A formal approach to conformance testing, Ph.D. thesis, Twente university, 1992.

....of telecommunication protocols. Currently, it is still the main validation technique used at an industrial scale, given the inherent complexity of more ambitious techniques such as formal verification. Moreover, in the case of protocols, the conformance testing was completely formalized by [23, 7, 15] and is also standardized within [12] Test cases can be automatically generated from formal specifications and tools such as tgv [11] tveda [19] testcomposer [16] autolink [22] or torx [2] concretely implement this activity. In the model based approach, test cases are usually constructed by ....

....parallel asynchronous processes communicating via queues. Conformance testing is a black box testing method, which aims at validating that the implementations of protocols conform to their specifications. Conformance testing activity is standardized in [12] and work has been done to formalize it [23]. In this context, our purpose is to generate automatically conformance test cases for telecommunication protocols. In the classification of testing architectures from [12, 21] our method is a local single layer test method with synchronous communication between the tester and the implementation ....

J. Tretmans. A Formal Approach to Conformance Testing. In 6 th International Workshop on Protocols Test Systems, number C-19 in IFIP Transactions, pages 257--276, 1994.

....concurrent and sequential OO programs, since even sequential OO programs are modelled as if objects behave concurrently. There is a rich theory for conformance testing using these models, based on the formalisms of Finite State Machines (FSM) Petrenko 93] and Labelled Transition Systems (LTS) Tretmans 93] Since they are for conformance testing, these results are completely functional. They are based on fault models where the implementation is an element of some class of formal models. Various kinds of assumptions reduce the size of the fault model. For example, using the uniformity assumption ....

Jan Tretmans, "A Formal Approach to Conformance Testing," Protocol Test Systems VI, Elsevier Science B.V., Amsterdam, The Netherlands, 1993, 257--276.

....implementations to provide the mutually supported services. Thus, conformance 4 The term specification space has been introduced in [OH86] 8 Introduction is a sufficient condition for interoperability. This report proceeds as follows: Chapter 2 introduces the necessary mathematical notation [Hen88, Tre92, Win93]. In Chapter 3 we develop a theory of protocol specifications which is fundamental for the following sections. Chapter 4 introduces a notation to specify properties of systems, i.e. a means to derive (protocol) specifications from trace sets. Subsequently, we focus on the definition of conformance ....

Jan Tretmans. A Formal Approach to Conformance Testing. PhD thesis, University of Twente, December 1992.

....outputs are immediately executed, it is also demanded that processes be receptive, i.e. that they be able to receive any message sent by the environment at any time: any process has, in a sense, hidden input actions. In those models where the communication medium is modelled explicitly [26, 5, 37], this issue is just moved from the process to the medium. Some models modify the traditional transition systems, and explicitly introduce all possible process inputs. As a result, infinitary descriptions are obtained even for simple, non recursive, processes. For example, according to [23, 24] ....

....make explicit use of external buffers in correspondence of output channels: this makes outputs non blocking and immediately executable, while preserving the ordering between different output actions. This group includes the asynchronous variants of process algebras like ACP [5] CSP [26] and LOTOS [37]. Within the same group we can place the work on actors foundation [3] Among these papers, the closest to ours is [37] where testing equivalences are studied under the assumption that observers and processes are connected through FIFO channels. A characterization of may equivalence in terms of ....

[Article contains additional citation context not shown here]

J. Tretmans. A formal approach to conformance testing. Ph.D. Thesis, University of Twente, 1992. 36

....the important issues of conformance testing is to derive useful tests for labeled transition systems (LTSs) which serve as a semantic model for various specification languages, e.g. LOTOS, CCS, and CSP. Testing theories and methods for test derivation in the LTS formalism have been developed in [3, 21, 16, 4, 7, 1, 18, 20]. In particular, a so called conf relation and canonical tester [3] became the basis for a large body of work in this area. Unfortunately, the canonical tester approach cannot be taken into account when test generation for real protocols is attempted. The canonical tester has infinite behavior ....

....Unfortunately, the canonical tester approach cannot be taken into account when test generation for real protocols is attempted. The canonical tester has infinite behavior whenever the specification describes an infinite behavior; no fault coverage is measured for the individual tests derived in [21] or n testers derived in [16] Moreover, we believe that the conf relation alone is too weak as a criterion to accept an implementation, because only the deadlocks that are implemented after the valid traces in the specification are to be checked. Since this This work was supported by the ....

[Article contains additional citation context not shown here]

J. Tretmans. A Formal Approach to Conformance Testing. Ph.D. thesis, Hengelo, The Netherlands, 1992.

....previous input. This accounts for synchronous communication between the environment and the system. Notice, however, that asynchronous communication through bounded input queues can be simulated by explicitly introducing new contexts representing the behaviour of the bounded queue in the system [Tretmans 92] Phalippou 94] The input queues must be bounded, so to assure that the corresponding FSM exists (i.e. it is really finite) Under these assumptions, when there are no live locks in the composition, we can derive the composite machine of FSMs C and Comp using, for instance, the algorithm ....

J. Tretmans, "A Formal Approach to Conformance Testing", Ph.D. Thesis, 1992.

No context found.

J. Tretmans. A formal approach to conformance testing. PhD thesis, University of Twente, Enschede, The Netherlands, 1992.

No context found.

J. Tretmans. A formal approach to conformance testing. PhD thesis, UniversityofTwente, Enschede, The Netherlands, 1992.

No context found.

J. Tretmans, A Formal Approach to Conformance Testing, PhD Thesis, University of Twente, The Netherlands, 1992.

No context found.

J. Tretmans. A formal approach to conformance testing. Ph.D. Thesis, University of Twente, 1992. 36

No context found.

J. Tretmans. A formal approach to conformance testing. PhD thesis, University of Twente, Enschede, The Netherlands, 1992.

No context found.

J. Tretmans. A formal approach to conformance testing. In O. Rafiq, ed., Sixth Int. Workshop on Protocol Test Systems, nr. C-19 in IFIP Transactions, pp. 257--276. North-Holland, 1994.

No context found.

J. Tretmans. A Formal Approach to Conformance Testing. PhD thesis, University of Twente, Enschede, The Netherlands, 1992.

No context found.

J. Tretmans. A formal approach to conformance testing. PhD thesis, UniversityofTwente, Enschede, The Netherlands, 1992.

No context found.

J.Tretmans. A formal approach to conformance testing. PhD thesis, University of Twente, Enschede, The Netherlands, 1992.

No context found.

J. Tretmans, A Formal Approach to Conformance Testing, Ph.D. Thesis, Twente University (1992)

No context found.

Tretmans, J.: A formal approach to conformance testing. In Ra q, O., ed.: International Workshop on Protocol Test Systems VI. Volume C-19 of IFIP Transactions., North-Holland (1994) 257-276

No context found.

J. Tretmans. A Formal Approach to Conformance Testing. PhD thesis, University of Twente, December 1992.

First 50 documents

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