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. Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time. Theoretical Computer Science, 373(1-2):1-18, 2007. [doi]

Abstract

Abstract is missing.