Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time

DOI10.1016/j.tcs.2006.10.001zbMath1111.68024OpenAlexW2108320473WikidataQ59610175 ScholiaQ59610175MaRDI QIDQ875512

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

Publication date: 13 April 2007

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.10.001

zbMATH Keywords

static analysisprogram slicinglinear schemasconservative schemasfree schemasliberal schemasschema equivalencestructured program schemas

Mathematics Subject Classification ID

Theory of software (68N99)

Related Items (6)

Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time ⋮ Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas ⋮ Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas ⋮ A trajectory-based strict semantics for program slicing ⋮ Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas ⋮ On the computational complexity of dynamic slicing problems for program schemas

Cites Work

• Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
• An algorithm deciding functional equivalence in a new class of program schemes
• Theory of program structures: Schemes, semantics, verification
• Equivalence of conservative, free, linear program schemas is decidable
• Translating Program Schemas to While-Schemas
• On the power of programming features
• Random time evolution and direct integrals: Constants of the motion and the mass operator
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time