Pages that link to "Item:Q3214370"
From MaRDI portal
The following pages link to Translating Program Schemas to While-Schemas (Q3214370):
Displaying 5 items.
- Decidability of strong equivalence for subschemas of a class of linear, free, near-liberal program schemas (Q624386) (← links)
- Characterizing minimal semantics-preserving slices of predicate-linear, free, liberal program schemas (Q649588) (← links)
- Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time (Q875512) (← links)
- Modifications of the program scheme model (Q1258173) (← links)
- On the computational complexity of dynamic slicing problems for program schemas (Q3103616) (← links)