The following pages link to Mark Harman (Q650918):
Displaying 19 items.
- (Q204587) (redirect page) (← links)
- A unifying theory of control dependence and its application to arbitrary program structures (Q650921) (← links)
- A parallel algorithm for static program slicing (Q672833) (← links)
- Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time (Q875512) (← links)
- A trajectory-based strict semantics for program slicing (Q960858) (← links)
- A non-standard semantics for program slicing and dependence analysis (Q997995) (← links)
- An alternative characterization of weak order dependence (Q1675759) (← links)
- Slicing programs in the presence of errors (Q1815347) (← links)
- Equivalence of conservative, free, linear program schemas is decidable (Q1853616) (← links)
- Testing conformance of a deterministic implementation against a non-deterministic stream X-machine (Q1882901) (← links)
- A formal relationship between program slicing and partial evaluation (Q2432231) (← links)
- Theoretical foundations of dynamic program slicing (Q2503318) (← links)
- A formalisation of the relationship between forms of program slicing (Q2507782) (← links)
- (Q4436979) (← links)
- (Q4451888) (← links)
- (Q4451890) (← links)
- (Q4484349) (← links)
- Formal Approaches to Software Testing (Q5902017) (← links)
- Testing conformance to a quasi-non-deterministic stream X-machine (Q5944212) (← links)
