Search


Current filters:
Start a new search
Add filters:

Use filters to refine the search results.


Results 1-10 of 17 (Search time: 0.021 seconds).
Item hits:
Issue DateTitleAuthor(s)
2012Complexity of data dependence problems for program schemas with concurrencyDanicic, S; Hierons, RM; Laurence, MR
2011Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemasDanicic, S; Hierons, RM; Laurence, MR
2011On the computational complexity of dynamic slicing problems for program schemasDanicic, S; Hierons, RM; Laurence, MR
2011Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemasDanicic, S; Hierons, RM; Laurence, MR
2001Node coarsening calculi for program slicingHarman, M; Hierons, RM; Danicic, S; Howroyd, J; Laurence, MR; Fox, C
2005Static program slicing algorithms are minimal for free liberal program schemasDanicic, S; Fox, C; Harman, M; Hierons, RM; Howroyd, J; Laurence, MR
2007Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial timeDanicic, S; Harman, M; Hierons, RM; Howroyd, J; Laurence, MR
2003Equivalence of conservative, free, linear program schemas is decidableLaurence, MR; Danicic, S; Harman, M; Hierons, RM; Howroyd, J
2001Backward conditioning: A new program specialisation technique and its application to program comprehensionFox, C; Harman, M; Hierons, RM; Danicic, S
2000ConSIT: A conditioned program slicerDanicic, S; Fox, C; Harman, M; Hierons, RM