Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas

DOI10.1016/J.JLAP.2007.02.008zbMATH Open1119.68054OpenAlexW4212788310MaRDI QIDQ997992FDOQ997992

Authors: Michael R. Laurence 

Publication date: 10 August 2007

Published in: The Journal of Logic and Algebraic Programming (Search for Journal in Brave)

Full work available at URL: https://research.gold.ac.uk/10583/1/COM-LaurenceM-2007.pdf

Recommendations

• Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas
• On the computational complexity of dynamic slicing problems for program schemas
• Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas
• Program Slicing
• Assertion-based slicing and slice graphs

zbMATH Keywords

decidabilityprogram slicingprogram schemaslinear schemasconservative schemasfree schemasliberal schemas

Mathematics Subject Classification ID

Logic programming (68N17) Theory of software (68N99)

Cites Work

• Title not available (Why is that?)
• Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
• Random time evolution and direct integrals: Constants of the motion and the mass operator

Cited In (3)

• On the computational complexity of dynamic slicing problems for program schemas
• 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

This page was built for publication: Characterizing minimal semantics-preserving slices of function-linear, free, liberal program schemas

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997992)