BibSLEIGH — Mark

Travelled to:

1 × Austria
1 × Brazil
1 × Croatia
1 × Cyprus
1 × India
1 × Ireland
1 × Norway
1 × Romania
1 × Russia
1 × Spain
1 × Sweden
10 × Canada
16 × USA
2 × Belgium
2 × China
2 × France
2 × Switzerland
3 × Hungary
3 × The Netherlands
3 × United Kingdom
4 × Germany
7 × Italy

Collaborated with:

D.Binkley S.Danicic R.M.Hierons Y.Jia N.Alshahwan J.Krinke ∅ S.Yoo C.Fox L.Hu P.Tonella N.Gold Y.Zhang J.Wegener Z.Li F.Sarro P.McMinn M.Munro X.Zhang W.B.Langdon K.Mahdavi S.S.Islam J.Petke K.Lakhotia K.Androutsopoulos Y.Hassoun M.Papadakis Y.L.Traon B.Korel D.Fatiregun L.Ouarbya K.Mao M.D.Penta G.Antoniol A.D.Lucia D.Clark A.Finkelstein J.Howroyd M.B.Cohen T.Gyimóthy Á.Kiss B.F.Jones M.Daoudi J.Ren T.E.J.Vos E.T.Barr L.Tratt A.Marchetto N.E.Gold X.Yao W.Weimer T.Jiang K.Gallagher L.H.Tahat Y.Sivagurunathan W.J.Martin Y.J.0001 W.Prasetya C.Henard M.G.Epitropakis E.K.Burke P.R.Mateo M.Polo T.Wang F.Ferrucci Y.Yang M.Li N.Tillmann J.d.Halleux A.Susi F.Qureshi P.Baker K.Steinhöfel A.Skaliotis R.Singh Q.Guo K.Derderian L.R.Raszewski C.Smith A.Marginean W.Martin Y.Brun P.T.Devanbu H.Dan R.Tiella S.A.Mansouri M.Ceccato F.Ricca M.Paixão D.Han C.Ragkhitwetsagul Y.Zhang D.R.White A.Arcuri J.A.Clark D.C.Nguyen M.R.Laurence D.W.Binkley M.Jimenez R.Rwemalika P.M.Kruse A.Bagnato O.Shehory A.I.Baars E.Puoskari Y.Nir-Buchbinder K.Lano M.P.Ward Y.Yang Y.Zhou B.Xu H.Sthamer A.Baresel J.J.Dolado M.C.Otero

Talks about:

slice (28) test (26) base (21) search (20) softwar (17) program (15) use (12) analysi (11) empir (10) depend (9)

♂ Person: Mark Harman

DBLP: Harman:Mark

Facilitated 18 volumes:

PrCo

ExpertReviewPa

PrBoard

PrCo

PrCo

PrCo

PrCo

PrCo

ExpertReviewPa

PrBoard

PrCo

PrCh

GCh

PrCh

Contributed to:

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2006

2005

2004

2003

2002

2001

2000

1999

1998

1997

2016

2017

2019

Wrote 104 papers:

ICSE-v1-2015-HenardPHT #configuration management #constraints #multi #product line #scalability #theorem proving: Combining Multi-Objective Search and Constraint Solving for Configuring Large Software Product Lines (CH, MP, MH, YLT), pp. 517–528.
ICSE-v1-2015-JiaCHP #combinator #generative #interactive #learning #testing #using: Learning Combinatorial Interaction Test Generation Strategies Using Hyperheuristic Search (YJ, MBC, MH, JP), pp. 540–550.
ICSE-v1-2015-PapadakisJHT #compilation #detection #effectiveness #empirical #equivalence #performance #scalability: Trivial Compiler Equivalence: A Large Scale Empirical Study of a Simple, Fast and Effective Equivalent Mutant Detection Technique (MP, YJ, MH, YLT), pp. 936–946.
ICST-2015-HarmanJZ #challenge #problem #testing: Achievements, Open Problems and Challenges for Search Based Software Testing (MH, YJ, YZ), pp. 1–12.
ISSTA-2015-BarrHJMP #automation: Automated software transplantation (ETB, MH, YJ, AM, JP), pp. 257–269.
ISSTA-2015-EpitropakisYHB #empirical #evaluation #multi #performance #testing: Empirical evaluation of pareto efficient multi-objective regression test case prioritisation (MGE, SY, MH, EKB), pp. 234–245.
MSR-2015-MartinHJSZ #mining #problem: The App Sampling Problem for App Store Mining (WM, MH, YJ, FS, YZ), pp. 123–133.
SCAM-2015-BinkleyGHIKY #slicing: ORBS and the limits of static slicing (DB, NEG, MH, SSI, JK, SY), pp. 1–10.
ASE-2014-HarmanJMP #effectiveness #empirical #higher-order #performance: Angels and monsters: an empirical investigation of potential test effectiveness and efficiency improvement from strongly subsuming higher order mutation (MH, YJ, PRM, MP), pp. 397–408.
CSMR-WCRE-2014-VosTPKBHS #automation #internet #named #process #testing: FITTEST: A new continuous and automated testing process for future Internet applications (TEJV, PT, WP, PMK, AB, MH, OS), pp. 407–410.
FSE-2014-BarrBDHS: The plastic surgery hypothesis (ETB, YB, PTD, MH, FS), pp. 306–317.
FSE-2014-BinkleyGHIKY #independence #named #slicing: ORBS: language-independent program slicing (DB, NG, MH, SSI, JK, SY), pp. 109–120.
ICSE-2014-AndroutsopoulosCDHH #analysis #fault #testing: An analysis of the relationship between conditional entropy and failed error propagation in software testing (KA, DC, HD, RMH, MH), pp. 573–583.
ICSE-2014-YaoHJ #analysis #case study #equivalence #using: A study of equivalent and stubborn mutation operators using human analysis of equivalence (XY, MH, YJ), pp. 919–930.
ISSTA-2014-AlshahwanH #detection #fault #testing: Coverage and fault detection of the output-uniqueness test selection criteria (NA, MH), pp. 181–192.
SPLC-2014-HarmanJKLPZ #overview #product line #re-engineering: Search based software engineering for software product line engineering: a survey and directions for future work (MH, YJ, JK, WBL, JP, YZ), pp. 5–18.
ESEC-FSE-2013-PetkeYCH #combinator #detection #fault #interactive #performance #testing: Efficiency and early fault detection with lower and higher strength combinatorial interaction testing (JP, SY, MBC, MH), pp. 26–36.
ESEC-FSE-2013-WangHJK #approach #evaluation: Searching for better configurations: a rigorous approach to clone evaluation (TW, MH, YJ, JK), pp. 455–465.
ICSE-2013-FerrucciHRS #multi #re-engineering: Not going to take this anymore: multi-objective overtime planning for software engineering projects (FF, MH, JR, FS), pp. 462–471.
ICSE-2013-MaoYLH #development: Pricing crowdsourcing-based software development tasks (KM, YY, ML, MH), pp. 1205–1208.
WCRE-2013-HarmanLW #programming #reverse engineering #search-based: Genetic programming for Reverse Engineering (MH, WBL, WW), pp. 1–10.
ASE-2012-HarmanLJWAC #challenge #programming #search-based #source code #using: The GISMOE challenge: constructing the pareto program surface using genetic programming to find better programs (MH, WBL, YJ, DRW, AA, JAC), pp. 1–14.
ICSE-2012-AlshahwanH #effectiveness #testing: Augmenting test suites effectiveness by increasing output diversity (NA, MH), pp. 1345–1348.
ICST-2012-AlshahwanHMTT #metric #web: Crawlability Metrics for Web Applications (NA, MH, AM, RT, PT), pp. 151–160.
ICST-2012-TonellaMNJLH #approximate #execution #modelling: Finding the Optimal Balance between Over and Under Approximation of Models Inferred from Execution Logs (PT, AM, DCN, YJ, KL, MH), pp. 21–30.
ISSTA-2012-AlshahwanH #detection #fault #testing #web: State aware test case regeneration for improving web application test suite coverage and fault detection (NA, MH), pp. 45–55.
MSR-2012-HarmanJZ #analysis #mining: App store mining and analysis: MSR for app stores (MH, YJ, YZ), pp. 108–111.
ASE-2011-AlshahwanH #automation #re-engineering #testing #using #web: Automated web application testing using search based software engineering (NA, MH), pp. 3–12.
ASE-2011-BaarsHHLMTV #search-based #testing: Symbolic search-based testing (AIB, MH, YH, KL, PM, PT, TEJV), pp. 53–62.
CSMR-2011-VosTWHPPN #internet #testing: Future Internet Testing with FITTEST (TEJV, PT, JW, MH, WP, EP, YNB), pp. 355–358.
ESEC-FSE-2011-HarmanJL #generative #higher-order #testing: Strong higher order mutation-based test data generation (MH, YJ, WBL), pp. 212–222.
ICSE-2011-AndroutsopoulosBCGHLL #modelling #strict: Model projection: simplifying models in response to restricting the environment (KA, DB, DC, NG, MH, KL, ZL), pp. 291–300.
FASE-2010-Harman #optimisation #why: Why the Virtual Nature of Software Makes It Ideal for Search Based Optimization (MH), pp. 1–12.
ICTSS-2010-LakhotiaTHH #constraints #execution #float #named #search-based #symbolic computation #theorem proving: FloPSy — Search-Based Floating Point Constraint Solving for Symbolic Execution (KL, NT, MH, JdH), pp. 142–157.
PASTE-2010-IslamKBH #clustering #dependence: Coherent dependence clusters (SSI, JK, DB, MH), pp. 53–60.
SCAM-2010-Harman #analysis #source code #why: Why Source Code Analysis and Manipulation Will Always be Important (MH), pp. 7–19.
FASE-2009-AndroutsopoulosCHLT #dependence #finite #state machine: Control Dependence for Extended Finite State Machines (KA, DC, MH, ZL, LT), pp. 216–230.
ICSM-2009-AndroutsopoulosGHLT #dependence #empirical: A theoretical and empirical study of EFSM dependence (KA, NG, MH, ZL, LT), pp. 287–296.
ISSTA-2009-YooHTS #clustering #effectiveness #scalability #testing: Clustering test cases to achieve effective and scalable prioritisation incorporating expert knowledge (SY, MH, PT, AS), pp. 201–212.
SCAM-2009-BinkleyH #clustering #dependence #identification #scalability: Identifying “Linchpin Vertices” That Cause Large Dependence Clusters (DB, MH), pp. 89–98.
ICST-2008-HarmanA #automation #program repair #testing #web: Automated Session Data Repair for Web Application Regression Testing (MH, NA), pp. 298–307.
RE-2008-FinkelsteinHMRZ #analysis #requirements: “Fairness Analysis” in Requirements Assignments (AF, MH, SAM, JR, YZ), pp. 115–124.
REFSQ-2008-ZhangFH #challenge #optimisation #requirements: Search Based Requirements Optimisation: Existing Work and Challenges (YZ, AF, MH), pp. 88–94.
SCAM-2008-BinkleyGHLM #analysis: Evaluating Key Statements Analysis (DB, NG, MH, ZL, KM), pp. 121–130.
SCAM-2008-JiaH #fault #higher-order #mutation testing #testing #using: Constructing Subtle Faults Using Higher Order Mutation Testing (YJ, MH), pp. 249–258.
WCRE-2008-JiangHH #analysis: Analysis of Procedure Splitability (TJ, MH, YH), pp. 247–256.
ESEC-FSE-2007-HarmanHLMW #generative #reduction #search-based #testing: The impact of input domain reduction on search-based test data generation (MH, YH, KL, PM, JW), pp. 155–164.
ICPC-2007-Harman #comprehension #re-engineering: Search Based Software Engineering for Program Comprehension (MH), pp. 3–13.
ICSM-2007-PentaHAQ #approach #communication #maintenance #search-based: The Effect of Communication Overhead on Software Maintenance Project Staffing: a Search-Based Approach (MDP, MH, GA, FQ), pp. 315–324.
ISSTA-2007-HarmanM #empirical #generative #testing: A theoretical & empirical znalysis of evolutionary testing and hill climbing for structural test data generation (MH, PM), pp. 73–83.
ISSTA-2007-YooH #multi #performance #testing: Pareto efficient multi-objective test case selection (SY, MH), pp. 140–150.
CSMR-2006-Harman #maintenance #re-engineering #search-based: Search-Based Software Engineering for Maintenance and Reengineering (MH), p. 311.
ICSM-2006-BakerHSS #component #problem: Search Based Approaches to Component Selection and Prioritization for the Next Release Problem (PB, MH, KS, AS), pp. 176–185.
ICSM-2006-GoldHLM #approach #bound #concept #source code #using: Allowing Overlapping Boundaries in Source Code using a Search Based Approach to Concept Binding (NG, MH, ZL, KM), pp. 310–319.
ISSTA-2006-McMinnHBT #approach #generative #testing: The species per path approach to SearchBased test data generation (PM, MH, DB, PT), pp. 13–24.
SCAM-2006-BinkleyHK #animation #approximate #static analysis: Characterising, Explaining, and Exploiting the Approximate Nature of Static Analysis through Animation (DB, MH, JK), pp. 43–52.
SCAM-2006-GallagherBH #slicing: Stop-List Slicing (KG, DB, MH), pp. 11–20.
WCRE-2006-BinkleyGHLM #concept #empirical #execution #slicing: An Empirical Study of Executable Concept Slice Size (DB, NG, MH, ZL, KM), pp. 103–114.
ICSM-2005-AntoniolPH #maintenance #optimisation #search-based: Search-Based Techniques Applied to Optimization of Project Planning for a Massive Maintenance Project (GA, MDP, MH), pp. 240–249.
ICSM-2005-BinkleyCHRT #aspect-oriented #automation #object-oriented #refactoring: Automated Refactoring of Object Oriented Code into Aspects (DB, MC, MH, FR, PT), pp. 27–36.
ICSM-2005-BinkleyH #clustering #dependence: Locating Dependence Clusters and Dependence Pollution (DB, MH), pp. 177–186.
ICSM-2005-KorelTH #modelling #using: Test Prioritization Using System Models (BK, LHT, MH), pp. 559–568.
SCAM-2005-BinkleyDGHKK #slicing: Minimal Slicing and the Relationships Between Forms of Slicing (DB, SD, TG, MH, ÁK, BK), pp. 45–56.
SCAM-2005-BinkleyH #slicing: Forward slices are smaller than backward slices (DB, MH), pp. 15–24.
SCAM-J-2005-BinkleyDGHKK06 #formal method #slicing: A formalisation of the relationship between forms of program slicing (DB, SD, TG, MH, ÁK, BK), pp. 228–252.
WCRE-2005-FatiregunHH #search-based #slicing: Search-Based Amorphous Slicing (DF, MH, RMH), pp. 3–12.
ICSE-2004-HarmanW #re-engineering #search-based: Getting Results from Search-Based Approaches to Software Engineering (MH, JW), pp. 728–729.
IWPC-2004-DanicicLH #execution #slicing #using: Building Executable Union Slices using Conditioned Slicing (SD, ADL, MH), pp. 89–99.
SCAM-2004-BinkleyDGHKO #execution #formal method #slicing: Formalizing Executable Dynamic and Forward Slicing (DB, SD, TG, MH, ÁK, LO), pp. 43–52.
SCAM-2004-FatiregunHH #algorithm #evolution #search-based #sequence #using: Evolving Transformation Sequences using Genetic Algorithms (DF, MH, RMH), pp. 66–75.
SCAM-2004-HarmanBSH: Amorphous Procedure Extraction (MH, DB, RS, RMH), pp. 85–94.
WCRE-2004-HuHHB #slicing: Loop Squashing Transformations for Amorphous Slicing (LH, MH, RMH, DB), pp. 152–160.
CSMR-2003-LuciaHHK #slicing: Unions of Slices Are Not Slices (ADL, MH, RMH, JK), pp. 363–367.
FATES-2003-GuoHHD #algorithm #search-based #sequence #using: Computing Unique Input/Output Sequences Using Genetic Algorithms (QG, RMH, MH, KD), pp. 164–177.
ICSE-2003-BinkleyH #dependence #empirical #roadmap: An Empirical Study of Predicate Dependence Levels and Trends (DB, MH), pp. 330–340.
ICSM-2003-BinkleyH #context-sensitive grammar #empirical #scalability #slicing: A Large-Scale Empirical Study of Forward and Backward Static Slice Size and Context Sensitivity (DB, MH), pp. 44–53.
ICSM-2003-MahdaviHH #approach #clustering #multi: A Multiple Hill Climbing Approach to Software Module Clustering (KM, MH, RMH), pp. 315–324.
SCAM-2003-BinkleyH #algorithm #analysis #graph #optimisation #performance #reachability #scalability #source code: Results from a Large-Scale Study of Performance Optimization Techniques for Source Code Analyses Based on Graph Reachability Algorithms (DB, MH), p. 203–?.
ICSM-2002-HarmanHHFDWSB #slicing #testing: Evolutionary Testing Supported by Slicing and Transformation (MH, LH, RMH, CF, SD, JW, HS, AB), p. 285.
ICSM-2002-HarmanHHMZDOW #algorithm: A Post-Placement Side-Effect Removal Algorithm (MH, LH, RMH, MM, XZ, JJD, MCO, JW), pp. 2–11.
SCAM-2002-HarmanFHHDW #analysis #dependence #named: VADA: A Transformation-Based System for Variable Dependence Analysis (MH, CF, RMH, LH, SD, JW), pp. 55–64.
SCAM-2002-HarmanHMZDDO #interprocedural #slicing: An Interprocedural Amorphous Slicer for WSL (MH, LH, MM, XZ, SD, MD, LO), pp. 105–114.
SCAM-2002-ZhangMHH #semantics: Mechanized Operational Semantics of WSL (XZ, MM, MH, LH), pp. 73–82.
WCRE-2002-DaoudiOHDHFW #approach #named #scalability #slicing: ConSUS: A Scalable Approach to Conditioned Slicing (MD, LO, JH, SD, MH, CF, MPW), pp. 109–118.
WCRE-2002-HarmanGHB #algorithm #concept #slicing: Code Extraction Algorithms which Unify Slicing and Concept Assignment (MH, NG, RMH, DB), pp. 11–21.
WCRE-2002-OuarbyaDDHF #interprocedural #slicing: A Denotational Interprocedural Program Slicer (LO, SD, MD, MH, CF), p. 181–?.
ICSE-2001-HarmanJ #algorithm #metaheuristic #named #re-engineering #using: SEMINAL: Software Engineering Using Metaheuristic INnovative Algorithms (MH, BFJ), pp. 762–763.
ICSM-2001-HarmanHFDH #slicing: Pre/Post Conditioned Slicing (MH, RMH, CF, SD, JH), pp. 138–147.
IWPC-2001-FoxDHH #comprehension: Backward Conditioning: A New Program Specialisation Technique and Its Application to Program Comprehension (CF, SD, MH, RMH), pp. 89–97.
IWPC-2001-HarmanMHZ: Side-Effect Removal Transformation (MH, MM, LH, XZ), pp. 310–319.
WCRE-2001-HarmanHDHLF #calculus #slicing: Node Coarsening Calculi for Program Slicing (MH, RMH, SD, JH, MRL, CF), pp. 25–34.
WCRE-2001-HarmanHMZ #named #slicing: GUSTT: An Amorphous Slicing System which Combines Slicing and Transformation (MH, LH, MM, XZ), pp. 271–280.
ICSM-2000-FoxHHD #named #slicing: ConSIT: A Conditioned Program Slicer (CF, MH, RMH, SD), p. 216–?.
IWPC-2000-BinkleyRSH #comprehension #empirical #slicing: An Empirical Study of Amorphous Slicing as a Program Comprehension Support Tool (DB, LRR, CS, MH), pp. 161–170.
SAC-2000-DanicicH #generative #named #slicing: Espresso: A Slicer Generator (SD, MH), pp. 831–839.
IWPC-1999-HarmanFHBD #approximate #decidability: Program Simplification as a Means of Approximating Undecidable Propositions (MH, CF, RMH, DB, SD), pp. 208–217.
ICSM-1998-HarmanSD #analysis #memory management #slicing #using: Analysis of Dynamic Memory Access Using Amorphous Slicing (MH, YS, SD), p. 336–?.
WPC-1997-HarmanD #slicing: Amorphous Program Slicing (MH, SD), pp. 70–79.
ASE-2016-YangHKIBZX #clustering #dependence #empirical #predict: An empirical study on dependence clusters for effort-aware fault-proneness prediction (YY, MH, JK, SSI, DB, YZ, BX), pp. 296–307.
FSE-2016-MartinSH #game studies #impact analysis: Causal impact analysis for app releases in google play (WJM, FS, MH), pp. 435–446.
ASE-2017-MaoHJ #automation #mobile #testing: Crowd intelligence enhances automated mobile testing (KM, MH, YJ0), pp. 16–26.
ASE-2017-PaixaoKHRH #architecture #developer #question: Are developers aware of the architectural impact of their changes? (MP, JK, DH, CR, MH), pp. 95–105.
ESEC-FSE-2017-GoldBHIKY #modelling #slicing: Generalized observational slicing for tree-represented modelling languages (NEG, DWB, MH, SSI, JK, SY), pp. 547–558.
ESEC-FSE-2019-JimenezRPSTH #predict: The importance of accounting for real-world labelling when predicting software vulnerabilities (MJ, RR, MP, FS, YLT, MH), pp. 695–705.