|
|
Brunel University Research Archive (BURA) >
Browsing by Author Hierons, RM
Showing results 11 to 30 of 107
| Issue Date | Title | Author(s) | | 2010 | Canonical finite state machines for distributed systems | Hierons, RM |
| 2011 | Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas | Danicic, S; Hierons, RM; Laurence, MR |
| 2010 | Checking experiments for stream X-machines | Hierons, RM |
| 2009 | Checking sequence construction using adaptive and preset distinguishing sequences | Hierons, RM; Jourdan, GV; Ural, H; Yenigun, H |
| 2008 | Checking sequences for distributed test architectures | Hierons, RM; Ural, H |
| 2001 | Checking states and transitions of a set of communicating finite state machines | Hierons, RM |
| 2002 | Code extraction algorithms which unify slicing and concept assignment | Harman, M; Gold, N; Hierons, RM; Binkley, D |
| 2002 | Comparing test sets and criteria in the presence of test hypotheses and fault domains | Hierons, RM |
| 2000 | ConSIT: A conditioned program slicer | Danicic, S; Fox, C; Harman, M; Hierons, RM |
| 2005 | Constructing multiple unique input/output sequences using metaheuristic optimisation techniques | Guo, Q; Hierons, RM; Harman, M; Derderian, K |
| 2005 | ConSUS: a light-weight program conditioner | Danicic, S; Daoudi, M; Fox, CJ; Harman, M; Hierons, RM, et al |
| 2011 | Controllable testing from nondeterministic finite state machines with multiple ports | Hierons, RM |
| 2011 | Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas | Danicic, S; Hierons, RM; Laurence, MR |
| 2006 | The effectiveness of refactoring, based on a compatibility testing taxonomy and a dependency graph | Counsell, S; Hierons, RM; Najjar, R; Loizou, G; Hassoun, Y |
| 2008 | The effect of the distributed test architecture on the power of testing | Hierons, RM; Ural, H |
| 2010 | An empirical study of package coupling in Java open-source | Counsell, S; Hierons, RM; Mubarak, Asma |
| 2003 | Equivalence of conservative, free, linear program schemas is decidable | Laurence, MR; Danicic, S; Harman, M; Hierons, RM; Howroyd, J |
| 2007 | Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time | Danicic, S; Harman, M; Hierons, RM; Howroyd, J; Laurence, M |
| 2009 | Estimating the feasibility of transition paths in extended finite state machines | Derderian, K; Hierons, RM; Harman, M; Guo, Q |
| 2002 | Evolutionary testing supported by slicing and transformation | Harman, M; Hu, L; Hierons, RM; Fox, C; Danicic, S, et al |
Showing results 11 to 30 of 107
|
