Please use this identifier to cite or link to this item:
Title: Equivalence of conservative, free, linear program schemas is decidable
Authors: Laurence, MR
Danicic, S
Harman, M
Hierons, RM
Howroyd, J
Keywords: Conservative schemas;Decidability;Free schemas;Linear schemas;Program schemas
Issue Date: 2003
Publisher: ACM Press, New York, NY, USA
Citation: Theoretical Computer Science, 290(1): 831 - 862, Jan 2003
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.
Appears in Collections:Computer Science
Dept of Computer Science Research Papers
Software Engineering (B-SERC)

Files in This Item:
File Description SizeFormat 
Equivalence of Conservative.pdf669.42 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.