{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/33760"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/33760","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Search-based Software Testing driven by Domain Knowledge","abstract":"Cyber-Physical Systems (CPS) are found in all industrial sectors and are a common part of everyday life. But when a CPS is a safety-critical system, a software failure can have costly consequences, both in terms of human lives, economic losses, and environmental impact. For this reason, it’s essential to test CPS models thoroughly before deployment in the real world. This task is complex since CPS include both physical and software components, the number of possible test scenarios is often immense (or even infinite), and these models’ behaviour evolves over time. Search-based Software Testing (SBST) has been shown to be an effective approach to test CPS models, but its effectiveness depends on the computational budget. Given the sheer size of the search space and the computational cost of each simulation, it’s pivotal to develop SBST strategies that can find failure-revealing test cases with limited resources. This thesis argues in favour of applying an engineer’s Domain Knowledge as a component of SBST to assist with the search process. This thesis presents six main contributions: (i) it presents ATheNA, an SBST framework that combines automatically-generated and manually-defined fitness functions, (ii) it introduces Hecate, an SBST framework that supports Simulink Test Blocks and allows the engineer to reuse manually-defined test cases, (iii) it proposes an SBST approach that targets tabular requirements, (iv) it defines a search-based framework for identifying which parts of a trace and a requirement are responsible for its violation, (v) it describes a framework for the automated repair of CPS requirements, driven by a search algorithm and a set of desirability dimensions, and (vi) discusses previous results and identifies new directions. Each of these contributions is evaluated empirically on large datasets and shows how the use of Domain Knowledge can produce more effective and efficient results than existing State-of-the-Art approaches.","abstract_html":"Cyber-Physical Systems (CPS) are found in all industrial sectors and are a common part of everyday life. But when a CPS is a safety-critical system, a software failure can have costly consequences, both in terms of human lives, economic losses, and environmental impact. For this reason, it’s essential to test CPS models thoroughly before deployment in the real world. This task is complex since CPS include both physical and software components, the number of possible test scenarios is often immense (or even infinite), and these models’ behaviour evolves over time. Search-based Software Testing (SBST) has been shown to be an effective approach to test CPS models, but its effectiveness depends on the computational budget. Given the sheer size of the search space and the computational cost of each simulation, it’s pivotal to develop SBST strategies that can find failure-revealing test cases with limited resources. This thesis argues in favour of applying an engineer’s Domain Knowledge as a component of SBST to assist with the search process. This thesis presents six main contributions: (i) it presents ATheNA, an SBST framework that combines automatically-generated and manually-defined fitness functions, (ii) it introduces Hecate, an SBST framework that supports Simulink Test Blocks and allows the engineer to reuse manually-defined test cases, (iii) it proposes an SBST approach that targets tabular requirements, (iv) it defines a search-based framework for identifying which parts of a trace and a requirement are responsible for its violation, (v) it describes a framework for the automated repair of CPS requirements, driven by a search algorithm and a set of desirability dimensions, and (vi) discusses previous results and identifies new directions. Each of these contributions is evaluated empirically on large datasets and shows how the use of Domain Knowledge can produce more effective and efficient results than existing State-of-the-Art approaches.","abstract_has_math":false,"creators":["Formica, Federico"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computing and Software","school":null,"contributors":[],"advisors":["Lawford, Mark","Menghi, Claudio"],"committee_chairs":[],"committee_members":[],"year":2026,"date_issued":"2026","date_published":"2026","updated_at":"2026-11-18T19:36:25Z","subjects":["Testing","Domain Knowledge","Search-based Software Engineering","Cyber-Physical Systems"],"languages":["en"],"rights":["Attribution 4.0 International"],"rights_urls":["http://creativecommons.org/licenses/by/4.0/"],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/25530"],"render_values":[{"text":"https://doi.org/10.71548/25530","href":"https://doi.org/10.71548/25530","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/11375/33760","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/11375/33760","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F33760","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Lawford, Mark","Menghi, Claudio"]},{"key":"dc:contributor.department","label":"Department","values":["Computing and Software"]},{"key":"dc:creator","label":"Author","values":["Formica, Federico"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2026-10-13T19:04:03Z"]},{"key":"dc:date.issued","label":"Date","values":["2026"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Testing","Domain Knowledge","Search-based Software Engineering","Cyber-Physical Systems"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution 4.0 International"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://creativecommons.org/licenses/by/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/11375/33760","https://doi.org/10.71548/25530"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Cyber-Physical Systems (CPS) are found in all industrial sectors and are a common part of everyday life. But when a CPS is a safety-critical system, a software failure can have costly consequences, both in terms of human lives, economic losses, and environmental impact. For this reason, it’s essential to test CPS models thoroughly before deployment in the real world. This task is complex since CPS include both physical and software components, the number of possible test scenarios is often immense (or even infinite), and these models’ behaviour evolves over time. Search-based Software Testing (SBST) has been shown to be an effective approach to test CPS models, but its effectiveness depends on the computational budget. Given the sheer size of the search space and the computational cost of each simulation, it’s pivotal to develop SBST strategies that can find failure-revealing test cases with limited resources. This thesis argues in favour of applying an engineer’s Domain Knowledge as a component of SBST to assist with the search process. This thesis presents six main contributions: (i) it presents ATheNA, an SBST framework that combines automatically-generated and manually-defined fitness functions, (ii) it introduces Hecate, an SBST framework that supports Simulink Test Blocks and allows the engineer to reuse manually-defined test cases, (iii) it proposes an SBST approach that targets tabular requirements, (iv) it defines a search-based framework for identifying which parts of a trace and a requirement are responsible for its violation, (v) it describes a framework for the automated repair of CPS requirements, driven by a search algorithm and a set of desirability dimensions, and (vi) discusses previous results and identifies new directions. Each of these contributions is evaluated empirically on large datasets and shows how the use of Domain Knowledge can produce more effective and efficient results than existing State-of-the-Art approaches."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Doctor of Philosophy (PhD)"]},{"key":"dc:title","label":"Title","values":["Search-based Software Testing driven by Domain Knowledge"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Lawford, Mark","Menghi, Claudio"],"dc:contributor.department":["Computing and Software"],"dc:creator":["Formica, Federico"],"dc:date.accessioned":["2026-10-13T19:04:03Z"],"dc:date.issued":["2026"],"dc:description.abstract":["Cyber-Physical Systems (CPS) are found in all industrial sectors and are a common part of everyday life. But when a CPS is a safety-critical system, a software failure can have costly consequences, both in terms of human lives, economic losses, and environmental impact. For this reason, it’s essential to test CPS models thoroughly before deployment in the real world. This task is complex since CPS include both physical and software components, the number of possible test scenarios is often immense (or even infinite), and these models’ behaviour evolves over time. Search-based Software Testing (SBST) has been shown to be an effective approach to test CPS models, but its effectiveness depends on the computational budget. Given the sheer size of the search space and the computational cost of each simulation, it’s pivotal to develop SBST strategies that can find failure-revealing test cases with limited resources. This thesis argues in favour of applying an engineer’s Domain Knowledge as a component of SBST to assist with the search process. This thesis presents six main contributions: (i) it presents ATheNA, an SBST framework that combines automatically-generated and manually-defined fitness functions, (ii) it introduces Hecate, an SBST framework that supports Simulink Test Blocks and allows the engineer to reuse manually-defined test cases, (iii) it proposes an SBST approach that targets tabular requirements, (iv) it defines a search-based framework for identifying which parts of a trace and a requirement are responsible for its violation, (v) it describes a framework for the automated repair of CPS requirements, driven by a search algorithm and a set of desirability dimensions, and (vi) discusses previous results and identifies new directions. Each of these contributions is evaluated empirically on large datasets and shows how the use of Domain Knowledge can produce more effective and efficient results than existing State-of-the-Art approaches."],"dc:description.degree":["Doctor of Philosophy (PhD)"],"dc:identifier.uri":["https://hdl.handle.net/11375/33760","https://doi.org/10.71548/25530"],"dc:language.iso":["en"],"dc:rights":["Attribution 4.0 International"],"dc:rights.uri":["http://creativecommons.org/licenses/by/4.0/"],"dc:subject":["Testing","Domain Knowledge","Search-based Software Engineering","Cyber-Physical Systems"],"dc:title":["Search-based Software Testing driven by Domain Knowledge"],"dc:type":["Thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:36:25Z"}