Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time

  • S Danicic
  • , M Harman
  • , R Hierons
  • , J Howroyd
  • , M R Laurence

Research output: Contribution to journalArticlepeer-review

5 Citations (Scopus)

Fingerprint

Dive into the research topics of 'Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time'. Together they form a unique fingerprint.
Sort by

Computer Science

Mathematics