Equivalence of conservative, free, linear program schemas is decidable

  • Authors:

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

  • Affiliations:

  • Department of Mathematical and Computing Sciences, Goldsmiths College, University of London, New Cross, London SE14 6NW, UK;Department of Mathematical and Computing Sciences, Goldsmiths College, University of London, New Cross, London SE14 6NW, UK;Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex UB8 3PH, UK;Department of Information Systems and Computing, Brunel University, Uxbridge, Middlesex UB8 3PH, UK;Department of Mathematical and Computing Sciences, Goldsmiths College, University of London, New Cross, London SE14 6NW, UK

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2003

Quantified Score

Hi-index 5.23

Visualization

Abstract

A program schema defines a class of programs, all of which have identical statement structures, but whose expressions may differ. We prove that given any two structured schemas which are conservative, linear and free, it is decidable whether they are equivalent.