Equivalence of conservative, free, linear program schemas is decidable

TY - JOUR

T1 - Equivalence of conservative, free, linear program schemas is decidable

AU - Laurence, M R

AU - Danicic, S

AU - Harman, M

AU - Hierons, R

AU - Howroyd, J

PY - 2003/1/1

Y1 - 2003/1/1

N2 - 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. (49 References).

AB - 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. (49 References).

U2 - 10.1016/S0304-3975(02)00374-2

DO - 10.1016/S0304-3975(02)00374-2

M3 - Article

VL - 290

SP - 831

EP - 862

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - 1

ER -