Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
type: Item
instance of: scholarly article
title: Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
zbMATH Open document ID: 1111.68024
author: Sebastian Danicic
author: Mark Harman
author: Rob Hierons
author: Michael R. Laurence
author: J. D. Howroyd
published in: Theoretical Computer Science
publication date: 2007-04-13T00:00:00Z
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 5142386
zbMATH Keywords: structured program schemas
zbMATH Keywords: conservative schemas
zbMATH Keywords: liberal schemas
zbMATH Keywords: free schemas
zbMATH Keywords: linear schemas
zbMATH Keywords: schema equivalence
zbMATH Keywords: static analysis
zbMATH Keywords: program slicing
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.10.001
OpenAlex ID: W2108320473
Wikidata QID: Q59610175
cites work: Theory of program structures: Schemes, semantics, verification
cites work: Q4124327
cites work: Q4068063
cites work: Q4127981
cites work: On the power of programming features
cites work: Equivalence of conservative, free, linear program schemas is decidable
cites work: Translating Program Schemas to While-Schemas
cites work: Q5517672
cites work: An algorithm deciding functional equivalence in a new class of program schemes
cites work: Random time evolution and direct integrals: Constants of the motion and the mass operator
DOI: 10.1016/J.TCS.2006.10.001
description: scientific article; zbMATH DE number 5142386