Search
Add filters:
Use filters to refine the search results.
Results 1-5 of 5 (Search time: 0.006 seconds).
- previous
- 1
- next
Item hits:
Issue Date | Title | Author(s) |
---|---|---|
2011 | Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas | Danicic, S; Hierons, RM; Laurence, MR |
2011 | On the computational complexity of dynamic slicing problems for program schemas | Danicic, S; Hierons, RM; Laurence, MR |
2011 | Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas | Danicic, S; Hierons, RM; Laurence, MR |
2005 | Static program slicing algorithms are minimal for free liberal program schemas | Danicic, S; Fox, CJ; Harman, M; Hierons, RM; Howroyd, J; Laurence, MR |
2010 | A trajectory-based strict semantics for program slicing | Barraclough, RW; Binkley, D; Danicic, S; Harman, M; Hierons, RM; Kiss, A; Laurence, MR; Ouarbya, L |