Equivalence of conservative, free, linear program schemas is decidable
type: Item
instance of: scholarly article
title: Equivalence of conservative, free, linear program schemas is decidable
zbMATH Open document ID: 1019.68011
DOI: 10.1016/S0304-3975(02)00374-2
author: Michael R. Laurence
author: Sebastian Danicic
author: Mark Harman
author: Rob Hierons
author: J. D. Howroyd
published in: Theoretical Computer Science
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 1857133
zbMATH Keywords: program schemas
zbMATH Keywords: decidability
zbMATH Keywords: conservative schemas
zbMATH Keywords: free schemas
zbMATH Keywords: linear schemas
MaRDI profile type: Publication
Wikidata QID: Q59610622
cites work: A parallel algorithm for static program slicing
cites work: Q4766001
cites work: Theory of program structures: Schemes, semantics, verification
cites work: Slicing programs in the presence of errors
cites work: Q4162449
cites work: Q5517672
cites work: On formalised computer programs
cites work: Q4124327
cites work: An algorithm deciding functional equivalence in a new class of program schemes
cites work: Combining slicing and constraint solving for validation of measurement software
cites work: Program Slicing
cites work: Translatability and Decidability Questions for Restricted Classes of Program Schemas
cites work: Modifications of the program scheme model
DBLP publication ID: journals/tcs/LaurenceDHHH03
description: scientific article; zbMATH DE number 1857133