Michael R. Laurence

Publication Activity (10 Years)

Years Active: 2001-2018
Publications (10 Years): 5

Top Topics

Computational Complexity

Clifford Algebra

Top Venues

J. Log. Algebraic Methods Program.

ACM Trans. Comput. Log.

Publications

Sebastian Danicic, Michael R. Laurence
Static Backward Slicing of Non-deterministic Programs and Systems. ACM Trans. Program. Lang. Syst. 40 (3) (2018)
Michael R. Laurence, Georg Struth
Completeness Theorems for Pomset Languages and Concurrent Kleene Algebras. CoRR (2017)
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
On the computational complexity of dynamic slicing problems for program schemas. CoRR (2017)
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
Characterizing Minimal Semantics-preserving Slices of predicate-linear, Free, Liberal Program Schemas. CoRR (2017)
James Cranch, Michael R. Laurence, Georg Struth
Completeness results for omega-regular algebras. J. Log. Algebraic Methods Program. 84 (3) (2015)
Michael R. Laurence, Georg Struth
Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages. RAMiCS (2014)
Michael R. Laurence, Georg Struth
On Completeness of Omega-Regular Algebras. RAMiCS (2012)
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
Complexity of Data Dependence Problems for Program Schemas with Concurrency. ACM Trans. Comput. Log. 13 (2) (2012)
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas. J. Log. Algebraic Methods Program. 80 (8) (2011)
Michael R. Laurence, Georg Struth
Omega Algebras and Regular Equations. RAMiCS (2011)
Sebastian Danicic, Richard W. Barraclough, Mark Harman, John Howroyd, Ákos Kiss, Michael R. Laurence
A unifying theory of control dependence and its application to arbitrary program structures. Theor. Comput. Sci. 412 (49) (2011)
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
On the computational complexity of dynamic slicing problems for program schemas. Math. Struct. Comput. Sci. 21 (6) (2011)
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas. J. Log. Algebraic Methods Program. 80 (2) (2011)
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
Complexity of Data Dependence problems for Program Schemas with Concurrency CoRR (2010)
Michael R. Laurence
Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas. J. Log. Algebraic Methods Program. 72 (2) (2007)
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. Theor. Comput. Sci. 373 (1-2) (2007)
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. Comput. J. 48 (6) (2005)
Michael R. Laurence, Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd
Equivalence of conservative, free, linear program schemas is decidable. Theor. Comput. Sci. 290 (1) (2003)
Mark Harman, Robert M. Hierons, Sebastian Danicic, John Howroyd, Michael R. Laurence, Chris Fox
Node Coarsening Calculi for Program Slicing. WCRE (2001)