Michael R. Laurence

According to our database, Michael R. Laurence authored at least 16 papers between 2001 and 2018.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2018

Static Backward Slicing of Non-deterministic Programs and Systems.

Sebastian Danicic, Michael R. Laurence

ACM Trans. Program. Lang. Syst., 2018

2017

Completeness Theorems for Pomset Languages and Concurrent Kleene Algebras.

Michael R. Laurence, Georg Struth

CoRR, 2017

2015

Completeness results for omega-regular algebras.

James Cranch, Michael R. Laurence, Georg Struth

J. Log. Algebraic Methods Program., 2015

2014

Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages.

Michael R. Laurence, Georg Struth

Proceedings of the Relational and Algebraic Methods in Computer Science, 2014

2012

Complexity of Data Dependence Problems for Program Schemas with Concurrency.

Sebastian Danicic, Robert M. Hierons, Michael R. Laurence

ACM Trans. Comput. Log., 2012

On Completeness of Omega-Regular Algebras.

Michael R. Laurence, Georg Struth

Proceedings of the Relational and Algebraic Methods in Computer Science, 2012

2011

A unifying theory of control dependence and its application to arbitrary program structures.

Sebastian Danicic, Richard W. Barraclough, Mark Harman, John Howroyd, Ákos Kiss, Michael R. Laurence

Theor. Comput. Sci., 2011

On the computational complexity of dynamic slicing problems for program schemas.

Sebastian Danicic, Robert M. Hierons, Michael R. Laurence

Math. Struct. Comput. Sci., 2011

Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas.

Sebastian Danicic, Robert M. Hierons, Michael R. Laurence

J. Log. Algebraic Methods Program., 2011

Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas.

Sebastian Danicic, Robert M. Hierons, Michael R. Laurence

J. Log. Algebraic Methods Program., 2011

Omega Algebras and Regular Equations.

Michael R. Laurence, Georg Struth

Proceedings of the Relational and Algebraic Methods in Computer Science, 2011

2007

Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time.

Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence

Theor. Comput. Sci., 2007

Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas.

Michael R. Laurence

J. Log. Algebraic Methods Program., 2007

2005

Static Program Slicing Algorithms are Minimal for Free Liberal Program Schemas.

Sebastian Danicic, Chris Fox, Mark Harman, Robert M. Hierons, John Howroyd, Michael R. Laurence

Comput. J., 2005

2003

Equivalence of conservative, free, linear program schemas is decidable.

Michael R. Laurence, Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd

Theor. Comput. Sci., 2003

2001

Node Coarsening Calculi for Program Slicing.

Mark Harman, Robert M. Hierons, Sebastian Danicic, John Howroyd, Michael R. Laurence, Chris Fox

Proceedings of the Eighth Working Conference on Reverse Engineering, 2001