Translating Program Schemas to While-Schemas

DOI10.1137/0204011MaRDI QIDQ3214370zbMATH OpenOpenAlexFDO

Authors E. A. Ashcroft, Zohar Manna

Publication date 1975

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0204011

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Cited in

(5)

• Modifications of the program scheme model
• 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
• Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time

This page was built for publication: Translating Program Schemas to While-Schemas

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