Equivalence of conservative, free, linear program schemas is decidable

DOI10.1016/S0304-3975(02)00374-2zbMath1019.68011WikidataQ59610622 ScholiaQ59610622MaRDI QIDQ1853616

Rob Hierons, Mark Harman, Michael R. Laurence, Sebastian Danicic, John D. Howroyd

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

decidabilityprogram schemaslinear schemasconservative schemasfree schemas

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (5)

Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time ⋮ Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas ⋮ A trajectory-based strict semantics for program slicing ⋮ Theoretical foundations of dynamic program slicing ⋮ On the computational complexity of dynamic slicing problems for program schemas

Cites Work

• A parallel algorithm for static program slicing
• An algorithm deciding functional equivalence in a new class of program schemes
• Theory of program structures: Schemes, semantics, verification
• Modifications of the program scheme model
• Slicing programs in the presence of errors
• On formalised computer programs
• Program Slicing
• Translatability and Decidability Questions for Restricted Classes of Program Schemas
• Combining slicing and constraint solving for validation of measurement software
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equivalence of conservative, free, linear program schemas is decidable