default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael R. Laurence
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j11]Sebastian Danicic, Michael R. Laurence:
Static Backward Slicing of Non-deterministic Programs and Systems. ACM Trans. Program. Lang. Syst. 40(3): 11:1-11:46 (2018)- 2017
- [i4]Michael R. Laurence, Georg Struth:
Completeness Theorems for Pomset Languages and Concurrent Kleene Algebras. CoRR abs/1705.05896 (2017) - [i3]Sebastian Danicic, Robert M. Hierons
, Michael R. Laurence:
On the computational complexity of dynamic slicing problems for program schemas. CoRR abs/1705.07686 (2017) - [i2]Sebastian Danicic, Robert M. Hierons, Michael R. Laurence:
Characterizing Minimal Semantics-preserving Slices of predicate-linear, Free, Liberal Program Schemas. CoRR abs/1705.09615 (2017) - 2015
- [j10]James Cranch, Michael R. Laurence, Georg Struth:
Completeness results for omega-regular algebras. J. Log. Algebraic Methods Program. 84(3): 402-425 (2015) - 2014
- [c4]Michael R. Laurence, Georg Struth:
Completeness Theorems for Bi-Kleene Algebras and Series-Parallel Rational Pomset Languages. RAMiCS 2014: 65-82 - 2012
- [j9]Sebastian Danicic, Robert M. Hierons, Michael R. Laurence:
Complexity of Data Dependence Problems for Program Schemas with Concurrency. ACM Trans. Comput. Log. 13(2): 15:1-15:18 (2012) - [c3]Michael R. Laurence, Georg Struth:
On Completeness of Omega-Regular Algebras. RAMiCS 2012: 179-194 - 2011
- [j8]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): 92-112 (2011) - [j7]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): 481-496 (2011) - [j6]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): 1339-1362 (2011) - [j5]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): 6809-6842 (2011) - [c2]Michael R. Laurence, Georg Struth:
Omega Algebras and Regular Equations. RAMiCS 2011: 248-263 - 2010
- [i1]Sebastian Danicic, Robert M. Hierons, Michael R. Laurence:
Complexity of Data Dependence problems for Program Schemas with Concurrency. CoRR abs/1007.3878 (2010)
2000 – 2009
- 2007
- [j4]Michael R. Laurence:
Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas. J. Log. Algebraic Methods Program. 72(2): 157-172 (2007) - [j3]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): 1-18 (2007) - 2005
- [j2]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): 737-748 (2005) - 2003
- [j1]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): 831-862 (2003) - 2001
- [c1]Mark Harman, Robert M. Hierons, Sebastian Danicic, John Howroyd, Michael R. Laurence, Chris Fox:
Node Coarsening Calculi for Program Slicing. WCRE 2001: 25-34
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
