 | 2010 |
|---|
| 164 |       | David Binkley,
Mark Harman,
Youssef Hassoun,
Syed Islam,
Zheng Li:
Assessing the impact of global variables on program dependence and dependence clusters.
Journal of Systems and Software 83(1): 96-107 (2010) |
| 2009 |
|---|
| 163 | | Cu D. Nguyen,
Anna Perini,
Paolo Tonella,
Simon Miles,
Mark Harman,
Michael Luck:
Evolutionary testing of autonomous software agents.
AAMAS (1) 2009: 521-528 |
| 162 | | Mark Harman,
Fayezin Islam,
Tao Xie,
Stefan Wappler:
Automated test data generation for aspect-oriented programs.
AOSD 2009: 185-196 |
| 161 |  | Connie Haoying Bao,
Nicolas Gold,
Mark Harman:
Maintaining WS-BPEL Workflows Using Aspects.
BPSC 2009: 225-226 |
| 160 | | Kelly Androutsopoulos,
David Clark,
Mark Harman,
Zheng Li,
Laurence Tratt:
Control Dependence for Extended Finite State Machines.
FASE 2009: 216-230 |
| 159 | | Stefan Gueorguiev,
Mark Harman,
Giuliano Antoniol:
Software project planning for robustness and completion time in the presence of uncertainty using multi objective search based software engineering.
GECCO 2009: 1673-1680 |
| 158 | | Mark Harman,
Jens Krinke,
Jian Ren,
Shin Yoo:
Search based data sensitivity analysis applied to requirement engineering.
GECCO 2009: 1681-1688 |
| 157 | | William B. Langdon,
Mark Harman,
Yue Jia:
Multi objective higher order mutation testing with GP.
GECCO 2009: 1945-1946 |
| 156 | | Kelly Androutsopoulos,
Nicolas Gold,
Mark Harman,
Zheng Li,
Laurence Tratt:
A theoretical and empirical study of EFSM dependence.
ICSM 2009: 287-296 |
| 155 | | Shin Yoo,
Mark Harman,
Paolo Tonella,
Angelo Susi:
Clustering test cases to achieve effective and scalable prioritisation incorporating expert knowledge.
ISSTA 2009: 201-212 |
| 154 | | David Binkley,
Mark Harman:
Identifying 'Linchpin Vertices' That Cause Large Dependence Clusters.
SCAM 2009: 89-98 |
| 153 | | Robert M. Hierons,
Kirill Bogdanov,
Jonathan P. Bowen,
Rance Cleaveland,
John Derrick,
Jeremy Dick,
Marian Gheorghe,
Mark Harman,
Kalpesh Kapoor,
Paul Krause,
Gerald Lüttgen,
Anthony J. H. Simons,
Sergiy A. Vilkomir,
Martin R. Woodward,
Hussein Zedan:
Using formal specifications to support testing.
ACM Comput. Surv. 41(2): (2009) |
| 152 | | Mark Harman,
David Binkley,
Keith Gallagher,
Nicolas Gold,
Jens Krinke:
Dependence clusters in source code.
ACM Trans. Program. Lang. Syst. 32(1): (2009) |
| 151 | | Phil McMinn,
David Binkley,
Mark Harman:
Empirical evaluation of a nesting testability transformation for evolutionary testing.
ACM Trans. Softw. Eng. Methodol. 18(3): (2009) |
| 150 | | Yue Jia,
Mark Harman:
Higher Order Mutation Testing.
Information & Software Technology 51(10): 1379-1393 (2009) |
| 149 | | Mark Harman,
Zheng Li,
Phil McMinn,
Jeff Offutt,
John A. Clark:
TAIC PART 2007 and Mutation 2007 special issue editorial.
Journal of Systems and Software 82(11): 1753-1754 (2009) |
| 148 | | Anthony Finkelstein,
Mark Harman,
S. Afshin Mansouri,
Jian Ren,
Yuanyuan Zhang:
A search based approach to fairness analysis in requirement assignments to aid negotiation, mediation and decision making.
Requir. Eng. 14(4): 231-245 (2009) |
| 2008 |
|---|
| 147 | | Robert M. Hierons,
Jonathan P. Bowen,
Mark Harman:
Formal Methods and Testing, An Outcome of the FORTEST Network, Revised Selected Papers
Springer 2008 |
| 146 | | David Binkley,
Nicolas Gold,
Mark Harman,
Zheng Li,
Kiarash Mahdavi,
Joachim Wegener:
Dependence Anti Patterns.
ASE Workshops 2008: 25-34 |
| 145 | | Mark Harman,
André Baresel,
David Binkley,
Robert M. Hierons,
Lin Hu,
Bogdan Korel,
Phil McMinn,
Marc Roper:
Testability Transformation - Program Transformation to Improve Testability.
Formal Methods and Testing 2008: 320-344 |
| 144 | | Kiran Lakhotia,
Mark Harman,
Phil McMinn:
Handling dynamic data structures in search based testing.
GECCO 2008: 1759-1766 |
| 143 | | Mark Harman,
Nadia Alshahwan:
Automated Session Data Repair for Web Application Regression Testing.
ICST 2008: 298-307 |
| 142 | | Anthony Finkelstein,
Mark Harman,
S. Afshin Mansouri,
Jian Ren,
Yuanyuan Zhang:
"Fairness Analysis" in Requirements Assignments.
RE 2008: 115-124 |
| 141 | | Yuanyuan Zhang,
Anthony Finkelstein,
Mark Harman:
Search Based Requirements Optimisation: Existing Work and Challenges.
REFSQ 2008: 88-94 |
| 140 | | David Binkley,
Nicolas Gold,
Mark Harman,
Zheng Li,
Kiarash Mahdavi:
Evaluating Key Statements Analysis.
SCAM 2008: 121-130 |
| 139 | | Yue Jia,
Mark Harman:
Constructing Subtle Faults Using Higher Order Mutation Testing.
SCAM 2008: 249-258 |
| 138 | | Tao Jiang,
Mark Harman,
Youssef Hassoun:
Analysis of Procedure Splitability.
WCRE 2008: 247-256 |
| 137 | | Walter J. Gutjahr,
Mark Harman:
Search-based software engineering.
Computers & OR 35(10): 3049-3051 (2008) |
| 136 | | Tao Jiang,
Nicolas Gold,
Mark Harman,
Zheng Li:
Locating dependence structures using search-based slicing.
Information & Software Technology 50(12): 1189-1209 (2008) |
| 135 | | Massimiliano Di Penta,
Giuliano Antoniol,
Mark Harman:
Special Issue on Search-Based Software Maintenance.
Journal of Software Maintenance 20(5): 317-319 (2008) |
| 134 | | David Binkley,
Nicolas Gold,
Mark Harman,
Zheng Li,
Kiarash Mahdavi:
An empirical study of the relationship between the concepts expressed in source code and dependence.
Journal of Systems and Software 81(12): 2287-2298 (2008) |
| 133 | | Mark Harman,
Zheng Li,
Phil McMinn:
Editorial: Testing practice and research.
Softw. Test., Verif. Reliab. 18(2): 69-70 (2008) |
| 2007 |
|---|
| 132 | | Mark Harman,
Youssef Hassoun,
Kiran Lakhotia,
Phil McMinn,
Joachim Wegener:
The impact of input domain reduction on search-based test data generation.
ESEC/SIGSOFT FSE 2007: 155-164 |
| 131 | | Mark Harman:
The Current State and Future of Search Based Software Engineering.
FOSE 2007: 342-357 |
| 130 | | Kiran Lakhotia,
Mark Harman,
Phil McMinn:
A multi-objective approach to search-based test data generation.
GECCO 2007: 1098-1105 |
| 129 | | Mark Harman,
Laurence Tratt:
Pareto optimal search based refactoring at the design level.
GECCO 2007: 1106-1113 |
| 128 | | Yuanyuan Zhang,
Mark Harman,
S. Afshin Mansouri:
The multi-objective next release problem.
GECCO 2007: 1129-1137 |
| 127 | | Mark Harman:
Search Based Software Engineering for Program Comprehension.
ICPC 2007: 3-13 |
| 126 | | Massimiliano Di Penta,
Mark Harman,
Giuliano Antoniol,
Fahim Qureshi:
The Effect of Communication Overhead on Software Maintenance Project Staffing: a Search-Based Approach.
ICSM 2007: 315-324 |
| 125 | | Shin Yoo,
Mark Harman:
Pareto efficient multi-objective test case selection.
ISSTA 2007: 140-150 |
| 124 | | Mark Harman,
Phil McMinn:
A theoretical & empirical znalysis of evolutionary testing and hill climbing for structural test data generation.
ISSTA 2007: 73-83 |
| 123 | | David Binkley,
Mark Harman,
Jens Krinke:
Empirical study of optimization techniques for massive slicing.
ACM Trans. Program. Lang. Syst. 30(1): (2007) |
| 122 | | David Binkley,
Nicolas Gold,
Mark Harman:
An empirical study of static program slice size.
ACM Trans. Softw. Eng. Methodol. 16(2): (2007) |
| 121 | | Zheng Li,
Mark Harman,
Robert M. Hierons:
Search Algorithms for Regression Test Case Prioritization.
IEEE Trans. Software Eng. 33(4): 225-237 (2007) |
| 120 | | Sebastian Danicic,
Mark Harman,
John Howroyd,
Lahcen Ouarbya:
A non-standard semantics for program slicing and dependence analysis.
J. Log. Algebr. Program. 72(2): 191-206 (2007) |
| 119 | | Qiang Guo,
Robert M. Hierons,
Mark Harman,
Karnig Derderian:
Heuristics for fault diagnosis when testing from finite state machines.
Softw. Test., Verif. Reliab. 17(1): 41-57 (2007) |
| 118 | | Sebastian Danicic,
Mark Harman,
Robert M. Hierons,
John Howroyd,
Michael R. Laurence:
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time.
Theor. Comput. Sci. 373(1-2): 1-18 (2007) |
| 2006 |
|---|
| 117 | | David Binkley,
Mark Harman,
Jens Krinke:
Beyond Program Slicing, 06.11. - 11.11.2005
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2006 |
| 116 | | Mark Harman:
Search-Based Software Engineering for Maintenance and Reengineering.
CSMR 2006: 311 |
| 115 | | Kiarash Mahdavi,
Nicolas Gold,
Zheng Li,
Mark Harman:
Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding.
Duplication, Redundancy, and Similarity in Software 2006 |
| 114 | | Mark Harman,
Alexandros Skaliotis,
Kathleen Steinhöfel,
Paul Baker:
Search--based approaches to the component selection and prioritization problem.
GECCO 2006: 1951-1952 |
| 113 | | Paul Baker,
Mark Harman,
Kathleen Steinhöfel,
Alexandros Skaliotis:
Search Based Approaches to Component Selection and Prioritization for the Next Release Problem.
ICSM 2006: 176-185 |
| 112 | | Nicolas Gold,
Mark Harman,
Zheng Li,
Kiarash Mahdavi:
Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding.
ICSM 2006: 310-319 |
| 111 | | Phil McMinn,
Mark Harman,
David Binkley,
Paolo Tonella:
The species per path approach to SearchBased test data generation.
ISSTA 2006: 13-24 |
| 110 | | Mark Harman:
Search Based Software Engineering.
International Conference on Computational Science (4) 2006: 740-747 |
| 109 | | Keith Gallagher,
David Binkley,
Mark Harman:
Stop-List Slicing.
SCAM 2006: 11-20 |
| 108 | | David Binkley,
Mark Harman,
Jens Krinke:
Characterising, Explaining, and Exploiting the Approximate Nature of Static Analysis through Animation.
SCAM 2006: 43-52 |
| 107 | | David Binkley,
Nicolas Gold,
Mark Harman,
Zheng Li,
Kiarash Mahdavi:
An Empirical Study of Executable Concept Slice Size.
WCRE 2006: 103-114 |
| 106 | | Mark Harman,
Sue Black,
Paolo Tonella:
Workshop Introduction Astrenet Aspect Analysis.
WCRE 2006: 323 |
| 105 | | Karnig Derderian,
Robert M. Hierons,
Mark Harman,
Qiang Guo:
Automated Unique Input Output Sequence Generation for Conformance Testing of FSMs.
Comput. J. 49(3): 331-344 (2006) |
| 104 | | John Derrick,
Mark Harman,
Robert M. Hierons:
Guest Editorial.
Formal Asp. Comput. 18(1): 1-2 (2006) |
| 103 | | David Binkley,
Sebastian Danicic,
Mark Harman,
John Howroyd,
Lahcen Ouarbya:
A formal relationship between program slicing and partial evaluation.
Formal Asp. Comput. 18(2): 103-119 (2006) |
| 102 | | David Binkley,
Mariano Ceccato,
Mark Harman,
Filippo Ricca,
Paolo Tonella:
Tool-Supported Refactoring of Existing Object-Oriented Code into Aspects.
IEEE Trans. Software Eng. 32(9): 698-717 (2006) |
| 101 | | Mark Harman,
Arun Lakhotia,
David Binkley:
Theory and algorithms for slicing unstructured programs.
Information & Software Technology 48(7): 549-565 (2006) |
| 100 | | Qiang Guo,
Robert M. Hierons,
Mark Harman,
Karnig Derderian:
Improving test quality using robust unique input/output circuit sequences (UIOCs).
Information & Software Technology 48(8): 696-707 (2006) |
| 99 | | Tom Dean,
Mark Harman,
Rainer Koschke,
Michael L. Van De Vanter:
Selected papers from the fourth Source Code Analysis and Manipulation (SCAM 2004) Workshop.
Journal of Systems and Software 79(9): 1217-1218 (2006) |
| 98 | | David Binkley,
Sebastian Danicic,
Tibor Gyimóthy,
Mark Harman,
Ákos Kiss,
Bogdan Korel:
A formalisation of the relationship between forms of program slicing.
Sci. Comput. Program. 62(3): 228-252 (2006) |
| 97 | | David Binkley,
Sebastian Danicic,
Tibor Gyimóthy,
Mark Harman,
Ákos Kiss,
Bogdan Korel:
Theoretical foundations of dynamic program slicing.
Theor. Comput. Sci. 360(1-3): 23-41 (2006) |
| 2005 |
|---|
| 96 | | David Binkley,
Mark Harman,
Jens Krinke:
05451 Abstracts Collection -- Beyond Program Slicing.
Beyond Program Slicing 2005 |
| 95 | | Mark Harman,
David Binkley,
Jens Krinke:
05451 Executive Summary -- Beyond Program Slicing Dagstuhl Seminar.
Beyond Program Slicing 2005 |
| 94 | | Mark Harman,
Stephen Swift,
Kiarash Mahdavi:
An empirical study of the robustness of two module clustering fitness functions.
GECCO 2005: 1029-1036 |
| 93 | | Karnig Derderian,
Robert M. Hierons,
Mark Harman,
Qiang Guo:
Generating feasible input sequences for extended finite state machines (EFSMs) using genetic algorithms.
GECCO 2005: 1081-1082 |
| 92 | | David Binkley,
Mark Harman:
Locating Dependence Clusters and Dependence Pollution.
ICSM 2005: 177-186 |
| 91 | | Giuliano Antoniol,
Massimiliano Di Penta,
Mark Harman:
Search-Based Techniques Applied to Optimization of Project Planning for a Massive Maintenance Project.
ICSM 2005: 240-249 |
| 90 | | David Binkley,
Mariano Ceccato,
Mark Harman,
Filippo Ricca,
Paolo Tonella:
Automated Refactoring of Object Oriented Code into Aspects.
ICSM 2005: 27-36 |
| 89 | | Bogdan Korel,
Luay Ho Tahat,
Mark Harman:
Test Prioritization Using System Models.
ICSM 2005: 559-568 |
| 88 | | Bogdan Korel,
Mark Harman,
S. Chung,
P. Apirukvorapinit,
R. Gupta,
Q. Zhang:
Data Dependence Based Testability Transformation in Automated Test Generation.
ISSRE 2005: 245-254 |
| 87 | | David Binkley,
Mark Harman:
Forward slices are smaller than backward slices.
SCAM 2005: 15-24 |
| 86 | | David Binkley,
Sebastian Danicic,
Tibor Gyimóthy,
Mark Harman,
Ákos Kiss,
Bogdan Korel:
Minimal Slicing and the Relationships Between Forms of Slicing.
SCAM 2005: 45-56 |
| 85 | | Deji Fatiregun,
Mark Harman,
Robert M. Hierons:
Search-Based Amorphous Slicing.
WCRE 2005: 3-12 |
| 84 | | Robert M. Hierons,
Mark Harman,
Chris Fox:
Branch-Coverage Testability Transformation for Unstructured Programs.
Comput. J. 48(4): 421-436 (2005) |
| 83 | | Sebastian Danicic,
Chris Fox,
Mark Harman,
Robert M. Hierons,
John Howroyd,
Michael R. Laurence:
Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas.
Comput. J. 48(6): 737-748 (2005) |
| 82 | | Mark Harman,
Bogdan Korel,
Panagiotis K. Linos:
Guest Editorial: Special Issue on Software Maintenance and Evolution.
IEEE Trans. Software Eng. 31(10): 801-803 (2005) |
| 81 | | Sebastian Danicic,
Mohammed Daoudi,
Chris Fox,
Mark Harman,
Robert M. Hierons,
John Howroyd,
Lahcen Ouarbya,
Martin P. Ward:
ConSUS: a light-weight program conditioner.
Journal of Systems and Software 77(3): 241-262 (2005) |
| 80 | | Nicolas E. Gold,
Mark Harman,
David Binkley,
Robert M. Hierons:
Unifying program slicing and concept assignment for higher-level executable source code extraction.
Softw., Pract. Exper. 35(10): 977-1006 (2005) |
| 2004 |
|---|
| 79 | | Kalyanmoy Deb,
Riccardo Poli,
Wolfgang Banzhaf,
Hans-Georg Beyer,
Edmund K. Burke,
Paul J. Darwen,
Dipankar Dasgupta,
Dario Floreano,
James A. Foster,
Mark Harman,
Owen Holland,
Pier Luca Lanzi,
Lee Spector,
Andrea Tettamanzi,
Dirk Thierens,
Andrew M. Tyrrell:
Genetic and Evolutionary Computation - GECCO 2004, Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings, Part I
Springer 2004 |
| 78 | | Kalyanmoy Deb,
Riccardo Poli,
Wolfgang Banzhaf,
Hans-Georg Beyer,
Edmund K. Burke,
Paul J. Darwen,
Dipankar Dasgupta,
Dario Floreano,
James A. Foster,
Mark Harman,
Owen Holland,
Pier Luca Lanzi,
Lee Spector,
Andrea Tettamanzi,
Dirk Thierens,
Andrew M. Tyrrell:
Genetic and Evolutionary Computation - GECCO 2004, Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings, Part II
Springer 2004 |
| 77 | | Konstantinos Adamopoulos,
Mark Harman,
Robert M. Hierons:
How to Overcome the Equivalent Mutant Problem and Achieve Tailored Selective Mutation Using Co-evolution.
GECCO (2) 2004: 1338-1349 |
| 76 | | Giuliano Antoniol,
Massimiliano Di Penta,
Mark Harman:
Search-Based Techniques for Optimizing Software Project Resource Allocation.
GECCO (2) 2004: 1425-1426 |
| 75 | | Karnig Derderian,
Robert M. Hierons,
Mark Harman,
Qiang Guo:
Input Sequence Generation for Testing of Communicating Finite State Machines (CFSMs).
GECCO (2) 2004: 1429-1430 |
| 74 | | Mark Harman,
Joachim Wegener:
Getting Results from Search-Based Approaches to Software Engineering.
ICSE 2004: 728-729 |
| 73 | | Giuliano Antoniol,
Massimiliano Di Penta,
Mark Harman:
A Robust Search-Based Approach to Project Management in the Presence of Abandonment, Rework, Error and Uncertainty.
IEEE METRICS 2004: 172-183 |
| 72 | | Mark Harman,
John A. Clark:
Metrics Are Fitness Functions Too.
IEEE METRICS 2004: 58-69 |
| 71 | | André Baresel,
David Binkley,
Mark Harman,
Bogdan Korel:
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach.
ISSTA 2004: 108-118 |
| 70 | | Sebastian Danicic,
Andrea De Lucia,
Mark Harman:
Building Executable Union Slices using Conditioned Slicing.
IWPC 2004: 89-99 |
| 69 | | David Binkley,
Sebastian Danicic,
Tibor Gyimóthy,
Mark Harman,
Ákos Kiss,
Lahcen Ouarbya:
Formalizing Executable Dynamic and Forward Slicing.
SCAM 2004: 43-52 |
| 68 | | Deji Fatiregun,
Mark Harman,
Robert M. Hierons:
Evolving Transformation Sequences using Genetic Algorithms.
SCAM 2004: 66-75 |
| 67 | | Mark Harman,
David Binkley,
Ranjit Singh,
Robert M. Hierons:
Amorphous Procedure Extraction.
SCAM 2004: 85-94 |
| 66 | | Lin Hu,
Mark Harman,
Robert M. Hierons,
David Binkley:
Loop Squashing Transformations for Amorphous Slicing.
WCRE 2004: 152-160 |
| 65 | | David Binkley,
Mark Harman:
A survey of empirical results on program slicing.
Advances in Computers 62: 106-179 (2004) |
| 64 | | Mark Harman,
Lin Hu,
Malcolm Munro,
Xingyuan Zhang,
David Binkley,
Sebastian Danicic,
Mohammed Daoudi,
Lahcen Ouarbya:
Syntax-Directed Amorphous Slicing.
Autom. Softw. Eng. 11(1): 27-61 (2004) |
| 63 | | Mark Harman,
Lin Hu,
Robert M. Hierons,
Joachim Wegener,
Harmen Sthamer,
André Baresel,
Marc Roper:
Testability Transformation.
IEEE Trans. Software Eng. 30(1): 3-16 (2004) |
| 62 | | David Binkley,
Mark Harman:
Analysis and Visualization of Predicate Dependence on Formal Parameters and Global Variables.
IEEE Trans. Software Eng. 30(11): 715-735 (2004) |
| 61 | | John A. Clark,
Mark Harman,
Robert M. Hierons:
Editorial: Software testing in the United Kingdom.
Softw. Test., Verif. Reliab. 14(3): 165-166 (2004) |
| 60 | | Chris Fox,
Sebastian Danicic,
Mark Harman,
Robert M. Hierons:
ConSIT: a fully automated conditioned program slicer.
Softw., Pract. Exper. 34(1): 15-46 (2004) |
| 59 | | David Binkley,
Liz Burd,
Mark Harman,
Paolo Tonella:
Introduction.
Software Quality Journal 12(4): 293-295 (2004) |
| 58 | | Robert M. Hierons,
Mark Harman:
Testing conformance of a deterministic implementation against a non-deterministic stream X-machine.
Theor. Comput. Sci. 323(1-3): 191-233 (2004) |
| 2003 |
|---|
| 57 | | Erick Cantú-Paz,
James A. Foster,
Kalyanmoy Deb,
Lawrence Davis,
Rajkumar Roy,
Una-May O'Reilly,
Hans-Georg Beyer,
Russell K. Standish,
Graham Kendall,
Stewart W. Wilson,
Mark Harman,
Joachim Wegener,
Dipankar Dasgupta,
Mitchell A. Potter,
Alan C. Schultz,
Kathryn A. Dowsland,
Natasa Jonoska,
Julian F. Miller:
Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003. Proceedings, Part I
Springer 2003 |
| 56 | | Erick Cantú-Paz,
James A. Foster,
Kalyanmoy Deb,
Lawrence Davis,
Rajkumar Roy,
Una-May O'Reilly,
Hans-Georg Beyer,
Russell K. Standish,
Graham Kendall,
Stewart W. Wilson,
Mark Harman,
Joachim Wegener,
Dipankar Dasgupta,
Mitchell A. Potter,
Alan C. Schultz,
Kathryn A. Dowsland,
Natasa Jonoska,
Julian F. Miller:
Genetic and Evolutionary Computation - GECCO 2003, Genetic and Evolutionary Computation Conference, Chicago, IL, USA, July 12-16, 2003. Proceedings, Part II
Springer 2003 |
| 55 | | Andrea De Lucia,
Mark Harman,
Robert M. Hierons,
Jens Krinke:
Unions of Slices Are Not Slices.
CSMR 2003: 363-367 |
| 54 | | Qiang Guo,
Robert M. Hierons,
Mark Harman,
Karnig Derderian:
Computing Unique Input/Output Sequences Using Genetic Algorithms.
FATES 2003: 164-177 |
| 53 | | Deji Fatiregun,
Mark Harman,
Robert M. Hierons:
Search Based Transformations.
GECCO 2003: 2511-2512 |
| 52 | | Kiarash Mahdavi,
Mark Harman,
Robert M. Hierons:
Finding Building Blocks for Software Clustering.
GECCO 2003: 2513-2514 |
| 51 | | David Binkley,
Mark Harman:
An Empirical Study of Predicate Dependence Levels and Trends.
ICSE 2003: 330-340 |
| 50 | | Kiarash Mahdavi,
Mark Harman,
Robert M. Hierons:
A Multiple Hill Climbing Approach to Software Module Clustering.
ICSM 2003: 315-324 |
| 49 | | David Binkley,
Mark Harman:
A Large-Scale Empirical Study of Forward and Backward Static Slice Size and Context Sensitivity.
ICSM 2003: 44-53 |
| 48 | | David Binkley,
Mark Harman:
Results from a Large-Scale Study of Performance Optimization Techniques for Source Code Analyses Based on Graph Reachability Algorithms.
SCAM 2003: 203- |
| 47 | | Robert M. Hierons,
Mark Harman,
Harbhajan Singh:
Automatically Generating Information from a Z Specification to Support the Classification Tree Method.
ZB 2003: 388-407 |
| 46 | | John A. Clark,
José Javier Dolado,
Mark Harman,
Robert M. Hierons,
Bryan F. Jones,
M. Lumkin,
Brian S. Mitchell,
Spiros Mancoridis,
K. Rees,
Marc Roper,
Martin J. Shepperd:
Formulating software engineering as a search problem.
IEE Proceedings - Software 150(3): 161-175 (2003) |
| 45 | | José Javier Dolado,
Mark Harman,
Mari Carmen Otero,
Lin Hu:
An Empirical Investigation of the Influence of a Type of Side Effects on Program Comprehension.
IEEE Trans. Software Eng. 29(7): 665-670 (2003) |
| 44 | | Keith Gallagher,
Mark Harman,
Sebastian Danicic:
Guaranteed inconsistency avoidance during software evolution.
Journal of Software Maintenance 15(6): 393-416 (2003) |
| 43 | | Mark Harman,
David Binkley,
Sebastian Danicic:
Amorphous program slicing.
Journal of Systems and Software 68(1): 45-64 (2003) |
| 42 | | Michael R. Laurence,
Sebastian Danicic,
Mark Harman,
Robert M. Hierons,
John Howroyd:
Equivalence of conservative, free, linear program schemas is decidable.
Theor. Comput. Sci. 290(1): 831-862 (2003) |
| 2002 |
|---|
| 41 | | Yoga Sivagurunathan,
Mark Harman,
Bala Sivagurunathan:
Slice-Based Dynamic Memory Modelling - A Case Study.
COMPSAC 2002: 351-356 |
| 40 | | Jonathan P. Bowen,
Kirill Bogdanov,
John A. Clark,
Mark Harman,
Robert M. Hierons,
Paul Krause:
FORTEST: Formal Methods and Testing.
COMPSAC 2002: 91-104 |
| 39 | | Mark Harman,
Robert M. Hierons,
Mark Proctor:
A New Representation And Crossover Operator For Search-based Optimization Of Software Modularization.
GECCO 2002: 1351-1358 |
| 38 | | Mark Harman,
Lin Hu,
Robert M. Hierons,
André Baresel,
Harmen Sthamer:
Improving Evolutionary Testing By Flag Removal.
GECCO 2002: 1359-1366 |
| 37 | | Mark Harman,
Lin Hu,
Robert M. Hierons,
Malcolm Munro,
Xingyuan Zhang,
José Javier Dolado,
Mari Carmen Otero,
Joachim Wegener:
A Post-Placement Side-Effect Removal Algorithm.
ICSM 2002: 2-11 |
| 36 | | Mark Harman,
Lin Hu,
Robert M. Hierons,
Chris Fox,
Sebastian Danicic,
Joachim Wegener,
Harmen Sthamer,
André Baresel:
Evolutionary Testing Supported by Slicing and Transformation.
ICSM 2002: 285 |
| 35 | | Mark Harman,
Lin Hu,
Malcolm Munro,
Xingyuan Zhang,
Sebastian Danicic,
Mohammed Daoudi,
Lahcen Ouarbya:
An Interprocedural Amorphous Slicer for WSL.
SCAM 2002: 105-114 |
| 34 | | Mark Harman,
Chris Fox,
Robert M. Hierons,
Lin Hu,
Sebastian Danicic,
Joachim Wegener:
VADA: A Transformation-Based System for Variable Dependence Analysis.
SCAM 2002: 55-64 |
| 33 | | Xingyuan Zhang,
Malcolm Munro,
Mark Harman,
Lin Hu:
Mechanized Operational Semantics of WSL.
SCAM 2002: 73-82 |
| 32 | | Xingyuan Zhang,
Malcolm Munro,
Mark Harman,
Lin Hu:
Weakest Precondition for General Recursive Programs Formalized in Coq.
TPHOLs 2002: 332-348 |
| 31 | | Mohammed Daoudi,
Lahcen Ouarbya,
John Howroyd,
Sebastian Danicic,
Mark Harman,
Chris Fox,
Martin P. Ward:
ConSUS: A Scalable Approach to Conditioned Slicing.
WCRE 2002: 109-118 |
| 30 | | Mark Harman,
Nicolas Gold,
Robert M. Hierons,
David Binkley:
Code Extraction Algorithms which Unify Slicing and Concept Assignment.
WCRE 2002: 11-21 |
| 29 | | Lahcen Ouarbya,
Sebastian Danicic,
Mohammed Daoudi,
Mark Harman,
Chris Fox:
A Denotational Interprocedural Program Slicer.
WCRE 2002: 181- |
| 28 | | Kiarash Mahdavi,
Mark Harman:
Book Review: Automatic Re-Engineering of Software Using Genetic Programming.
Genetic Programming and Evolvable Machines 3(2): 219-221 (2002) |
| 27 | | Mark Harman,
Malcolm Munro,
Lin Hu,
Xingyuan Zhang:
Source code analysis and manipulation.
Information & Software Technology 44(13): 717-720 (2002) |
| 26 | | Robert M. Hierons,
Mark Harman,
Chris Fox,
Lahcen Ouarbya,
Mohammed Daoudi:
Conditioned slicing supports partition testing.
Softw. Test., Verif. Reliab. 12(1): 23-28 (2002) |
| 2001 |
|---|
| 25 | | Mark Harman,
Bryan F. Jones:
SEMINAL: Software Engineering Using Metaheuristic INnovative Algorithms.
ICSE 2001: 762-763 |
| 24 | | Mark Harman,
Robert M. Hierons,
Chris Fox,
Sebastian Danicic,
John Howroyd:
Pre/Post Conditioned Slicing.
ICSM 2001: 138-147 |
| 23 | | Mark Harman,
Malcolm Munro,
Lin Hu,
Xingyuan Zhang:
Side-Effect Removal Transformation.
IWPC 2001: 310-322 |
| 22 | | Chris Fox,
Sebastian Danicic,
Mark Harman,
Robert M. Hierons:
Backward Conditioning: A New Program Specialisation Technique and Its Application to Program Comprehension.
IWPC 2001: 89-97 |
| 21 | | Mark Harman,
Robert M. Hierons,
Sebastian Danicic,
John Howroyd,
Michael R. Laurence,
Chris Fox:
Node Coarsening Calculi for Program Slicing.
WCRE 2001: 25-34 |
| 20 | | Mark Harman,
Lin Hu,
Malcolm Munro,
Xingyuan Zhang:
GUSTT: An Amorphous Slicing System which Combines Slicing and Transformation.
WCRE 2001: 271-280 |
| 19 | | Mark Harman,
Bryan F. Jones:
Search-based software engineering.
Information & Software Technology 43(14): 833-839 (2001) |
| 18 | | Mark Harman,
Bryan F. Jones:
Software engineering using metaheuristic innovative algorithms: workshop report.
Information & Software Technology 43(14): 905-907 (2001) |
| 17 | | Mark Harman:
Software Engineering.
Software Focus 2(2): 80 (2001) |
| 16 | | Mark Harman,
Robert M. Hierons:
An overview of program slicing.
Software Focus 2(3): 85-92 (2001) |
| 2000 |
|---|
| 15 | | Chris Fox,
Mark Harman,
Robert M. Hierons,
Sebastian Danicic:
ConSIT: A Conditioned Program Slicer.
ICSM 2000: 216- |
| 14 | | David Binkley,
L. Ross Raszewski,
Christopher Smith,
Mark Harman:
An Empirical Study of Amorphous Slicing as a Program Comprehension Support Tool.
IWPC 2000: 161-170 |
| 13 | | Sebastian Danicic,
Mark Harman:
Espresso: A Slicer Generator.
SAC (2) 2000: 831-839 |
| 12 | | Robert M. Hierons,
Mark Harman:
Testing Conformance to a Quasi-Non-Deterministic Stream X-Machine.
Formal Asp. Comput. 12(6): 423-442 (2000) |
| 1999 |
|---|
| 11 | | Mark Harman,
Chris Fox,
Robert M. Hierons,
David Binkley,
Sebastian Danicic:
Program Simplification as a Means of Approximating Undecidable Propositions.
IWPC 1999: 208-217 |
| 10 | | Robert M. Hierons,
Mark Harman,
Sebastian Danicic:
Using Program Slicing to Assist in the Detection of Equivalent Mutants.
Softw. Test., Verif. Reliab. 9(4): 233-262 (1999) |
| 1998 |
|---|
| 9 | | Mark Harman,
Yoga Sivagurunathan,
Sebastian Danicic:
Analysis of Dynamic Memory Access Using Amorphous Slicing.
ICSM 1998: 336- |
| 8 | | Mark Harman,
Keith Brian Gallagher:
Program slicing.
Information & Software Technology 40(11-12): 577-581 (1998) |
| 7 | | Mark Harman,
Sebastian Danicic:
A new algorithm for slicing unstructured programs.
Journal of Software Maintenance 10(6): 415-441 (1998) |
| 1997 |
|---|
| 6 | | Yoga Sivagurunathan,
Mark Harman,
Sebastian Danicic:
Slicing, I/O and the Implicit State.
AADEBUG 1997: 59-68 |
| 5 | | Mark Harman,
Sebastian Danicic:
Amorphous Program Slicing.
WPC 1997: 70-79 |
| 1996 |
|---|
| 4 | | Mark Harman,
Dan Simpson,
Sebastian Danicic:
Slicing Programs in the Presence of Errors.
Formal Asp. Comput. 8(4): 490-497 (1996) |
| 1995 |
|---|
| 3 | | Sebastian Danicic,
Mark Harman,
Yoga Sivagurunathan:
A Parallel Algorithm for Static Program Slicing.
Inf. Process. Lett. 56(6): 307-313 (1995) |
| 2 | | Mark Harman,
Sebastian Danicic:
Using Program Slicing to Simplify Testing.
Softw. Test., Verif. Reliab. 5(3): 143-162 (1995) |
| 1993 |
|---|
| 1 | | Mark Harman,
Sebastian Danicic:
Projecting Functional Models of Imperative Programs.
SIGPLAN Notices 28(11): 33-41 (1993) |
