Mutation testing from probabilistic finite state machines

Proceedings - Testing: Academic and Industrial Conference Practice and Research Techniques, TAIC PART-Mutation 2007

Volumn , Issue , 2007, Pages 141-150

  Hierons, Robert M ^a   Merayo, Mercedes G ^a  

^a BRUNEL UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONTOUR FOLLOWERS; DISTRIBUTED COMPUTER SYSTEMS; FINITE AUTOMATA; INDUSTRIAL RESEARCH; PROBABILITY; SPECIFICATIONS;

DRIVE TESTING; FINITE STATE MACHINE; FINITE-STATE MACHINES; MUTATION TESTING; OUTPUT SEQUENCES; PROBABILISTIC FINITE STATE MACHINES; STATISTICAL SAMPLING; TEST SEQUENCES; TEST SUITES;

TESTING;

EID: 48049118818     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TAICPART.2007.4344118     Document Type: Conference Paper

References (38)

1. R. Alur, C. Courcoubetis, and M. Yannakakis. Distinguishing tests for nondeterministic and probabilistic machines. In 27th ACM Symp. on Theory of Computing, STOC'95, pages 363-372. ACM Press, 1995.
2. C. Baier, M. Kwiatkowska, and G. Norman. Computing probability bounds for linear time formulas over concurrent probabilistic systems. In PROBMIV98, Electronics Notes in Theoretical Computer Science 22, 1999.
3. M. Barnett, W. Grieskamp, L. Nachmanson, W. Schulte, N. Tillmann, and M. Veanes. Towards a tool environment for model-based testing with AsmL. In 3rd Int. Workshop on Formal Approaches to Testing of Software, FATES'03, LNCS 2931, pages 252-266. Springer, 2003.
4. G. Bernot, L. Bouaziz, and P. L. Gall. A theory of probabilistic functional testing. In 19th IEEE Int. Conf. on Software Engineering, ICSE'97, pages 216-226. ACM Press, 1997.
5. L. Bottaci and E. Mresa. Efficiency of mutation operators and selective mutation strategies: An empirical study. Software Testing, Verification and Reliability, 9(4):205-232, 1999.
6. D. Carrington and P. Stocks. A tale of two paradigms: Formal methods and software testing. In Z User Workshop, pages 51-68. Springer, Workshops in Computing, 1994.
7. D. Cazorla, F. Cuartero, V. Valero, F. Pelayo, and J. Pardo. Algebraic theory of probabilistic and non-deterministic processes. Journal of Logic and Algebraic Programming, 55(1-2):57-103, 2003.
8. T. Y. Chen and Y. T. Yu. On the expected number of failures detected by subdomain testing and random testing. IEEE Transactions on Software Engineering, 4(2): 109-119, 1996.
9. T. Chow. Testing software design modelled by finite state machines. IEEE Transactions on Software Engineering, 4:178-187, 1978.
10. J.-M. Couvreur, N. Saheb, and G. Sutre. An optimal automata approach to ltl model checking of probabilistic systems. In 10th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning, LPAR '03, LNCS 2850, pages 361-375. Springer, 2003.
11. S. C. P. F. Fabbri, M. E. Delamaro, J. C. Maldonado, and P. C. Masiero. Mutation analysis testing for finite state machines. In 5th IEEE International Symposium on Software Reliability Engineering (ISSRE1994), pages 220-229, 1999.
12. S. C. P. F. Fabbri, J. C. Maldonado, P. C. Masiero, M. E. Delamaro, and W. E. Wong. Mutation testing applied to validate specifications based on petri nets. In Proceedings of the IFIP TC6 Eighth International Conference on Formal Description Techniques (FORTE 95), pages 329-337, 1995.
13. S. C. P. F. Fabbri, J. C. Maldonado, T. Sugeta, and P. C. Masiero. Mutation testing applied to validate specifications based on Statecharts. In 10th IEEE International Symposium on Software Reliability Engineering (ISSRE 1999), pages 210-219, 1999.
14. S. Fujiwara, G. Bochmann, F. Khendek, M. Amalou, and A. Ghedamsi. Test selection based on finite-state models. IEEE Transactions on Software Engineering, 17(6):591-603, 1991.
15. A. Gill. Introduction to The Theory of Finite State Machines. McGraw-Hill, 1962.
16. R. v. Glabbeek, S. Smolka, and B. Steffen. Reactive, generative and stratified models of probabilistic processes. Information and Computation, 121(1):59-80, 1995.
17. R. Hierons. Testing from a non-deterministic finite state machine using adaptive state counting. IEEE Transactions on Computers, 53(10):1330-1342, 2004.
18. R. Hierons and H. Ural. Reduced length checking sequences. IEEE Transactions on Computers, 51(9):1111-1117, 2002.
19. P. G. Hoel. Elementary Statistics. John Wiley and Sons, second edition, 1966.
20. W. Howden. Weak mutation testing and completeness of test sets. IEEE Transactions on Software Engineering, 8:371-379, 1982.
21. I. Hwang, T. Kim, S. Hong, and J. Lee. Test selection for a nondeterministic FSM. Computer Communications, 24(12):1213-1223, 2001.
22. ITU-T. Recommendation Z.500 Framework on formal methods in conformance testing. International Telecommunications Union, Geneva, Switzerland, 1997.
23. M. Kwiatkowska, G. Norman, and D. Parker. Probabilistic symbolic model checking with PRISM: A hybrid approach. International Journal of Software Tools for Technology Transfer, 6(2): 128-142, 2004.
24. K. Larsen and A. Skou. Bisimulation through probabilistic testing. Information and Computation, 94(1): 1-28, 1991.
25. D. Lee and M. Yannakakis. Principles and methods of testing finite state machines: A survey. Proceedings of the IEEE, 84(8): 1090-1123, 1996.
26. G. Luo, G. v. Bochmann, and A. Petrenko. Test selection based on communicating nondeterministic finite-state machines using a generalized Wp-method. IEEE Transactions on Software Engineering, 20(2): 149-161, 1994.
27. M. Núñez. Algebraic theory of probabilistic processes. Journal of Logic and Algebraic Programming, 56(1-2): 117-177, 2003.
28. M. Núñez and I. Rodriguez. Towards testing stochastic timed systems. In 23rd IFIP WG 6.1 Int. Conf. on Formal Methods for Networked and Distributed Systems, FORTE'03, LNCS 2767, pages 335-350. Springer, 2003.
29. A. Petrenko, N. Yevtushenko, and G. v. Bochmann. Testing deterministic implementations from their nondeterministic FSM specifications. In 9th IFIP Workshop on Testing of Communicating Systems, IWTCS'96, pages 125-140. Chapman & Hall, 1996.
30. I. Rouvellou and G. W. Hart. Inference of a probabilistic finite state machine from its output. IEEE Transactions on Systems, Manufacturing and Cybernetics, 25(3):424-437, 1995.
31. R. Segala. Testing probabilistic automata. In 7th Int. Conf. on Concurrency Theory, CONCUR'96, LNCS 1119, pages 299-314. Springer, 1996.
32. K. Sen, M. Viswanathan, and G. Agha. Statistical model checking of black-box probabilistic systems. In 16th Int. Conf. on Computer Aided Verification, CAV'04, LNCS 3114, pages 202-215. Springer, 2004.
33. T. Sugeta, J. C. Maldonado, and W. E. Wong. Mutation testing applied to validate SDL specifications. In 16th IFIP International Conerence on Testing of Communicating Systems (TestCom 2004), volume 2978 of Lecture Notes in Computer Science, pages 193-208, 2004.
34. W. Tzeng. A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM Journal on Computing, 21:216-227, 1992.
35. M. Y Vardi. Probabilistic linear-time model checking: An overview of the automata-theoretic approach. In 5th Int. AMAST Workshop on Formal Methods for Real-Time and Probabilistic Systems, ARTS'99, LNCS 1601, pages 265-276. Springer, 1999.
36. E. Vidal, F. Thollard, C. de la Higuera, F. Casacuberta, and R. Carrasco. Probabilistic finite-state machines - part 1. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(7): 1013-1025, 2005.
37. S.-H. Wu, S. Smolka, and E. Stark. Composition and behaviors of probabilistic I/O automata. Theoretical Computer Science, 176(1-2): 1-37, 1997.
38. F. Zhang and T. Y. Cheung. Optimal transfer trees and distinguishing trees for testing observable nondeterministic finitestate machines. IEEE Transactions on Software Engineering, 29(1):1-14, 2003.