Browse by Goldsmiths authors: Laurence, Michael

Item Type Date No Grouping

Complexity of data dependence problems for program schemas with concurrency. (2012) Danicic, Sebastian; Hierons, Robert and Laurence, Michael

A unifying theory of control dependence and its application to arbitrary program structures. (2011) Danicic, Sebastian; Barraclough, Richard; Harman, Mark; Howroyd, John; Kiss, Akos and Laurence, Michael

Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas. (2011) Danicic, Sebastian; Hierons, Robert and Laurence, Michael

Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas. (2011) Danicic, Sebastian; Hierons, Robert and Laurence, Michael

On the computational complexity of dynamic slicing problems for program schemas. (2011) Danicic, Sebastian; Hierons, Robert and Laurence, Michael

A trajectory-based strict semantics for program slicing. (2010) Danicic, Sebastian; Barraclough, Richard; Binkley, David; Harman, Mark; Hierons, Robert; Kiss, Ákos; Laurence, Michael and Ouarbya, Lahcen

Decidability of Strong Equivalence for Subschemas of a Class of Linear, Free, near-Liberal Program Schemas. (2009) Danicic, Sebastian; Laurence, Michael and Hierons, Robert

Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas. (2007) Laurence, Michael

Slicing algorithms are minimal for programs which can be expressed as linear, free, liberal schemas. (2005) Danicic, Sebastian; Fox, Chris; Harman, Mark; Hierons, Robert; Howroyd, John and Laurence, Michael

Applications of linear program schematology in dependence analysis. (2004) Danicic, Sebastian; Harman, Mark; Hierons, Robert; Howroyd, John; Laurence, Michael and Danicic, Sebastian

Node coarsening calculi for program slicing. (2001) Harman, Mark; Hierons, Robert; Danicic, Sebastian; Howroyd, John; Laurence, Michael and Fox, Chris