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

DOI10.1016/j.jlap.2007.02.008zbMath1119.68054OpenAlexW4212788310MaRDI QIDQ997992

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

zbMATH Keywords

decidabilityprogram slicingprogram schemaslinear schemasconservative schemasfree schemasliberal schemas

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• 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

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