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

  • Authors:

  • Sebastian Danicic;Mark Harman;Rob Hierons;John Howroyd;Michael R. Laurence

  • Affiliations:

  • Department of Computing Sciences, Goldsmiths College, University of London, New Cross, London SE14 6NW, UK;Department of Computer Science, Kings College London, Strand, London WC2R 2LS, UK;Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex, UB8 3PH, UK;@UK PLC 5 Jupiter House Calleva Park Aldermaston, Berks RG7 8NN, UK;Department of Computing Sciences, Goldsmiths College, University of London, New Cross, London SE14 6NW, UK

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2007

Quantified Score

Hi-index 5.23

Visualization

Abstract

A program schema defines a class of programs, all of which have identical statement structure, but whose expressions may differ. We define a class of syntactic similarity binary relations between linear structured schemas, which characterise schema equivalence for structured schemas that are linear, free and liberal. In this paper we report that similarity implies equivalence for linear schemas, and that a near-converse holds for schemas that are linear, free and liberal. We also show that the similarity of two linear schemas is polynomial-time decidable. Our main result considerably extends the class of program schemas for which equivalence is known to be decidable, and suggests that linearity is a constraint worthy of further investigation.