Mark Harman - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 32 from 32

2009

Control Dependence for Extended Finite State MachinesKelly Androutsopoulos, David Clark, Mark Harman, Zheng Li, Laurence Tratt. FASE 2009: 216-230 [doi]

Empirical evaluation of a nesting testability transformation for evolutionary testingPhil McMinn, David W. Binkley, Mark Harman. TOSEM, 18(3), 2009. [doi]

2008

An empirical study of the relationship between the concepts expressed in source code and dependenceDavid W. Binkley, Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahdavi. jss, 81(12):2287-2298, 2008. [doi]

Evaluating Key Statements AnalysisDavid W. Binkley, Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahdavi. SCAM 2008: 121-130 [doi]

Search-based software engineeringWalter J. Gutjahr, Mark Harman. cor, 35(10):3049-3051, 2008. [doi]

2007

Empirical study of optimization techniques for massive slicingDavid W. Binkley, Mark Harman, Jens Krinke. TOPLAS, 30(1):3, 2007. [doi]

Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial timeSebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence. TCS, 373(1-2):1-18, 2007. [doi]

2006

A formal relationship between program slicing and partial evaluationDavid W. Binkley, Sebastian Danicic, Mark Harman, John Howroyd, Lahcen Ouarbya. fac, 18(2):103-119, 2006. [doi]

Beyond Program Slicing, 06.11. - 11.11.2005David W. Binkley, Mark Harman, Jens Krinke, editors, Volume 05451 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2006.

An Empirical Study of Executable Concept Slice SizeDavid W. Binkley, Nicolas Gold, Mark Harman, Zheng Li, Kiarash Mahdavi. WCRE 2006: 103-114 [doi]

Selected papers from the fourth Source Code Analysis and Manipulation (SCAM 2004) WorkshopThomas R. Dean, Mark Harman, Rainer Koschke, Michael L. Van de Vanter. jss, 79(9):1217-1218, 2006. [doi]

2005

2004

How to Overcome the Equivalent Mutant Problem and Achieve Tailored Selective Mutation Using Co-evolutionKonstantinos Adamopoulos, Mark Harman, Robert M. Hierons. gecco 2004: 1338-1349 [doi]

Analysis and Visualization of Predicate Dependence on Formal Parameters and Global VariablesDavid W. Binkley, Mark Harman. TSE, 30(11):715-735, 2004. [doi]

A survey of empirical results on program slicingDavid W. Binkley, Mark Harman. ac, 62:106-179, 2004.

IntroductionDavid W. Binkley, Liz Burd, Mark Harman, Paolo Tonella. sqj, 12(4):293-295, 2004. [doi]

Building Executable Union Slices using Conditioned SlicingSebastian Danicic, Andrea De Lucia, Mark Harman. IWPC 2004: 89-99 [doi]

Getting Results from Search-Based Approaches to Software EngineeringMark Harman, Joachim Wegener. ICSE 2004: 728-729 [doi]

Syntax-Directed Amorphous SlicingMark Harman, Lin Hu, Malcolm Munro, Xingyuan Zhang, David W. Binkley, Sebastian Danicic, Mohammed Daoudi, Lahcen Ouarbya. ASE, 11(1):27-61, 2004. [doi]

Loop Squashing Transformations for Amorphous SlicingLin Hu, Mark Harman, Robert M. Hierons, David W. Binkley. WCRE 2004: 152-160 [doi]

2003

2002

VADA: A Transformation-Based System for Variable Dependence AnalysisMark Harman, Chris Fox, Robert M. Hierons, Lin Hu, Sebastian Danicic, Joachim Wegener. SCAM 2002: 55-64 [doi]

Code Extraction Algorithms which Unify Slicing and Concept AssignmentMark Harman, Nicolas Gold, Robert M. Hierons, David W. Binkley. WCRE 2002: 11-21 [doi]

2001

Pre/Post Conditioned SlicingMark Harman, Robert M. Hierons, Chris Fox, Sebastian Danicic, John Howroyd. ICSM 2001: 138-147 [doi]

1998

A new algorithm for slicing unstructured programsMark Harman, Sebastian Danicic. SMR, 10(6):415-441, 1998. [doi]

Sign in or sign up to see more results.

runs on WebDSL