Search the dblp DataBase
Michael R. Laurence: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Mark Harman, Robert M. Hierons, Sebastian Danicic, John Howroyd, Michael R. Laurence, Chris Fox
Node Coarsening Calculi for Program Slicing. [Citation Graph (0, 0)][DBLP]
WCRE, 2001, pp:25-34 [Conf] - Sebastian Danicic, Chris Fox, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence
Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas. [Citation Graph (0, 0)][DBLP]
Comput. J., 2005, v:48, n:6, pp:737-748 [Journal] - Michael R. Laurence, Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd
Equivalence of conservative, free, linear program schemas is decidable. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2003, v:290, n:1, pp:831-862 [Journal] - Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time. [Citation Graph (0, 0)][DBLP]
Theor. Comput. Sci., 2007, v:373, n:1-2, pp:1-18 [Journal] - Michael R. Laurence
Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas. [Citation Graph (0, 0)][DBLP]
J. Log. Algebr. Program., 2007, v:72, n:2, pp:157-172 [Journal]
Complexity of Data Dependence problems for Program Schemas with Concurrency [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002