Sound and mechanised compositional verification of input‐output conformance
- 14 May 2013
- journal article
- research article
- Published by Wiley in Software Testing, Verification and Reliability
- Vol. 24 (4) , 289-319
Abstract
SUMMARY: 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,cspio, distinguishes input and output events. The process algebraic framework of CSP is used to address compositional conformance verification by establishing compositionality properties forcspiowith respect to the CSP operators. Althoughcspiohas 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 thatcspiois equivalent to Tretmansioco. 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 & Sons, Ltd.Keywords
This publication has 25 references indexed in Scilit:
- A formal abstract framework for modelling and testing complex software systemsTheoretical Computer Science, 2012
- Alternating simulation and IOCOInternational Journal on Software Tools for Technology Transfer, 2011
- A decade of software model checking with SLAMCommunications of the ACM, 2011
- Conformance testing for real-time systemsFormal Methods in System Design, 2009
- Transition covering tests for systems with queuesSoftware Testing, Verification and Reliability, 2008
- A Generic Theorem Prover of CSP RefinementLecture Notes in Computer Science, 2005
- TGV: theory, principles and algorithmsInternational Journal on Software Tools for Technology Transfer, 2004
- Compositional Testing with ioco2004
- Abstraction and TestingLecture Notes in Computer Science, 1999
- A theory of fault-based testingIEEE Transactions on Software Engineering, 1990