<?xml version="1.0"?>
<dblp>
<article key="journals/tcs/DanicicHHHL07" mdate="2007-03-30">
<author>Sebastian Danicic</author>
<author>Mark Harman</author>
<author>Robert M. Hierons</author>
<author>John Howroyd</author>
<author>Michael R. Laurence</author>
<title>Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time.</title>
<pages>1-18</pages>
<year>2007</year>
<volume>373</volume>
<journal>Theor. Comput. Sci.</journal>
<number>1-2</number>
<ee>http://dx.doi.org/10.1016/j.tcs.2006.10.001</ee>
<url>db/journals/tcs/tcs373.html#DanicicHHHL07</url>
</article>
</dblp>
