MODEL CHECKING IS REFINEMENT - From Computation Tree Logic to Failure Trace Testing

Stefan D. Bruda, Zhiyu Zhang

Abstract

Two major systems of formal conformance testing are model checking and algebraic model-based testing. Model checking is based on some form of temporal logic. One powerful and realistic logic being used is computation tree logic (CTL), which is capable of expressing most interesting properties of processes such as liveness and safety. Model-based testing is based on some operational semantics of processes (such as traces, failures, or both) and associated preorders. The most fine-grained preorder beside bisimulation (mostly of theoretical importance) is based on failure traces. We show that these two powerful variants are equivalent, in the sense that for any CTL formula there exists a set of failure trace tests that are equivalent to it. Combined with previous results, this shows that CTL and failure trace tests are equivalent.

References

  1. Brinksma, E., Scollo, G., and Steenbergen, C. (1987). LOTOS specifications, their implementations and their tests. In IFIP 6.1 Proceedings, pages 349-360.
  2. Bruda, S. D. and Zhang, Z. (2009). Refinment is model checking: From failure trace tests to computation tree logic. In Proceedings of the 13th IASTED International Conference on Software Engineering and Applications (SEA 09), Cambridge, MA.
  3. Clarke, E. M., Grumberg, O., and Peled, D. A. (1999). Model Checking. MIT Press.
  4. Cleaveland, R. and L üttgen, G. (2000). Model checking is refinment-Relating Büchi testing and linear-time temporal logic. Technical Report 2000-14, ICASE, Langley Research Center, Hampton, VA.
  5. De Nicola, R. and Hennessy, M. C. B. (1984). Testing equivalences for processes. Theoretical Computer Science, 34:83-133.
  6. Langerak, R. (1989). A testing theory for LOTOS using deadlock detection. In Proceedings of the IFIP WG6.1 Ninth International Symposium on Protocol Specification, Testing and Verification IX, pages 87-98.
  7. Lewis, H. R. and Papadimitriou, C. H. (1998). Elements of the Theory of Computation. Prentice-Hall, 2nd edition.
  8. Schneider, S. (2000). Concurrent and Real-time Systems: The CSP Approach. John Wiley & Sons.
  9. Tretmans, J. (1996). Conformance testing with labelled transition systems: Implementation relations and test generation. Computer Networks and ISDN Systems, 29:49-79.
Download


Paper Citation


in Harvard Style

D. Bruda S. and Zhang Z. (2010). MODEL CHECKING IS REFINEMENT - From Computation Tree Logic to Failure Trace Testing . In Proceedings of the 5th International Conference on Software and Data Technologies - Volume 2: ICSOFT, ISBN 978-989-8425-23-2, pages 173-178. DOI: 10.5220/0003006801730178


in Bibtex Style

@conference{icsoft10,
author={Stefan D. Bruda and Zhiyu Zhang},
title={MODEL CHECKING IS REFINEMENT - From Computation Tree Logic to Failure Trace Testing},
booktitle={Proceedings of the 5th International Conference on Software and Data Technologies - Volume 2: ICSOFT,},
year={2010},
pages={173-178},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003006801730178},
isbn={978-989-8425-23-2},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 5th International Conference on Software and Data Technologies - Volume 2: ICSOFT,
TI - MODEL CHECKING IS REFINEMENT - From Computation Tree Logic to Failure Trace Testing
SN - 978-989-8425-23-2
AU - D. Bruda S.
AU - Zhang Z.
PY - 2010
SP - 173
EP - 178
DO - 10.5220/0003006801730178