Brunel University Research Archive (BURA) >

Browsing by Author Laurence, MR

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 1 to 10 of 10
Issue DateTitleAuthor(s)
2011Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemasDanicic, S; Hierons, RM; Laurence, MR
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
2003Equivalence of conservative, free, linear program schemas is decidableLaurence, MR; Danicic, S; Harman, M; Hierons, RM; Howroyd, J
2007Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial timeDanicic, S; Harman, M; Hierons, RM; Howroyd, J; Laurence, MR
2001Node coarsening calculi for program slicingHarman, M; Hierons, RM; Danicic, S; Howroyd, J; Laurence, MR, et al
2011On the computational complexity of dynamic slicing problems for program schemasDanicic, S; Hierons, RM; Laurence, MR
2005Static program slicing algorithms are minimal for free liberal program schemasDanicic, S; Fox, CJ; Harman, M; Hierons, RM; Howroyd, J, et al
2005Static program slicing algorithms are minimal for free liberal program schemasDanicic, S; Fox, C; Harman, M; Hierons, RM; Howroyd, J, et al
2010A trajectory-based strict semantics for program slicingBarraclough, RW; Binkley, D; Danicic, S; Harman, M; Hierons, RM, et al
Showing results 1 to 10 of 10