{"id":{"repo_id":"carleton","oai_identifier":"oai:carleton.scholaris.ca:20.500.14718/41783"},"canonical_url":"https://search.dev.ndltd.org/etd/carleton/oai:carleton.scholaris.ca:20.500.14718/41783","repository":{"repo_id":"carleton","name":"Carleton University","base_url":"https://carleton.scholaris.ca/server/oai/request"},"display":{"title":"An Analysis of FSM Mutation Operators","abstract":"Mutation analysis is extensively used for the comparison of state-based testing methods that work from a finite state machine (FSM); In this thesis, we report on results from an experiment during which we compared different mutation operators used to generate FSM mutants. We randomly generated multiple synthetic FSMs and selected real-world FSMs; We created all the possible mutants from a complete set of FSM mutation operators; We generated multiple test suites using a pool of test paths; We executed all those test suites on FSM mutants while using different types of oracles, and compared mutation operators using a metric we define. Results help us identify mutation operators that lead to easy-to-reveal faults, possibly too easy to help discriminate between test suite construction techniques, as well as study the impact of various oracle strategies. We have developed a tool infrastructure called μFSM that automates the whole process of this experiment.","abstract_html":"Mutation analysis is extensively used for the comparison of state-based testing methods that work from a finite state machine (FSM); In this thesis, we report on results from an experiment during which we compared different mutation operators used to generate FSM mutants. We randomly generated multiple synthetic FSMs and selected real-world FSMs; We created all the possible mutants from a complete set of FSM mutation operators; We generated multiple test suites using a pool of test paths; We executed all those test suites on FSM mutants while using different types of oracles, and compared mutation operators using a metric we define. Results help us identify mutation operators that lead to easy-to-reveal faults, possibly too easy to help discriminate between test suite construction techniques, as well as study the impact of various oracle strategies. We have developed a tool infrastructure called μFSM that automates the whole process of this experiment.","abstract_has_math":false,"creators":["Nikbin Azmoudeh, Danial"],"institution":"Carleton University","degree_name":"Master of Applied Science (M.App.Sc.)","degree_level":"Master's","degree_discipline":"Engineering, Electrical and Computer","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2024,"date_issued":"2024","date_published":"2024","updated_at":"2026-07-24T01:34:22Z","subjects":[],"languages":["en"],"rights":["Copyright © 2024 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, distribution to students, research and scholarship. Theses may only be shared by linking to the Carleton University Institutional Repository and no part may be copied without proper attribution to the author; no part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner."],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["10.22215/etd/2024-15916"],"render_values":[{"text":"10.22215/etd/2024-15916","href":"https://doi.org/10.22215/etd/2024-15916","code":true}]}]},"links":{"outbound_url":"https://hdl.handle.net/20.500.14718/41783","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Nikbin Azmoudeh, Danial"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2025-04-08T20:25:32Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2025-04-08T20:25:32Z"]},{"key":"dc:date.issued","label":"Date","values":["2024"]},{"key":"dc:publisher","label":"Institution","values":["Carleton University"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Engineering, Electrical and Computer"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Master's"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Applied Science (M.App.Sc.)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright © 2024 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, distribution to students, research and scholarship. Theses may only be shared by linking to the Carleton University Institutional Repository and no part may be copied without proper attribution to the author; no part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.doi","label":"DOI","values":["10.22215/etd/2024-15916"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/20.500.14718/41783"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Mutation analysis is extensively used for the comparison of state-based testing methods that work from a finite state machine (FSM); In this thesis, we report on results from an experiment during which we compared different mutation operators used to generate FSM mutants. We randomly generated multiple synthetic FSMs and selected real-world FSMs; We created all the possible mutants from a complete set of FSM mutation operators; We generated multiple test suites using a pool of test paths; We executed all those test suites on FSM mutants while using different types of oracles, and compared mutation operators using a metric we define. Results help us identify mutation operators that lead to easy-to-reveal faults, possibly too easy to help discriminate between test suite construction techniques, as well as study the impact of various oracle strategies. We have developed a tool infrastructure called μFSM that automates the whole process of this experiment."]},{"key":"dc:title","label":"Title","values":["An Analysis of FSM Mutation Operators"]}]}],"canonical_facts":{"dc:creator":["Nikbin Azmoudeh, Danial"],"dc:date.accessioned":["2025-04-08T20:25:32Z"],"dc:date.available":["2025-04-08T20:25:32Z"],"dc:date.issued":["2024"],"dc:description.abstract":["Mutation analysis is extensively used for the comparison of state-based testing methods that work from a finite state machine (FSM); In this thesis, we report on results from an experiment during which we compared different mutation operators used to generate FSM mutants. We randomly generated multiple synthetic FSMs and selected real-world FSMs; We created all the possible mutants from a complete set of FSM mutation operators; We generated multiple test suites using a pool of test paths; We executed all those test suites on FSM mutants while using different types of oracles, and compared mutation operators using a metric we define. Results help us identify mutation operators that lead to easy-to-reveal faults, possibly too easy to help discriminate between test suite construction techniques, as well as study the impact of various oracle strategies. We have developed a tool infrastructure called μFSM that automates the whole process of this experiment."],"dc:identifier.doi":["10.22215/etd/2024-15916"],"dc:identifier.uri":["https://hdl.handle.net/20.500.14718/41783"],"dc:language.iso":["en"],"dc:publisher":["Carleton University"],"dc:rights":["Copyright © 2024 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, distribution to students, research and scholarship. Theses may only be shared by linking to the Carleton University Institutional Repository and no part may be copied without proper attribution to the author; no part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner."],"dc:title":["An Analysis of FSM Mutation Operators"],"dc:type":["thesis"],"thesis:degree_discipline":["Engineering, Electrical and Computer"],"thesis:degree_level":["Master's"],"thesis:degree_name":["Master of Applied Science (M.App.Sc.)"]},"updated_at":"2026-07-24T01:34:22Z"}