Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
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. Theoretical Computer Science, 373(1-2):1-18, 2007. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemasSebastian Danicic, Robert M. Hierons, Michael R. Laurence. jlp, 80(2):92-112, 2011. [doi] Equivalence of conservative, free, linear program schemas is decidableMichael R. Laurence, Sebastian Danicic, Mark Harman, Robert M. Hierons, John Howroyd. TCS, 290(1):831-862, 2003.
The following publications are possibly variants of this publication: