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.
Results 1-7 of 7 (Search time: 0.013 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 |
| 2001 | Pre/post conditioned slicing | Harman, M; Hierons, RM; Fox, C; Danicic, S; Howroyd, J |
| 2005 | ConSUS: A light-weight program conditioner | Danicic, S; Daoudi, M; Fox, CJ; Harman, M; Hierons, RM; Howroyd, J; Ourabya, L; Ward, M |
| 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