Brunel University Research Archive(BURA) preserves and enables easy and open access to all
types of digital content. It showcases Brunel's research outputs.
Research contained within BURA is open access, although some publications may be subject
to publisher imposed embargoes. All awarded PhD theses are also archived on BURA.
Search
Add filters:
Use filters to refine the search results.
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 |
| 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 |
| 2002 | VADA: A transformation-based system for variable dependence analysis | Harman, M; Fox, C; Hierons, RM; Hu, L; Danicic, S; Wegener, J |
| 2001 | Pre/post conditioned slicing | Harman, M; Hierons, RM; Fox, C; Danicic, S; Howroyd, J |
| 1999 | Program simplification as a means of approximating undecidable propositions | Harman, M; Fox, C; Hierons, RM; Binkley, D; Danicic, S |
| 2005 | ConSUS: A light-weight program conditioner | Danicic, S; Daoudi, M; Fox, CJ; Harman, M; Hierons, RM; Howroyd, J; Ourabya, L; Ward, M |