Sound and mechanised compositional verification of input‐output conformance. (14th May 2013)

• Record Type: Journal Article
• Authors: Sampaio, Augusto; Nogueira, Sidney; Mota, Alexandre; Isobe, Yoshinao
• Is Part Of: Software testing, verification & reliability. Volume 24:Number 4(2014:Oct.)
• Page Start: 289
• Page End: 319
• Publication Date: 2013-05-14
• Subjects: Computer software -- Testing -- Periodicals; Computer software -- Verification -- Periodicals; Computer software -- Reliability -- Periodicals; 005.14
• DOI: 10.1002/stvr.1498
• Languages: English
• ISSNs: 0960-0833

Abstract

<abstract abstract-type="main" id="stvr1498-abs-0001"> <title>SUMMARY</title> <p id="stvr1498-para-0001">This paper mechanises conformance verification in the setting of the CSP process algebra. The verification strategy is captured by a theorem stated as a process refinement expression, which can be verified by a model checker such as FDR. The conformance relation, <bold>cspio</bold>, distinguishes input and output events. The process algebraic framework of CSP is used to address compositional conformance verification by establishing compositionality properties for <bold>cspio</bold> with respect to the CSP operators. Although <bold>cspio</bold> has been defined in the standard CSP traces model, one can address quiescence situations using a special output event, in which case it is formally established that <bold>cspio</bold> is equivalent to Tretmans <bold>ioco</bold>. All the results have been mechanically proved using the CSP‐Prover. The proposed testing theory has been adopted in an industrial context involving collaboration with Motorola, on testing mobile applications. Several examples and a case study are presented to illustrate the overall approach. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>