Equivalence of conservative, free, linear program schemas is decidable

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/364

Full metadata record

DC Field	Value	Language
dc.contributor.author	Laurence, MR	-
dc.contributor.author	Danicic, S	-
dc.contributor.author	Harman, M	-
dc.contributor.author	Hierons, RM	-
dc.contributor.author	Howroyd, J	-
dc.coverage.spatial	40	en
dc.date.accessioned	2006-11-07T15:34:01Z	-
dc.date.available	2006-11-07T15:34:01Z	-
dc.date.issued	2003	-
dc.identifier.citation	Theoretical Computer Science, 290(1): 831 - 862, Jan 2003	en
dc.identifier.uri	http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=638014	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/364	-
dc.description.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.	en
dc.format.extent	685490 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	ACM Press, New York, NY, USA	en
dc.subject	Conservative schemas	en
dc.subject	Decidability	en
dc.subject	Free schemas	en
dc.subject	Linear schemas	en
dc.subject	Program schemas	en
dc.title	Equivalence of conservative, free, linear program schemas is decidable	en
dc.type	Research Paper	en
dc.identifier.doi	http://dx.doi.org/10.1016/S0304-3975(02)00374-2	-
Appears in Collections:	Computer Science Dept of Computer Science Research Papers Software Engineering (B-SERC)

Files in This Item:

File	Description	Size	Format
Equivalence of Conservative.pdf		669.42 kB	Adobe PDF	View/Open