2026-09-20T03:17:20Zhttps://bura.brunel.ac.uk/oai/request

oai:bura.brunel.ac.uk:2438/45752016-01-27T09:08:29Zcom_2438_23com_2438_58com_2438_8630com_2438_8620col_2438_3672col_2438_210col_2438_8638

Hierons, RM Swift, S Kalaji, AbdulSalam 2010-11-10T12:55:02Z 2010-11-10T12:55:02Z 2010 http://bura.brunel.ac.uk/handle/2438/4575 This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University. The extended finite state machine (EFSM) is a powerful modelling approach that has been applied to represent a wide range of systems. Despite its popularity, testing from an EFSM is a substantial problem for two main reasons: path feasibility and path test case generation. The path feasibility problem concerns generating transition paths through an EFSM that are feasible and satisfy a given test criterion. In an EFSM, guards and assignments in a path‟s transitions may cause some selected paths to be infeasible. The problem of path test case generation is to find a sequence of inputs that can exercise the transitions in a given feasible path. However, the transitions‟ guards and assignments in a given path can impose difficulties when producing such data making the range of acceptable inputs narrowed down to a possibly tiny range. While search-based approaches have proven efficient in automating aspects of testing, these have received little attention when testing from EFSMs. This thesis proposes an integrated search-based approach to automatically test from an EFSM. The proposed approach generates paths through an EFSM that are potentially feasible and satisfy a test criterion. Then, it generates test cases that can exercise the generated feasible paths. The approach is evaluated by being used to test from five EFSM cases studies. The achieved experimental results demonstrate the value of the proposed approach. Submitted by Carolyn Bailey (carolyn.bailey@brunel.ac.uk) on 2010-11-10T12:53:58Z No. of bitstreams: 1 Fulltext.pdf: 2421582 bytes, checksum: 56e372a249baa5bc4d080a255548e916 (MD5) Approved for entry into archive by Carolyn Bailey(carolyn.bailey@brunel.ac.uk) on 2010-11-10T12:55:02Z (GMT) No. of bitstreams: 1 Fulltext.pdf: 2421582 bytes, checksum: 56e372a249baa5bc4d080a255548e916 (MD5) Made available in DSpace on 2010-11-10T12:55:02Z (GMT). No. of bitstreams: 1 Fulltext.pdf: 2421582 bytes, checksum: 56e372a249baa5bc4d080a255548e916 (MD5) Aleppo University, Syria en Brunel University, School of Information Systems, Computing and Mathematics School of Information Systems, Computing and Mathematics http://bura.brunel.ac.uk/bitstream/2438/4575/1/FulltextThesis.pdf Search-based software engineering Testing from extended finite state machine (EFSM) Generating feasible transition paths (FTPs) Fitness metric Test data generation for testing from EFSMs Search-based software engineering: A search-based approach for testing from extended finite state machine (EFSM) models Thesis