
Brunel University Research Archive (BURA) >
Browsing by Author Hierons, RM
Showing results 28 to 47 of 114
Issue Date  Title  Author(s)  2011  Decidability of strong equivalence for subschemas of a class of linear, free, nearliberal 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 opensource  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, MR 
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 
2004  Evolving transformation sequences using genetic algorithms  Fatiregun, D; Harman, M; Hierons, RM 
2002  Expanding an extended finite state machine to aid testability  Hierons, RM; Kim, TH; Ural, H 
2010  Exploring the eradication of code smells: An empirical and theoretical perspective  Counsell, S; Hierons, RM; Hamza, H; Black, S; Durrand, M 
2008  Extending stream Xmachines to specify and test systems with timeouts  Merayo, MG; Hierons, RM; Nunez, M 
2002  FORTEST: Formal methods and testing  Bowen, JP; Bogdanov, K; Clark, JA; Harman, M; Hierons, RM, et al 
2010  Generating a checking sequence with a minimum number of reset transitions  Hierons, RM; Ural, H 
2002  Generating candidates when testing a deterministic implementation against a nondeterministic finitestate machine  Hierons, RM 
2008  Generating feasible transition paths for testing from an extended finite state machine (EFSM)  Kalaji, AS; Hierons, RM; Swift, S 
2010  Generating feasible transition paths for testing from an extended finite state machine (EFSM) with the counter problem  Kalaji, AS; Hierons, RM; Swift, S 
2007  Heuristics for fault diagnosing when testing from finite state machines  Guo, Q; Hierons, RM; Harman, M; Derderian, K 
2008  High capacity steganographic method based upon JPEG  AlMohammad, A; Hierons, RM; Ghinea, G 
2012  Implementation relations and test generation for systems with distributed interfaces  Hierons, RM; Merayo, MG; Núñez, M 
Showing results 28 to 47 of 114
