Translating Program Schemas to While-Schemas

DOI10.1137/0204011zbMath0271.68014OpenAlexW1990632580MaRDI QIDQ3214370

Zohar Manna, E. A. Ashcroft

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)

Related Items (5)

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

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