| 2007 |
|---|
| 9 | EE | 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) |
| 8 | EE | 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 |
|---|
| 7 | EE | 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) |
| 2005 |
|---|
| 6 | EE | 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) |
| 5 | EE | 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) |
| 2003 |
|---|
| 4 | | 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 |
|---|
| 3 | EE | 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 |
| 2001 |
|---|
| 2 | EE | Mark Harman,
Robert M. Hierons,
Chris Fox,
Sebastian Danicic,
John Howroyd:
Pre/Post Conditioned Slicing.
ICSM 2001: 138-147 |
| 1 | EE | Mark Harman,
Robert M. Hierons,
Sebastian Danicic,
John Howroyd,
Michael R. Laurence,
Chris Fox:
Node Coarsening Calculi for Program Slicing.
WCRE 2001: 25-34 |
