 | 2007 |
|---|
| 5 |       | Michael R. Laurence:
Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas.
J. Log. Algebr. Program. 72(2): 157-172 (2007) |
| 4 | | 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) |
| 2005 |
|---|
| 3 | | 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) |
| 2003 |
|---|
| 2 |  | 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) |
| 2001 |
|---|
| 1 | | Mark Harman,
Robert M. Hierons,
Sebastian Danicic,
John Howroyd,
Michael R. Laurence,
Chris Fox:
Node Coarsening Calculi for Program Slicing.
WCRE 2001: 25-34 |
