Search


Current filters:

Start a new search
Add filters:

Use filters to refine the search results.


Results 1-7 of 7 (Search time: 0.025 seconds).
  • previous
  • 1
  • next
Item hits:
Issue DateTitleAuthor(s)
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
2001Pre/post conditioned slicingHarman, M; Hierons, RM; Fox, C; Danicic, S; Howroyd, J
2005ConSUS: A light-weight program conditionerDanicic, S; Daoudi, M; Fox, CJ; Harman, M; Hierons, RM; Howroyd, J; Ourabya, L; Ward, M
2005Static program slicing algorithms are minimal for free liberal program schemasDanicic, S; Fox, CJ; Harman, M; Hierons, RM; Howroyd, J; Laurence, MR