Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time. Theoretical Computer Science (2007)

by S Danicic, M Harman, R Hierons, J Howroyd, M R Laurence
Venue:In 4 th IEEE Workshop on Program Comprehension