Time for Mutants - Model-Based Mutation Testing with Timed Automata

Model-based testing is a popular technology for automatic and systematic test case generation (TCG), where a system-under-test (SUT) is tested for conformance with a model that specifies its intended behavior. Model-based mutation testing is a specific variant of model-based testing that is fault-oriented. In mutation testing, the test case generation is guided by a mutant, an intentionally altered version of the original model that specifies a common modeling error.

[1]  Erwin Engeler,et al.  Logic of Programs , 1981, Lecture Notes in Computer Science.

[2]  Joseph Sifakis,et al.  Iterative Methods for the Analysis of Petri Nets , 1980, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.

[3]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[4]  Edmund M. Clarke,et al.  Symbolic Model Checking: 10^20 States and Beyond , 1990, Inf. Comput..

[5]  Márcio Eduardo Delamaro,et al.  Mutation analysis testing for finite state machines , 1994, Proceedings of 1994 IEEE International Symposium on Software Reliability Engineering.

[6]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[7]  Wang Yi,et al.  Uppaal in a nutshell , 1997, International Journal on Software Tools for Technology Transfer.

[8]  Paulo César Masiero,et al.  Mutation testing applied to validate specifications based on statecharts , 1999, Proceedings 10th International Symposium on Software Reliability Engineering (Cat. No.PR00443).

[9]  Brian Nielsen,et al.  Automated Test Generation from Timed Automata , 2001, TACAS.

[10]  David Clark,et al.  Safety and Security Analysis of Object-Oriented Models , 2002, SAFECOMP.

[11]  Gilles Audemard,et al.  Bounded Model Checking for Timed Systems , 2002, FORTE.

[12]  Frank D. Valencia,et al.  Formal Methods for Components and Objects , 2002, Lecture Notes in Computer Science.

[13]  Joost-Pieter Katoen,et al.  A probabilistic extension of UML statecharts: Specification and Verification. , 2002 .

[14]  Navendu Jain,et al.  Verification of Timed Automata via Satisfiability Checking , 2002, FTRTFT.

[15]  Edmund M. Clarke,et al.  Counterexample-guided abstraction refinement , 2003, 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings..

[16]  Kim G. Larsen,et al.  T-UPPAAL: online model-based testing of real-time systems , 2004, Proceedings. 19th International Conference on Automated Software Engineering, 2004..

[17]  Ed Brinksma,et al.  A Test Generation Framework for quiescent Real-Time Systems , 2004, FATES.

[18]  A. Jefferson Offutt,et al.  Mutation-based testing criteria for timeliness , 2004, Proceedings of the 28th Annual International Computer Software and Applications Conference, 2004. COMPSAC 2004..

[19]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[20]  Brian Nielsen,et al.  Formal Approaches to Software Testing, 4th International Workshop, FATES 2004, Linz, Austria, September 21, 2004, Revised Selected Papers , 2005, FATES.

[21]  Christof J. Budnik,et al.  Basic Operations for Generating Behavioral Mutants , 2006, Second Workshop on Mutation Analysis (Mutation 2006 - ISSRE Workshops 2006).

[22]  Allan Clark,et al.  Semantic-Based Development of Service-Oriented Systems , 2006, FORTE.

[23]  Jonas Mellin,et al.  Test Case Generation for Mutation-based Testing of Timeliness , 2006, Electron. Notes Theor. Comput. Sci..

[24]  Alexandre Petrenko,et al.  Can a Model Checker Generate Tests for Non-Deterministic Systems? , 2007, MBT.

[25]  Julien Schmaltz,et al.  On Conformance Testing for Timed Systems , 2008, FORMATS.

[26]  Jirí Srba,et al.  Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets , 2008, FORMATS.

[27]  Nikolaj Bjørner,et al.  Z3: An Efficient SMT Solver , 2008, TACAS.

[28]  Jan Tretmans,et al.  Model Based Testing with Labelled Transition Systems , 2008, Formal Methods and Testing.

[29]  Marius Mikucionis,et al.  Formal Methods and Testing , 2008 .

[30]  Daniel Kroening,et al.  Mutation-Based Test Case Generation for Simulink Models , 2009, FMCO.

[31]  Stavros Tripakis,et al.  Conformance testing for real-time systems , 2009, Formal Methods Syst. Des..

[32]  Gordon Fraser,et al.  Testing with model checkers: a survey , 2009 .

[33]  Armin Biere,et al.  Bounded model checking , 2003, Adv. Comput..

[34]  Bernhard K. Aichernig,et al.  Efficient Mutation Killers in Action , 2011, 2011 Fourth IEEE International Conference on Software Testing, Verification and Validation.

[35]  Mark Harman,et al.  An Analysis and Survey of the Development of Mutation Testing , 2011, IEEE Transactions on Software Engineering.

[36]  Jan Peleska,et al.  Automated Test Case Generation with SMT-Solving and Abstract Interpretation , 2011, NASA Formal Methods.

[37]  Bernhard K. Aichernig,et al.  UML in action: a two-layered interpretation for testing , 2011, SOEN.

[38]  Daniel Kroening,et al.  Test-case generation for embedded simulink via formal concept analysis , 2011, 2011 48th ACM/EDAC/IEEE Design Automation Conference (DAC).

[39]  Wolfgang Herzner,et al.  Fault-Based Generation of Test Cases from UML-Models - Approach and Some Experiences , 2011, SAFECOMP.

[40]  Martin Lange,et al.  Exact Incremental Analysis of Timed Automata with an SMT-Solver , 2011, FORMATS.

[41]  Kim G. Larsen,et al.  Memory Efficient Data Structures for Explicit Verification of Timed Systems , 2014, NASA Formal Methods.