Menu

Items Authored/Edited by Harman, M.

Up a level
Export as [feed] Atom [feed] RSS
Group by: Item Type | Date | No Grouping
Jump to: 2007 | 2003
Number of items: 2.

2007

Danicic, Sebastian; Harman, M.; Hierons, R. and Laurence, M.. 2007. Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time. Theoretical Computer Science, 373(1-2), pp. 1-18. ISSN 03043975 [Article]

2003

Danicic, Sebastian; Laurence, M.; Harman, M. and Hierons, R.. 2003. Equivalence of conservative, free, linear programs is decidable. Theoretical Computer Science, 290(1), pp. 831-862. ISSN 03043975 [Article]

This list was generated on Wed Apr 24 04:42:27 2024 BST.