The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mark Harman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yoga Sivagurunathan, Mark Harman, Sebastian Danicic
    Slicing, I/O and the Implicit State. [Citation Graph (0, 0)][DBLP]
    AADEBUG, 1997, pp:59-68 [Conf]
  2. Jonathan P. Bowen, Kirill Bogdanov, John A. Clark, Mark Harman, Robert M. Hierons, Paul Krause
    FORTEST: Formal Methods and Testing. [Citation Graph (0, 0)][DBLP]
    COMPSAC, 2002, pp:91-104 [Conf]
  3. Yoga Sivagurunathan, Mark Harman, Bala Sivagurunathan
    Slice-Based Dynamic Memory Modelling - A Case Study. [Citation Graph (0, 0)][DBLP]
    COMPSAC, 2002, pp:351-356 [Conf]
  4. Andrea De Lucia, Mark Harman, Robert M. Hierons, Jens Krinke
    Unions of Slices Are Not Slices. [Citation Graph (0, 0)][DBLP]
    CSMR, 2003, pp:363-367 [Conf]
  5. Mark Harman
    Search-Based Software Engineering for Maintenance and Reengineering. [Citation Graph (0, 0)][DBLP]
    CSMR, 2006, pp:311- [Conf]
  6. Qiang Guo, Robert M. Hierons, Mark Harman, Karnig Derderian
    Computing Unique Input/Output Sequences Using Genetic Algorithms. [Citation Graph (0, 0)][DBLP]
    FATES, 2003, pp:164-177 [Conf]
  7. Giuliano Antoniol, Massimiliano Di Penta, Mark Harman
    Search-Based Techniques for Optimizing Software Project Resource Allocation. [Citation Graph (0, 0)][DBLP]
    GECCO (2), 2004, pp:1425-1426 [Conf]
  8. Konstantinos Adamopoulos, Mark Harman, Robert M. Hierons
    How to Overcome the Equivalent Mutant Problem and Achieve Tailored Selective Mutation Using Co-evolution. [Citation Graph (0, 0)][DBLP]
    GECCO (2), 2004, pp:1338-1349 [Conf]
  9. Karnig Derderian, Robert M. Hierons, Mark Harman, Qiang Guo
    Input Sequence Generation for Testing of Communicating Finite State Machines (CFSMs). [Citation Graph (0, 0)][DBLP]
    GECCO (2), 2004, pp:1429-1430 [Conf]
  10. Karnig Derderian, Robert M. Hierons, Mark Harman, Qiang Guo
    Generating feasible input sequences for extended finite state machines (EFSMs) using genetic algorithms. [Citation Graph (0, 0)][DBLP]
    GECCO, 2005, pp:1081-1082 [Conf]
  11. Deji Fatiregun, Mark Harman, Robert M. Hierons
    Search Based Transformations. [Citation Graph (0, 0)][DBLP]
    GECCO, 2003, pp:2511-2512 [Conf]
  12. Mark Harman, Lin Hu, Robert M. Hierons, André Baresel, Harmen Sthamer
    Improving Evolutionary Testing By Flag Removal. [Citation Graph (0, 0)][DBLP]
    GECCO, 2002, pp:1359-1366 [Conf]
  13. Mark Harman, Robert M. Hierons, Mark Proctor
    A New Representation And Crossover Operator For Search-based Optimization Of Software Modularization. [Citation Graph (0, 0)][DBLP]
    GECCO, 2002, pp:1351-1358 [Conf]
  14. Mark Harman, Stephen Swift, Kiarash Mahdavi
    An empirical study of the robustness of two module clustering fitness functions. [Citation Graph (0, 0)][DBLP]
    GECCO, 2005, pp:1029-1036 [Conf]
  15. Mark Harman, Alexandros Skaliotis, Kathleen Steinhöfel, Paul Baker
    Search--based approaches to the component selection and prioritization problem. [Citation Graph (0, 0)][DBLP]
    GECCO, 2006, pp:1951-1952 [Conf]
  16. Kiarash Mahdavi, Mark Harman, Robert M. Hierons
    Finding Building Blocks for Software Clustering. [Citation Graph (0, 0)][DBLP]
    GECCO, 2003, pp:2513-2514 [Conf]
  17. Mark Harman
    Search Based Software Engineering. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (4), 2006, pp:740-747 [Conf]
  18. David Binkley, Mark Harman
    An Empirical Study of Predicate Dependence Levels and Trends. [Citation Graph (0, 0)][DBLP]
    ICSE, 2003, pp:330-340 [Conf]
  19. Mark Harman, Bryan F. Jones
    SEMINAL: Software Engineering Using Metaheuristic INnovative Algorithms. [Citation Graph (0, 0)][DBLP]
    ICSE, 2001, pp:762-763 [Conf]
  20. Mark Harman, Joachim Wegener
    Getting Results from Search-Based Approaches to Software Engineering. [Citation Graph (0, 0)][DBLP]
    ICSE, 2004, pp:728-729 [Conf]
  21. David Binkley, Mariano Ceccato, Mark Harman, Filippo Ricca, Paolo Tonella
    Automated Refactoring of Object Oriented Code into Aspects. [Citation Graph (0, 0)][DBLP]
    ICSM, 2005, pp:27-36 [Conf]
  22. David Binkley, Mark Harman
    A Large-Scale Empirical Study of Forward and Backward Static Slice Size and Context Sensitivity. [Citation Graph (0, 0)][DBLP]
    ICSM, 2003, pp:44-53 [Conf]
  23. David Binkley, Mark Harman
    Locating Dependence Clusters and Dependence Pollution. [Citation Graph (0, 0)][DBLP]
    ICSM, 2005, pp:177-186 [Conf]
  24. Giuliano Antoniol, Massimiliano Di Penta, Mark Harman
    Search-Based Techniques Applied to Optimization of Project Planning for a Massive Maintenance Project. [Citation Graph (0, 0)][DBLP]
    ICSM, 2005, pp:240-249 [Conf]
  25. Chris Fox, Mark Harman, Robert M. Hierons, Sebastian Danicic
    ConSIT: A Conditioned Program Slicer. [Citation Graph (0, 0)][DBLP]
    ICSM, 2000, pp:216-0 [Conf]
  26. Mark Harman, Lin Hu, Robert M. Hierons, Chris Fox, Sebastian Danicic, Joachim Wegener, Harmen Sthamer, André Baresel
    Evolutionary Testing Supported by Slicing and Transformation. [Citation Graph (0, 0)][DBLP]
    ICSM, 2002, pp:285- [Conf]
  27. Mark Harman, Robert M. Hierons, Chris Fox, Sebastian Danicic, John Howroyd
    Pre/Post Conditioned Slicing. [Citation Graph (0, 0)][DBLP]
    ICSM, 2001, pp:138-147 [Conf]
  28. 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. [Citation Graph (0, 0)][DBLP]
    ICSM, 2002, pp:2-11 [Conf]
  29. Mark Harman, Yoga Sivagurunathan, Sebastian Danicic
    Analysis of Dynamic Memory Access Using Amorphous Slicing. [Citation Graph (0, 0)][DBLP]
    ICSM, 1998, pp:336-0 [Conf]
  30. Bogdan Korel, Luay Ho Tahat, Mark Harman
    Test Prioritization Using System Models. [Citation Graph (0, 0)][DBLP]
    ICSM, 2005, pp:559-568 [Conf]
  31. Kiarash Mahdavi, Mark Harman, Robert M. Hierons
    A Multiple Hill Climbing Approach to Software Module Clustering. [Citation Graph (0, 0)][DBLP]
    ICSM, 2003, pp:315-324 [Conf]
  32. Paul Baker, Mark Harman, Kathleen Steinhöfel, Alexandros Skaliotis
    Search Based Approaches to Component Selection and Prioritization for the Next Release Problem. [Citation Graph (0, 0)][DBLP]
    ICSM, 2006, pp:176-185 [Conf]
  33. Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahdavi
    Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding. [Citation Graph (0, 0)][DBLP]
    ICSM, 2006, pp:310-319 [Conf]
  34. Bogdan Korel, Mark Harman, S. Chung, P. Apirukvorapinit, R. Gupta, Q. Zhang
    Data Dependence Based Testability Transformation in Automated Test Generation. [Citation Graph (0, 0)][DBLP]
    ISSRE, 2005, pp:245-254 [Conf]
  35. André Baresel, David Binkley, Mark Harman, Bogdan Korel
    Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach. [Citation Graph (0, 0)][DBLP]
    ISSTA, 2004, pp:108-118 [Conf]
  36. Phil McMinn, Mark Harman, David Binkley, Paolo Tonella
    The species per path approach to SearchBased test data generation. [Citation Graph (0, 0)][DBLP]
    ISSTA, 2006, pp:13-24 [Conf]
  37. Sebastian Danicic, Andrea De Lucia, Mark Harman
    Building Executable Union Slices using Conditioned Slicing. [Citation Graph (0, 0)][DBLP]
    IWPC, 2004, pp:89-99 [Conf]
  38. David Binkley, L. Ross Raszewski, Christopher Smith, Mark Harman
    An Empirical Study of Amorphous Slicing as a Program Comprehension Support Tool. [Citation Graph (0, 0)][DBLP]
    IWPC, 2000, pp:161-170 [Conf]
  39. Chris Fox, Sebastian Danicic, Mark Harman, Robert M. Hierons
    Backward Conditioning: A New Program Specialisation Technique and Its Application to Program Comprehension. [Citation Graph (0, 0)][DBLP]
    IWPC, 2001, pp:89-97 [Conf]
  40. Mark Harman, Sebastian Danicic
    Amorphous Program Slicing. [Citation Graph (0, 0)][DBLP]
    WPC, 1997, pp:70-79 [Conf]
  41. Mark Harman, Chris Fox, Robert M. Hierons, David Binkley, Sebastian Danicic
    Program Simplification as a Means of Approximating Undecidable Propositions. [Citation Graph (0, 0)][DBLP]
    IWPC, 1999, pp:208-217 [Conf]
  42. Mark Harman, Malcolm Munro, Lin Hu, Xingyuan Zhang
    Side-Effect Removal Transformation. [Citation Graph (0, 0)][DBLP]
    IWPC, 2001, pp:310-322 [Conf]
  43. Giuliano Antoniol, Massimiliano Di Penta, Mark Harman
    A Robust Search-Based Approach to Project Management in the Presence of Abandonment, Rework, Error and Uncertainty. [Citation Graph (0, 0)][DBLP]
    IEEE METRICS, 2004, pp:172-183 [Conf]
  44. Mark Harman, John A. Clark
    Metrics Are Fitness Functions Too. [Citation Graph (0, 0)][DBLP]
    IEEE METRICS, 2004, pp:58-69 [Conf]
  45. Sebastian Danicic, Mark Harman
    Espresso: A Slicer Generator. [Citation Graph (0, 0)][DBLP]
    SAC (2), 2000, pp:831-839 [Conf]
  46. David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel
    Minimal Slicing and the Relationships Between Forms of Slicing. [Citation Graph (0, 0)][DBLP]
    SCAM, 2005, pp:45-56 [Conf]
  47. David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Lahcen Ouarbya
    Formalizing Executable Dynamic and Forward Slicing. [Citation Graph (0, 0)][DBLP]
    SCAM, 2004, pp:43-52 [Conf]
  48. David Binkley, Mark Harman
    Results from a Large-Scale Study of Performance Optimization Techniques for Source Code Analyses Based on Graph Reachability Algorithms. [Citation Graph (0, 0)][DBLP]
    SCAM, 2003, pp:203-0 [Conf]
  49. David Binkley, Mark Harman
    Forward slices are smaller than backward slices. [Citation Graph (0, 0)][DBLP]
    SCAM, 2005, pp:15-24 [Conf]
  50. David Binkley, Mark Harman, Jens Krinke
    Characterising, Explaining, and Exploiting the Approximate Nature of Static Analysis through Animation. [Citation Graph (0, 0)][DBLP]
    SCAM, 2006, pp:43-52 [Conf]
  51. Deji Fatiregun, Mark Harman, Robert M. Hierons
    Evolving Transformation Sequences using Genetic Algorithms. [Citation Graph (0, 0)][DBLP]
    SCAM, 2004, pp:66-75 [Conf]
  52. Keith Gallagher, David Binkley, Mark Harman
    Stop-List Slicing. [Citation Graph (0, 0)][DBLP]
    SCAM, 2006, pp:11-20 [Conf]
  53. Mark Harman, David Binkley, Ranjit Singh, Robert M. Hierons
    Amorphous Procedure Extraction. [Citation Graph (0, 0)][DBLP]
    SCAM, 2004, pp:85-94 [Conf]
  54. Mark Harman, Chris Fox, Robert M. Hierons, Lin Hu, Sebastian Danicic, Joachim Wegener
    VADA: A Transformation-Based System for Variable Dependence Analysis. [Citation Graph (0, 0)][DBLP]
    SCAM, 2002, pp:55-64 [Conf]
  55. Mark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang, Sebastian Danicic, Mohammed Daoudi, Lahcen Ouarbya
    An Interprocedural Amorphous Slicer for WSL. [Citation Graph (0, 0)][DBLP]
    SCAM, 2002, pp:105-114 [Conf]
  56. Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
    Mechanized Operational Semantics of WSL. [Citation Graph (0, 0)][DBLP]
    SCAM, 2002, pp:73-82 [Conf]
  57. Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
    Weakest Precondition for General Recursive Programs Formalized in Coq. [Citation Graph (0, 0)][DBLP]
    TPHOLs, 2002, pp:332-348 [Conf]
  58. Mohammed Daoudi, Lahcen Ouarbya, John Howroyd, Sebastian Danicic, Mark Harman, Chris Fox, Martin P. Ward
    ConSUS: A Scalable Approach to Conditioned Slicing. [Citation Graph (0, 0)][DBLP]
    WCRE, 2002, pp:109-118 [Conf]
  59. Deji Fatiregun, Mark Harman, Robert M. Hierons
    Search-Based Amorphous Slicing. [Citation Graph (0, 0)][DBLP]
    WCRE, 2005, pp:3-12 [Conf]
  60. Mark Harman, Nicolas Gold, Robert M. Hierons, David Binkley
    Code Extraction Algorithms which Unify Slicing and Concept Assignment. [Citation Graph (0, 0)][DBLP]
    WCRE, 2002, pp:11-21 [Conf]
  61. Mark Harman, Robert M. Hierons, Sebastian Danicic, John Howroyd, Michael R. Laurence, Chris Fox
    Node Coarsening Calculi for Program Slicing. [Citation Graph (0, 0)][DBLP]
    WCRE, 2001, pp:25-34 [Conf]
  62. Mark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang
    GUSTT: An Amorphous Slicing System which Combines Slicing and Transformation. [Citation Graph (0, 0)][DBLP]
    WCRE, 2001, pp:271-280 [Conf]
  63. Lin Hu, Mark Harman, Robert M. Hierons, David Binkley
    Loop Squashing Transformations for Amorphous Slicing. [Citation Graph (0, 0)][DBLP]
    WCRE, 2004, pp:152-160 [Conf]
  64. Lahcen Ouarbya, Sebastian Danicic, Mohammed Daoudi, Mark Harman, Chris Fox
    A Denotational Interprocedural Program Slicer. [Citation Graph (0, 0)][DBLP]
    WCRE, 2002, pp:181-0 [Conf]
  65. David Binkley, Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahdavi
    An Empirical Study of Executable Concept Slice Size. [Citation Graph (0, 0)][DBLP]
    WCRE, 2006, pp:103-114 [Conf]
  66. Mark Harman, Sue Black, Paolo Tonella
    Workshop Introduction Astrenet Aspect Analysis. [Citation Graph (0, 0)][DBLP]
    WCRE, 2006, pp:323- [Conf]
  67. Robert M. Hierons, Mark Harman, Harbhajan Singh
    Automatically Generating Information from a Z Specification to Support the Classification Tree Method. [Citation Graph (0, 0)][DBLP]
    ZB, 2003, pp:388-407 [Conf]
  68. David Binkley, Mark Harman
    A survey of empirical results on program slicing. [Citation Graph (0, 0)][DBLP]
    Advances in Computers, 2004, v:62, n:, pp:106-179 [Journal]
  69. Mark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang, David Binkley, Sebastian Danicic, Mohammed Daoudi, Lahcen Ouarbya
    Syntax-Directed Amorphous Slicing. [Citation Graph (0, 0)][DBLP]
    Autom. Softw. Eng., 2004, v:11, n:1, pp:27-61 [Journal]
  70. 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. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2005, v:48, n:6, pp:737-748 [Journal]
  71. Robert M. Hierons, Mark Harman, Chris Fox
    Branch-Coverage Testability Transformation for Unstructured Programs. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2005, v:48, n:4, pp:421-436 [Journal]
  72. Karnig Derderian, Robert M. Hierons, Mark Harman, Qiang Guo
    Automated Unique Input Output Sequence Generation for Conformance Testing of FSMs. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2006, v:49, n:3, pp:331-344 [Journal]
  73. John Derrick, Mark Harman, Robert M. Hierons
    Guest Editorial. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2006, v:18, n:1, pp:1-2 [Journal]
  74. David Binkley, Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya
    A formal relationship between program slicing and partial evaluation. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2006, v:18, n:2, pp:103-119 [Journal]
  75. Mark Harman, Dan Simpson, Sebastian Danicic
    Slicing Programs in the Presence of Errors. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1996, v:8, n:4, pp:490-497 [Journal]
  76. Robert M. Hierons, Mark Harman
    Testing Conformance to a Quasi-Non-Deterministic Stream X-Machine. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 2000, v:12, n:6, pp:423-442 [Journal]
  77. Kiarash Mahdavi, Mark Harman
    Book Review: Automatic Re-Engineering of Software Using Genetic Programming. [Citation Graph (0, 0)][DBLP]
    Genetic Programming and Evolvable Machines, 2002, v:3, n:2, pp:219-221 [Journal]
  78. John A. Clark, José Javier Dolado, Mark Harman, Robert M. Hierons, B. Jones, M. Lumkin, Brian S. Mitchell, Spiros Mancoridis, K. Rees, Marc Roper, Martin J. Shepperd
    Formulating software engineering as a search problem. [Citation Graph (0, 0)][DBLP]
    IEE Proceedings - Software, 2003, v:150, n:3, pp:161-175 [Journal]
  79. Qiang Guo, Robert M. Hierons, Mark Harman, Karnig Derderian
    Improving test quality using robust unique input/output circuit sequences (UIOCs). [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 2006, v:48, n:8, pp:696-707 [Journal]
  80. Mark Harman, Bryan F. Jones
    Search-based software engineering. [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 2001, v:43, n:14, pp:833-839 [Journal]
  81. Mark Harman, Bryan F. Jones
    Software engineering using metaheuristic innovative algorithms: workshop report. [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 2001, v:43, n:14, pp:905-907 [Journal]
  82. Mark Harman, Arun Lakhotia, David Binkley
    Theory and algorithms for slicing unstructured programs. [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 2006, v:48, n:7, pp:549-565 [Journal]
  83. Mark Harman, Malcolm Munro, Lin Hu, Xingyuan Zhang
    Source code analysis and manipulation. [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 2002, v:44, n:13, pp:717-720 [Journal]
  84. Mark Harman, Keith Brian Gallagher
    Program slicing. [Citation Graph (0, 0)][DBLP]
    Information & Software Technology, 1998, v:40, n:11-12, pp:577-581 [Journal]
  85. Sebastian Danicic, Mark Harman, Yoga Sivagurunathan
    A Parallel Algorithm for Static Program Slicing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:56, n:6, pp:307-313 [Journal]
  86. Sebastian Danicic, Mohammed Daoudi, Chris Fox, Mark Harman, Robert M. Hierons, John Howroyd, Lahcen Ouarbya, Martin P. Ward
    ConSUS: a light-weight program conditioner. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 2005, v:77, n:3, pp:241-262 [Journal]
  87. Mark Harman, David Binkley, Sebastian Danicic
    Amorphous program slicing. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 2003, v:68, n:1, pp:45-64 [Journal]
  88. Tom Dean, Mark Harman, Rainer Koschke, Michael L. Van de Vanter
    Selected papers from the fourth Source Code Analysis and Manipulation (SCAM 2004) Workshop. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 2006, v:79, n:9, pp:1217-1218 [Journal]
  89. David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel
    A formalisation of the relationship between forms of program slicing. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2006, v:62, n:3, pp:228-252 [Journal]
  90. Mark Harman, Sebastian Danicic
    Projecting Functional Models of Imperative Programs. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1993, v:28, n:11, pp:33-41 [Journal]
  91. Keith Gallagher, Mark Harman, Sebastian Danicic
    Guaranteed inconsistency avoidance during software evolution. [Citation Graph (0, 0)][DBLP]
    Journal of Software Maintenance, 2003, v:15, n:6, pp:393-416 [Journal]
  92. Mark Harman, Sebastian Danicic
    A new algorithm for slicing unstructured programs. [Citation Graph (0, 0)][DBLP]
    Journal of Software Maintenance, 1998, v:10, n:6, pp:415-441 [Journal]
  93. Mark Harman
    Software Engineering. [Citation Graph (0, 0)][DBLP]
    Software Focus, 2001, v:2, n:2, pp:80- [Journal]
  94. Mark Harman, Robert M. Hierons
    An overview of program slicing. [Citation Graph (0, 0)][DBLP]
    Software Focus, 2001, v:2, n:3, pp:85-92 [Journal]
  95. Chris Fox, Sebastian Danicic, Mark Harman, Robert M. Hierons
    ConSIT: a fully automated conditioned program slicer. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2004, v:34, n:1, pp:15-46 [Journal]
  96. Nicolas E. Gold, Mark Harman, David Binkley, Robert M. Hierons
    Unifying program slicing and concept assignment for higher-level executable source code extraction. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 2005, v:35, n:10, pp:977-1006 [Journal]
  97. David Binkley, Liz Burd, Mark Harman, Paolo Tonella
    Introduction. [Citation Graph (0, 0)][DBLP]
    Software Quality Journal, 2004, v:12, n:4, pp:293-295 [Journal]
  98. Mark Harman, Sebastian Danicic
    Using Program Slicing to Simplify Testing. [Citation Graph (0, 0)][DBLP]
    Softw. Test., Verif. Reliab., 1995, v:5, n:3, pp:143-162 [Journal]
  99. Robert M. Hierons, Mark Harman, Sebastian Danicic
    Using Program Slicing to Assist in the Detection of Equivalent Mutants. [Citation Graph (0, 0)][DBLP]
    Softw. Test., Verif. Reliab., 1999, v:9, n:4, pp:233-262 [Journal]
  100. Robert M. Hierons, Mark Harman, Chris Fox, Lahcen Ouarbya, Mohammed Daoudi
    Conditioned slicing supports partition testing. [Citation Graph (0, 0)][DBLP]
    Softw. Test., Verif. Reliab., 2002, v:12, n:1, pp:23-28 [Journal]
  101. John A. Clark, Mark Harman, Robert M. Hierons
    Editorial: Software testing in the United Kingdom. [Citation Graph (0, 0)][DBLP]
    Softw. Test., Verif. Reliab., 2004, v:14, n:3, pp:165-166 [Journal]
  102. David Binkley, Sebastian Danicic, Tibor Gyimóthy, Mark Harman, Ákos Kiss, Bogdan Korel
    Theoretical foundations of dynamic program slicing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:360, n:1-3, pp:23-41 [Journal]
  103. Robert M. Hierons, Mark Harman
    Testing conformance of a deterministic implementation against a non-deterministic stream X-machine. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:323, n:1-3, pp:191-233 [Journal]
  104. Michael R. Laurence, Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd
    Equivalence of conservative, free, linear program schemas is decidable. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:1, pp:831-862 [Journal]
  105. 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. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:373, n:1-2, pp:1-18 [Journal]
  106. David Binkley, Mark Harman
    Analysis and Visualization of Predicate Dependence on Formal Parameters and Global Variables. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2004, v:30, n:11, pp:715-735 [Journal]
  107. 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. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2003, v:29, n:7, pp:665-670 [Journal]
  108. Mark Harman, Lin Hu, Robert M. Hierons, Joachim Wegener, Harmen Sthamer, André Baresel, Marc Roper
    Testability Transformation. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2004, v:30, n:1, pp:3-16 [Journal]
  109. Mark Harman, Bogdan Korel, Panagiotis K. Linos
    Guest Editorial: Special Issue on Software Maintenance and Evolution. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2005, v:31, n:10, pp:801-803 [Journal]
  110. David Binkley, Mariano Ceccato, Mark Harman, Filippo Ricca, Paolo Tonella
    Tool-Supported Refactoring of Existing Object-Oriented Code into Aspects. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2006, v:32, n:9, pp:698-717 [Journal]
  111. Zheng Li, Mark Harman, Robert M. Hierons
    Search Algorithms for Regression Test Case Prioritization. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 2007, v:33, n:4, pp:225-237 [Journal]
  112. Mark Harman, Laurence Tratt
    Pareto optimal search based refactoring at the design level. [Citation Graph (0, 0)][DBLP]
    GECCO, 2007, pp:1106-1113 [Conf]
  113. Kiran Lakhotia, Mark Harman, Phil McMinn
    A multi-objective approach to search-based test data generation. [Citation Graph (0, 0)][DBLP]
    GECCO, 2007, pp:1098-1105 [Conf]
  114. Yuanyuan Zhang, Mark Harman, S. Afshin Mansouri
    The multi-objective next release problem. [Citation Graph (0, 0)][DBLP]
    GECCO, 2007, pp:1129-1137 [Conf]
  115. Mark Harman, Phil McMinn
    A theoretical & empirical znalysis of evolutionary testing and hill climbing for structural test data generation. [Citation Graph (0, 0)][DBLP]
    ISSTA, 2007, pp:73-83 [Conf]
  116. Shin Yoo, Mark Harman
    Pareto efficient multi-objective test case selection. [Citation Graph (0, 0)][DBLP]
    ISSTA, 2007, pp:140-150 [Conf]
  117. Mark Harman
    Search Based Software Engineering for Program Comprehension. [Citation Graph (0, 0)][DBLP]
    ICPC, 2007, pp:3-13 [Conf]
  118. Mark Harman, Youssef Hassoun, Kiran Lakhotia, Phil McMinn, Joachim Wegener
    The impact of input domain reduction on search-based test data generation. [Citation Graph (0, 0)][DBLP]
    ESEC/SIGSOFT FSE, 2007, pp:155-164 [Conf]
  119. Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya
    A non-standard semantics for program slicing and dependence analysis. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:72, n:2, pp:191-206 [Journal]
  120. David Binkley, Nicolas Gold, Mark Harman
    An empirical study of static program slice size. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Softw. Eng. Methodol., 2007, v:16, n:2, pp:- [Journal]

  121. Automated test data generation for aspect-oriented programs. [Citation Graph (, )][DBLP]


  122. Evolutionary testing of autonomous software agents. [Citation Graph (, )][DBLP]


  123. Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding. [Citation Graph (, )][DBLP]


  124. 05451 Executive Summary -- Beyond Program Slicing Dagstuhl Seminar. [Citation Graph (, )][DBLP]


  125. 05451 Abstracts Collection -- Beyond Program Slicing. [Citation Graph (, )][DBLP]


  126. Control Dependence for Extended Finite State Machines. [Citation Graph (, )][DBLP]


  127. Why the Virtual Nature of Software Makes It Ideal for Search Based Optimization. [Citation Graph (, )][DBLP]


  128. Handling dynamic data structures in search based testing. [Citation Graph (, )][DBLP]


  129. Software project planning for robustness and completion time in the presence of uncertainty using multi objective search based software engineering. [Citation Graph (, )][DBLP]


  130. Multi objective higher order mutation testing with GP. [Citation Graph (, )][DBLP]


  131. Search based data sensitivity analysis applied to requirement engineering. [Citation Graph (, )][DBLP]


  132. Today/future importance analysis. [Citation Graph (, )][DBLP]


  133. The Current State and Future of Search Based Software Engineering. [Citation Graph (, )][DBLP]


  134. Automated Test Data Generation using Search Based Software Engineering. [Citation Graph (, )][DBLP]


  135. The Effect of Communication Overhead on Software Maintenance Project Staffing: a Search-Based Approach. [Citation Graph (, )][DBLP]


  136. A theoretical and empirical study of EFSM dependence. [Citation Graph (, )][DBLP]


  137. Clustering test cases to achieve effective and scalable prioritisation incorporating expert knowledge. [Citation Graph (, )][DBLP]


  138. Dependence Anti Patterns. [Citation Graph (, )][DBLP]


  139. Coherent dependence clusters. [Citation Graph (, )][DBLP]


  140. "Fairness Analysis" in Requirements Assignments. [Citation Graph (, )][DBLP]


  141. Constructing Subtle Faults Using Higher Order Mutation Testing. [Citation Graph (, )][DBLP]


  142. Evaluating Key Statements Analysis. [Citation Graph (, )][DBLP]


  143. Identifying 'Linchpin Vertices' That Cause Large Dependence Clusters. [Citation Graph (, )][DBLP]


  144. Analysis of Procedure Splitability. [Citation Graph (, )][DBLP]


  145. Search Based Requirements Optimisation: Existing Work and Challenges. [Citation Graph (, )][DBLP]


  146. Maintaining WS-BPEL Workflows Using Aspects. [Citation Graph (, )][DBLP]


  147. Testability Transformation - Program Transformation to Improve Testability. [Citation Graph (, )][DBLP]


  148. Automated Session Data Repair for Web Application Regression Testing. [Citation Graph (, )][DBLP]


  149. Automated patching techniques: the fix is in: technical perspective. [Citation Graph (, )][DBLP]


  150. Search-based software engineering. [Citation Graph (, )][DBLP]


  151. Using formal specifications to support testing. [Citation Graph (, )][DBLP]


Search in 2.241secs, Finished in 2.245secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002