Brunel University Research Archive: Search

Search

Results 1-10 of 17 (Search time: 0.012 seconds).

Item hits:

Issue Date	Title	Author(s)
2012	Complexity of data dependence problems for program schemas with concurrency	Danicic, S; Hierons, RM; Laurence, MR
2011	Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas	Danicic, S; Hierons, RM; Laurence, MR
2011	On the computational complexity of dynamic slicing problems for program schemas	Danicic, S; Hierons, RM; Laurence, MR
2011	Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas	Danicic, S; Hierons, RM; Laurence, MR
2001	Node coarsening calculi for program slicing	Harman, M; Hierons, RM; Danicic, S; Howroyd, J; Laurence, MR; Fox, C
2005	Static program slicing algorithms are minimal for free liberal program schemas	Danicic, S; Fox, C; Harman, M; Hierons, RM; Howroyd, J; Laurence, MR
2007	Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time	Danicic, S; Harman, M; Hierons, RM; Howroyd, J; Laurence, MR
2003	Equivalence of conservative, free, linear program schemas is decidable	Laurence, MR; Danicic, S; Harman, M; Hierons, RM; Howroyd, J
2001	Backward conditioning: A new program specialisation technique and its application to program comprehension	Fox, C; Harman, M; Hierons, RM; Danicic, S
2000	ConSIT: A conditioned program slicer	Danicic, S; Fox, C; Harman, M; Hierons, RM