Collection's Items (Sorted by Submit Date in Descending order): 1 to 50 of 104
| Issue Date | Title | Author(s) |
| 2011 | New ideas and emerging research: evaluating prediction system accuracy | Shepperd, M |
| 2011 | Group project work from the outset: an in-depth teaching experience report | Shepperd, M |
| 2010 | Reaching and distinguishing states of distributed systems | Hierons, RM |
| 2008 | Testing in the distributed test architecture: An extended abstract | Hierons, RM |
| 2009 | Checking sequence construction using adaptive and preset distinguishing sequences | Hierons, RM; Jourdan, GV; Ural, H; Yenigun, H |
| 2009 | Simulation relations for systems with distributed interfaces | Hierons, RM; Nunez, M |
| 2009 | Mutation testing from probabilistic and stochastic finite state machines | Hierons, RM; Merayo, MG |
| 2010 | The impact of varying memory region number on RTSJ execution time | Hamza, H |
| 2009 | Testing timed systems modeled by stream X-machines | Merayo, MG; Núñez, M; Hierons, RM |
| 2009 | Estimating the feasibility of transition paths in extended finite state machines | Derderian, K; Hierons, RM; Harman, M; Guo, Q |
| 2010 | A trajectory-based strict semantics for program slicing | Barraclough, RW; Binkley, D; Danicic, S; Harman, M; Hierons, RM; Kiss, A; Laurence, MR; Ouarbya, L |
| 2010 | Canonical finite state machines for distributed systems | Hierons, RM |
| 2010 | Generating a checking sequence with a minimum number of reset transitions | Hierons, RM; Ural, H |
| 2009 | A search-based approach for automatic test generation from 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 |
| 2009 | How reliable are systematic reviews in empirical software engineering? | MacDonell, SG; Shepperd, MJ; Kitchenham, BA; Mendes, E |
| 2009 | A literature review of expert problem solving using analogy | Mair, C; Martincova, M; Shepperd, MJ |
| 2008 | Extending stream X-machines to specify and test systems with timeouts | Merayo, MG; Hierons, RM; Nunez, M |
| 2008 | The precursor to an industrial software metrics program | Parkinson, ST; Counsell, S; Norman, M; Hierons, RM; Lycett, M |
| 2007 | Mutation testing from probabilistic finite state machines | Hierons, RM; Merayo, MG |
| 2007 | A thread-tag based semantics for sequence diagrams | Dan, H; Hierons, RM; Counsell, S |
| 2007 | A meta-analysis approach to refactoring and XP | Counsell, S; Hierons, RM; Loizou, G |
| 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 |
| 2005 | Search-based amorphous slicing | Fatiregun, D; Harman, M; Hierons, RM |
| 2004 | Loop squashing transformations for amorphous slicing | Hu, L; Harman, M; Hierons, RM; Binkley, D |
| 2004 | Evolving transformation sequences using genetic algorithms | Fatiregun, D; Harman, M; Hierons, RM |
| 2004 | Amorphous procedure extraction | Harman, M; Binkley, D; Singh, R; Hierons, RM |
| 2003 | A multiple hill climbing approach to software module clustering | Mahdavi, K; Harman, M; Hierons, RM |
| 2003 | Unions of slices are not slices | De Lucia, A; Harman, M; Hierons, RM; Krinke, J |
| 2002 | A post-placement side-effect removal algorithm | Harman, M; Hu, L; Hierons, RM; Munro, M; Zhang, X; Dolado, JJ; Otero, MC; Wegener, J |
| 2002 | VADA: A transformation-based system for variable dependence analysis | Harman, M; Fox, C; Hierons, RM; Hu, L; Danicic, S; Wegener, J |
| 2002 | Evolutionary testing supported by slicing and transformation | Harman, M; Hu, L; Hierons, RM; Fox, C; Danicic, S; Wegener, J; Sthamer, H; Baresel, A |
| 2002 | Expanding an extended finite state machine to aid testability | Hierons, RM; Kim, TH; Ural, H |
| 2002 | FORTEST: Formal methods and testing | Bowen, JP; Bogdanov, K; Clark, JA; Harman, M; Hierons, RM; Krause, P |
| 2002 | Code extraction algorithms which unify slicing and concept assignment | Harman, M; Gold, N; Hierons, RM; Binkley, D |
| 2001 | Node coarsening calculi for program slicing | Harman, M; Hierons, RM; Danicic, S; Howroyd, J; Laurence, MR; Fox, C |
| 2001 | Pre/post conditioned slicing | Harman, M; Hierons, RM; Fox, C; Danicic, S; Howroyd, J |
| 2001 | Backward conditioning: A new program specialisation technique and its application to program comprehension | Fox, C; Harman, M; Hierons, RM; Danicic, S |
| 2000 | ConSIT: A conditioned program slicer | Danicic, S; Fox, C; Harman, M; Hierons, RM |
| 1999 | Program simplification as a means of approximating undecidable propositions | Harman, M; Fox, C; Hierons, RM; Binkley, D; Danicic, S |
| 2009 | Towards a mood sensitive integrated development environment to enhance the performance of programmers | Khan, Iftikhar Ahmed |
| 2008 | Can k-NN imputation improve the performance of C4.5 with small software project data sets? A comparative evaluation | Song, Q; Shepperd, MJ; Chen, X; Liu, J |
| 2007 | Heuristics for fault diagnosing when testing from finite state machines | Guo, Q; Hierons, RM; Harman, M; Derderian, K |
| 2006 | Improving fault coverage and minimising the cost of fault identification when testing from finite state machines | Guo, Qiang |
| 2006 | Automated test sequence generation for finite state machines using genetic algorithms | Derderian, Karnig Agop |
| 2003 | Case-based reasoning and software engineering | Shepperd, M J |
| 2009 | A testability transformation approach for state-based programs | Kalaji, AS; Hierons, RM; Swift, S |
| 2008 | Using status messages in the distributed test architecture | Hierons, RM |
| 2009 | Overcoming controllability problems with fewest channels between testers | Hierons, RM; Ural, H |
| 2008 | Generating feasible transition paths for testing from an extended finite state machine (EFSM) | Kalaji, AS; Hierons, RM; Swift, S |
Collection's Items (Sorted by Submit Date in Descending order): 1 to 50 of 104
