Michael R. Laurence

19 papers C 3Journal 15Unranked 1
YearRankTypeTitle / Venue / Authors
2018 J jnl
Static Backward Slicing of Non-deterministic Programs and Systems.
ACM Trans. Program. Lang. Syst.
Sebastian Danicic, Michael R. Laurence
2017 J jnl
Characterizing Minimal Semantics-preserving Slices of predicate-linear, Free, Liberal Program Schemas.
CoRR
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
2017 J jnl
Completeness Theorems for Pomset Languages and Concurrent Kleene Algebras.
CoRR
Michael R. Laurence, Georg Struth
2017 J jnl
On the computational complexity of dynamic slicing problems for program schemas.
CoRR
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
2015 J jnl
Completeness results for omega-regular algebras.
J. Log. Algebraic Methods Program.
James Cranch, Michael R. Laurence, Georg Struth
2014 C conf
Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages.
RAMiCS
Michael R. Laurence, Georg Struth
2012 J jnl
Complexity of Data Dependence Problems for Program Schemas with Concurrency.
ACM Trans. Comput. Log.
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
2012 C conf
On Completeness of Omega-Regular Algebras.
RAMiCS
Michael R. Laurence, Georg Struth
2011 J jnl
A unifying theory of control dependence and its application to arbitrary program structures.
Theor. Comput. Sci.
Sebastian Danicic, Richard W. Barraclough, Mark Harman, John Howroyd, Ákos Kiss, Michael R. Laurence
2011 J jnl
Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas.
J. Log. Algebraic Methods Program.
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
2011 J jnl
Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas.
J. Log. Algebraic Methods Program.
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
2011 C conf
Omega Algebras and Regular Equations.
RAMiCS
Michael R. Laurence, Georg Struth
2011 J jnl
On the computational complexity of dynamic slicing problems for program schemas.
Math. Struct. Comput. Sci.
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
2010 J jnl
Complexity of Data Dependence problems for Program Schemas with Concurrency
CoRR
Sebastian Danicic, Robert M. Hierons, Michael R. Laurence
2007 J jnl
Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas.
J. Log. Algebraic Methods Program.
Michael R. Laurence
2007 J jnl
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time.
Theor. Comput. Sci.
Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence
2005 J jnl
Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas.
Comput. J.
Sebastian Danicic, Chris Fox, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence
2003 J jnl
Equivalence of conservative, free, linear program schemas is decidable.
Theor. Comput. Sci.
Michael R. Laurence, Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd
2001 — conf
Node Coarsening Calculi for Program Slicing.
WCRE
Mark Harman, Robert M. Hierons, Sebastian Danicic, John Howroyd, Michael R. Laurence, Chris Fox