Search
Add filters:
Use filters to refine the search results.
Results 1-5 of 5 (Search time: 0.004 seconds).
- previous
- 1
- next
Item hits:
Issue Date | Title | Author(s) |
---|---|---|
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 |
2005 | Static program slicing algorithms are minimal for free liberal program schemas | Danicic, S; Fox, CJ; Harman, M; Hierons, RM; Howroyd, J; Laurence, MR |
Discover
Subject